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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:36 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-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 1678242404102

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-d1m08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 02:26:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 02:26:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 02:26:45] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-08 02:26:45] [INFO ] Transformed 1440 places.
[2023-03-08 02:26:45] [INFO ] Transformed 672 transitions.
[2023-03-08 02:26:45] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1093 places in 4 ms
Reduce places removed 1093 places and 0 transitions.
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-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-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2023-03-08 02:26:45] [INFO ] Computed 6 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 949 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 1026 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 959 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 943 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 962 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
[2023-03-08 02:26:46] [INFO ] Invariant cache hit.
[2023-03-08 02:26:46] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-08 02:26:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2023-03-08 02:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:46] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-08 02:26:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:26:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 02:26:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 02:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:46] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-08 02:26:46] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-08 02:26:46] [INFO ] [Nat]Added 418 Read/Feed constraints in 110 ms returned sat
[2023-03-08 02:26:47] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 133 ms.
[2023-03-08 02:26:47] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
[2023-03-08 02:26:47] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 1 ms to minimize.
[2023-03-08 02:26:47] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 1 ms to minimize.
[2023-03-08 02:26:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 583 ms
[2023-03-08 02:26:47] [INFO ] Added : 15 causal constraints over 4 iterations in 965 ms. Result :sat
Minimization took 1177 ms.
[2023-03-08 02:26:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:26:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 02:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:49] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-08 02:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:26:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 02:26:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-08 02:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:49] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-08 02:26:49] [INFO ] [Nat]Added 418 Read/Feed constraints in 80 ms returned sat
[2023-03-08 02:26:49] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 60 ms.
[2023-03-08 02:26:50] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 2 ms to minimize.
[2023-03-08 02:26:50] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 3 ms to minimize.
[2023-03-08 02:26:50] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2023-03-08 02:26:50] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2023-03-08 02:26:50] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2023-03-08 02:26:50] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 0 ms to minimize.
[2023-03-08 02:26:51] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 1 ms to minimize.
[2023-03-08 02:26:51] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 0 ms to minimize.
[2023-03-08 02:26:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1604 ms
[2023-03-08 02:26:51] [INFO ] Added : 26 causal constraints over 6 iterations in 2035 ms. Result :sat
Minimization took 146 ms.
[2023-03-08 02:26:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:26:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-08 02:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:51] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-08 02:26:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:26:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 02:26:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 02:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:52] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-08 02:26:52] [INFO ] [Nat]Added 418 Read/Feed constraints in 74 ms returned sat
[2023-03-08 02:26:52] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 0 ms to minimize.
[2023-03-08 02:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-08 02:26:52] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 55 ms.
[2023-03-08 02:26:52] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2023-03-08 02:26:53] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 0 ms to minimize.
[2023-03-08 02:26:53] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2023-03-08 02:26:53] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2023-03-08 02:26:53] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2023-03-08 02:26:53] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2023-03-08 02:26:53] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 0 ms to minimize.
[2023-03-08 02:26:54] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2023-03-08 02:26:54] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 0 ms to minimize.
[2023-03-08 02:26:54] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-08 02:26:54] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 0 ms to minimize.
[2023-03-08 02:26:54] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2023-03-08 02:26:55] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 0 ms to minimize.
[2023-03-08 02:26:55] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-08 02:26:55] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2023-03-08 02:26:55] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 0 ms to minimize.
[2023-03-08 02:26:55] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 0 ms to minimize.
[2023-03-08 02:26:55] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 1 ms to minimize.
[2023-03-08 02:26:56] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 0 ms to minimize.
[2023-03-08 02:26:56] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2023-03-08 02:26:56] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3710 ms
[2023-03-08 02:26:56] [INFO ] Added : 31 causal constraints over 8 iterations in 4275 ms. Result :sat
Minimization took 266 ms.
[2023-03-08 02:26:57] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 02:26:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 02:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:57] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-08 02:26:57] [INFO ] [Real]Added 418 Read/Feed constraints in 79 ms returned sat
[2023-03-08 02:26:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:26:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:26:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 02:26:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:57] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-08 02:26:57] [INFO ] [Nat]Added 418 Read/Feed constraints in 55 ms returned sat
[2023-03-08 02:26:57] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 60 ms.
[2023-03-08 02:26:57] [INFO ] Added : 2 causal constraints over 1 iterations in 137 ms. Result :sat
Minimization took 100 ms.
[2023-03-08 02:26:57] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 02:26:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 02:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:58] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-08 02:26:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:26:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:26:58] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 02:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:58] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-08 02:26:58] [INFO ] [Nat]Added 418 Read/Feed constraints in 61 ms returned sat
[2023-03-08 02:26:58] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 55 ms.
[2023-03-08 02:26:58] [INFO ] Added : 6 causal constraints over 2 iterations in 186 ms. Result :sat
Minimization took 328 ms.
[2023-03-08 02:26:58] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:26:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 02:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:59] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-08 02:26:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:26:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 02:26:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 02:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:26:59] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-08 02:26:59] [INFO ] [Nat]Added 418 Read/Feed constraints in 55 ms returned sat
[2023-03-08 02:26:59] [INFO ] Deduced a trap composed of 163 places in 133 ms of which 0 ms to minimize.
[2023-03-08 02:26:59] [INFO ] Deduced a trap composed of 175 places in 127 ms of which 1 ms to minimize.
[2023-03-08 02:26:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2023-03-08 02:26:59] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 53 ms.
[2023-03-08 02:26:59] [INFO ] Added : 4 causal constraints over 1 iterations in 151 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 4, 8, 1547] Max seen :[0, 0, 0, 2, 0, 0]
Support contains 6 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.3 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 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 182 place count 232 transition count 344
Iterating global reduction 1 with 93 rules applied. Total rules applied 275 place count 232 transition count 344
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 287 place count 232 transition count 332
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 358 place count 161 transition count 261
Iterating global reduction 2 with 71 rules applied. Total rules applied 429 place count 161 transition count 261
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 435 place count 161 transition count 255
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 474 place count 122 transition count 195
Iterating global reduction 3 with 39 rules applied. Total rules applied 513 place count 122 transition count 195
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 535 place count 122 transition count 173
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 544 place count 113 transition count 158
Iterating global reduction 4 with 9 rules applied. Total rules applied 553 place count 113 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 556 place count 113 transition count 155
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 562 place count 107 transition count 149
Iterating global reduction 5 with 6 rules applied. Total rules applied 568 place count 107 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 570 place count 107 transition count 147
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 575 place count 102 transition count 142
Iterating global reduction 6 with 5 rules applied. Total rules applied 580 place count 102 transition count 142
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 582 place count 100 transition count 134
Iterating global reduction 6 with 2 rules applied. Total rules applied 584 place count 100 transition count 134
Applied a total of 584 rules in 97 ms. Remains 100 /347 variables (removed 247) and now considering 134/672 (removed 538) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 100/347 places, 134/672 transitions.
// Phase 1: matrix 134 rows 100 cols
[2023-03-08 02:27:00] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229218 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 1000001 steps, including 98411 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 1000000 steps, including 98296 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 1000001 steps, including 97749 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98311 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 1000000 steps, including 97828 resets, run finished after 488 ms. (steps per millisecond=2049 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 1000001 steps, including 97987 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 6) seen :2
[2023-03-08 02:27:04] [INFO ] Invariant cache hit.
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 02:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 02:27:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:27:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:04] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 02:27:04] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-08 02:27:04] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2023-03-08 02:27:04] [INFO ] Computed and/alt/rep : 35/86/35 causal constraints (skipped 98 transitions) in 8 ms.
[2023-03-08 02:27:04] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 14 ms.
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 02:27:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:27:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:04] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 02:27:04] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2023-03-08 02:27:04] [INFO ] Computed and/alt/rep : 35/86/35 causal constraints (skipped 98 transitions) in 7 ms.
[2023-03-08 02:27:04] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
[2023-03-08 02:27:04] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-08 02:27:04] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2023-03-08 02:27:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 138 ms
[2023-03-08 02:27:04] [INFO ] Added : 11 causal constraints over 6 iterations in 208 ms. Result :sat
Minimization took 49 ms.
[2023-03-08 02:27:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 02:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:05] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 4, 8, 1] Max seen :[1, 1, 1, 2, 0, 1]
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 134/134 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 96 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 96 transition count 125
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 93 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 93 transition count 121
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 91 transition count 117
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 91 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 89 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 89 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 87 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 87 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 87 transition count 108
Applied a total of 32 rules in 19 ms. Remains 87 /100 variables (removed 13) and now considering 108/134 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 87/100 places, 108/134 transitions.
// Phase 1: matrix 108 rows 87 cols
[2023-03-08 02:27:05] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229617 resets, run finished after 813 ms. (steps per millisecond=1230 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 98684 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98203 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 2) seen :1
[2023-03-08 02:27:06] [INFO ] Invariant cache hit.
[2023-03-08 02:27:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 02:27:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:27:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:06] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 02:27:06] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 02:27:06] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2023-03-08 02:27:06] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-08 02:27:06] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2023-03-08 02:27:06] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-03-08 02:27:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 124 ms
[2023-03-08 02:27:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 02:27:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:27:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:07] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-08 02:27:07] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2023-03-08 02:27:07] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 76 transitions) in 8 ms.
[2023-03-08 02:27:07] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-08 02:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-08 02:27:07] [INFO ] Added : 9 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [3, 8] Max seen :[3, 0]
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 87/87 places, 108/108 transitions.
[2023-03-08 02:27:07] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229708 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98978 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 1) seen :0
[2023-03-08 02:27:08] [INFO ] Invariant cache hit.
[2023-03-08 02:27:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:08] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 02:27:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:27:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:08] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 02:27:08] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 02:27:08] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-08 02:27:08] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 76 transitions) in 6 ms.
[2023-03-08 02:27:08] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-08 02:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-08 02:27:08] [INFO ] Added : 9 causal constraints over 3 iterations in 100 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[0]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 02:27:08] [INFO ] Invariant cache hit.
[2023-03-08 02:27:08] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 02:27:08] [INFO ] Invariant cache hit.
[2023-03-08 02:27:08] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 02:27:08] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-08 02:27:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 02:27:08] [INFO ] Invariant cache hit.
[2023-03-08 02:27:09] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 87/87 places, 108/108 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-11
[2023-03-08 02:27:09] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1011 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-08 02:27:09] [INFO ] Invariant cache hit.
[2023-03-08 02:27:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 02:27:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:27:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:09] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 02:27:09] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 02:27:09] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2023-03-08 02:27:09] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 76 transitions) in 5 ms.
[2023-03-08 02:27:09] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-08 02:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-08 02:27:09] [INFO ] Added : 9 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 39 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, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 87/87 places, 108/108 transitions.
[2023-03-08 02:27:09] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229679 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98430 resets, run finished after 414 ms. (steps per millisecond=2415 ) properties (out of 1) seen :0
[2023-03-08 02:27:10] [INFO ] Invariant cache hit.
[2023-03-08 02:27:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-08 02:27:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 02:27:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 02:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 02:27:10] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-08 02:27:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 02:27:10] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2023-03-08 02:27:10] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 76 transitions) in 6 ms.
[2023-03-08 02:27:10] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2023-03-08 02:27:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-08 02:27:10] [INFO ] Added : 9 causal constraints over 3 iterations in 96 ms. Result :sat
Minimization took 44 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, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 02:27:10] [INFO ] Invariant cache hit.
[2023-03-08 02:27:10] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 02:27:10] [INFO ] Invariant cache hit.
[2023-03-08 02:27:11] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 02:27:11] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-08 02:27:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 02:27:11] [INFO ] Invariant cache hit.
[2023-03-08 02:27:11] [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, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m08-UpperBounds-11 in 2086 ms.
[2023-03-08 02:27:11] [INFO ] Flatten gal took : 38 ms
[2023-03-08 02:27:11] [INFO ] Applying decomposition
[2023-03-08 02:27:11] [INFO ] Flatten gal took : 13 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/graph13810063111973150974.txt' '-o' '/tmp/graph13810063111973150974.bin' '-w' '/tmp/graph13810063111973150974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13810063111973150974.bin' '-l' '-1' '-v' '-w' '/tmp/graph13810063111973150974.weights' '-q' '0' '-e' '0.001'
[2023-03-08 02:27:11] [INFO ] Decomposing Gal with order
[2023-03-08 02:27:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 02:27:11] [INFO ] Removed a total of 91 redundant transitions.
[2023-03-08 02:27:11] [INFO ] Flatten gal took : 51 ms
[2023-03-08 02:27:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 7 ms.
[2023-03-08 02:27:11] [INFO ] Time to serialize gal into /tmp/UpperBounds5309781091470292768.gal : 4 ms
[2023-03-08 02:27:11] [INFO ] Time to serialize properties into /tmp/UpperBounds4150951555867882033.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/UpperBounds5309781091470292768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4150951555867882033.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds4150951555867882033.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,2.3603e+07,8.41202,200812,2121,2010,153100,93443,336,774375,152,1.5654e+06,0
Total reachable state count : 23602988

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property DBSingleClientW-PT-d1m08-UpperBounds-11 :0 <= i0.u5.l1231 <= 5
FORMULA DBSingleClientW-PT-d1m08-UpperBounds-11 5 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-11,0,9.0882,200812,1,0,153100,93443,431,774375,190,1.5654e+06,1029
Total runtime 35263 ms.

BK_STOP 1678242446818

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-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-5348"
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 r101-tall-167814475100269"
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 ;