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

About the Execution of 2021-gold for DNAwalker-PT-17redondantChoiceL

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
361.987 159056.00 171738.00 669.90 2 2 2 2 2 1 2 2 2 2 1 2 2 2 2 1 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.r071-tall-165254780500187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DNAwalker-PT-17redondantChoiceL, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-tall-165254780500187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.8K Apr 29 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 18:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 18:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 19 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 211K May 10 09:33 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 DNAwalker-PT-17redondantChoiceL-UpperBounds-00
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-01
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-02
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-03
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-04
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-05
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-06
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-07
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-08
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-09
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-10
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-11
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-12
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-13
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-14
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652591190059

Running Version 0
[2022-05-15 05:06:31] [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-05-15 05:06:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:06:31] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2022-05-15 05:06:31] [INFO ] Transformed 43 places.
[2022-05-15 05:06:32] [INFO ] Transformed 490 transitions.
[2022-05-15 05:06:32] [INFO ] Parsed PT model containing 43 places and 490 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 489 out of 490 initially.
// Phase 1: matrix 489 rows 43 cols
[2022-05-15 05:06:32] [INFO ] Computed 0 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 383 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :28
[2022-05-15 05:06:32] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2022-05-15 05:06:32] [INFO ] Computed 0 place invariants in 21 ms
[2022-05-15 05:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:32] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-05-15 05:06:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:37] [INFO ] [Nat]Absence check using state equation in 4984 ms returned unknown
[2022-05-15 05:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:37] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2022-05-15 05:06:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:42] [INFO ] [Nat]Absence check using state equation in 4992 ms returned unknown
[2022-05-15 05:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:42] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-15 05:06:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:47] [INFO ] [Nat]Absence check using state equation in 4991 ms returned unknown
[2022-05-15 05:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:47] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-15 05:06:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:52] [INFO ] [Nat]Absence check using state equation in 4993 ms returned unknown
[2022-05-15 05:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:52] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-15 05:06:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:57] [INFO ] [Nat]Absence check using state equation in 4992 ms returned unknown
[2022-05-15 05:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:58] [INFO ] [Real]Absence check using state equation in 56 ms returned unsat
[2022-05-15 05:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:58] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2022-05-15 05:06:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:03] [INFO ] [Nat]Absence check using state equation in 4993 ms returned unknown
[2022-05-15 05:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:03] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-15 05:07:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:08] [INFO ] [Nat]Absence check using state equation in 4992 ms returned unknown
[2022-05-15 05:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:08] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-15 05:07:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:13] [INFO ] [Nat]Absence check using state equation in 4989 ms returned unknown
[2022-05-15 05:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:13] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-05-15 05:07:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:18] [INFO ] [Nat]Absence check using state equation in 4992 ms returned unknown
[2022-05-15 05:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:18] [INFO ] [Real]Absence check using state equation in 54 ms returned unsat
[2022-05-15 05:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:18] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-15 05:07:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:22] [INFO ] [Nat]Absence check using state equation in 3848 ms returned unsat
[2022-05-15 05:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:22] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-15 05:07:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:24] [INFO ] [Nat]Absence check using state equation in 2328 ms returned unsat
[2022-05-15 05:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:25] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-15 05:07:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:26] [INFO ] [Nat]Absence check using state equation in 1250 ms returned unsat
[2022-05-15 05:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:26] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-15 05:07:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:31] [INFO ] [Nat]Absence check using state equation in 4992 ms returned unknown
[2022-05-15 05:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:31] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, 1, -1, -1, -1, -1, 1, 2, 2, 2, -1, 1] Max seen :[2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 490/490 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 43 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 42 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 41 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 40 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 39 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 38 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 37 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 36 transition count 471
Applied a total of 19 rules in 114 ms. Remains 36 /43 variables (removed 7) and now considering 471/490 (removed 19) transitions.
// Phase 1: matrix 471 rows 36 cols
[2022-05-15 05:07:31] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-15 05:07:31] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 36/43 places, 471/490 transitions.
// Phase 1: matrix 471 rows 36 cols
[2022-05-15 05:07:31] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 46038 resets, run finished after 4553 ms. (steps per millisecond=219 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000000 steps, including 4071 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 4191 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 3993 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000000 steps, including 4133 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 4246 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 4140 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 4441 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 4256 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 3757 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 1000001 steps, including 4084 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 10) seen :20
// Phase 1: matrix 471 rows 36 cols
[2022-05-15 05:07:44] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-15 05:07:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:44] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-15 05:07:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:50] [INFO ] [Nat]Absence check using state equation in 6078 ms returned unknown
[2022-05-15 05:07:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:50] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-15 05:07:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:56] [INFO ] [Nat]Absence check using state equation in 6089 ms returned unknown
[2022-05-15 05:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:56] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-15 05:07:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:59] [INFO ] [Nat]Absence check using state equation in 2658 ms returned unsat
[2022-05-15 05:07:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:59] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-15 05:07:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:05] [INFO ] [Nat]Absence check using state equation in 6081 ms returned unknown
[2022-05-15 05:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:05] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-15 05:08:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:10] [INFO ] [Nat]Absence check using state equation in 4718 ms returned unsat
[2022-05-15 05:08:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:10] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-15 05:08:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:16] [INFO ] [Nat]Absence check using state equation in 6092 ms returned unknown
[2022-05-15 05:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:16] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-15 05:08:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:22] [INFO ] [Nat]Absence check using state equation in 6067 ms returned unknown
[2022-05-15 05:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:22] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-15 05:08:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:25] [INFO ] [Nat]Absence check using state equation in 2574 ms returned unsat
[2022-05-15 05:08:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:25] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-15 05:08:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:31] [INFO ] [Nat]Absence check using state equation in 5738 ms returned unsat
[2022-05-15 05:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:31] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-15 05:08:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:35] [INFO ] [Nat]Absence check using state equation in 4612 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, 2, -1, 2, -1, -1, 2, 2, 2] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 36 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 36/36 places, 471/471 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 470
Applied a total of 1 rules in 12 ms. Remains 35 /36 variables (removed 1) and now considering 470/471 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/36 places, 470/471 transitions.
// Phase 1: matrix 470 rows 35 cols
[2022-05-15 05:08:35] [INFO ] Computed 0 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 48146 resets, run finished after 4308 ms. (steps per millisecond=232 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 4359 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 4547 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 4490 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 4456 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 1000001 steps, including 4646 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 5) seen :10
// Phase 1: matrix 470 rows 35 cols
[2022-05-15 05:08:44] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 05:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:44] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 05:08:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:45] [INFO ] [Nat]Absence check using state equation in 1466 ms returned unsat
[2022-05-15 05:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:45] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-15 05:08:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:48] [INFO ] [Nat]Absence check using state equation in 2548 ms returned unsat
[2022-05-15 05:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:48] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-15 05:08:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:50] [INFO ] [Nat]Absence check using state equation in 2221 ms returned unsat
[2022-05-15 05:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:50] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-15 05:08:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:56] [INFO ] [Nat]Absence check using state equation in 6081 ms returned unknown
[2022-05-15 05:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:57] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-15 05:08:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:09:01] [INFO ] [Nat]Absence check using state equation in 4477 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, 2, -1, 2] Max seen :[2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 470/470 transitions.
Graph (complete) has 470 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 33 transition count 458
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 32 transition count 457
Applied a total of 14 rules in 23 ms. Remains 32 /35 variables (removed 3) and now considering 457/470 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/35 places, 457/470 transitions.
// Phase 1: matrix 457 rows 32 cols
[2022-05-15 05:09:01] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 34862 resets, run finished after 3970 ms. (steps per millisecond=251 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 3914 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 1) seen :2
// Phase 1: matrix 457 rows 32 cols
[2022-05-15 05:09:06] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-15 05:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:09:06] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-15 05:09:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:09:07] [INFO ] [Nat]Absence check using state equation in 1540 ms returned unsat
Current structural bounds on expressions (after SMT) : [2] Max seen :[2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652591349115

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-17redondantChoiceL"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is DNAwalker-PT-17redondantChoiceL, 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 r071-tall-165254780500187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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