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.r060-tall-165254772100501.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 DNAwalker-PT-17redondantChoiceL, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772100501
=====================================================================

--------------------
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 1652607352845

Running Version 202205111006
[2022-05-15 09:35:54] [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 09:35:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 09:35:54] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2022-05-15 09:35:54] [INFO ] Transformed 43 places.
[2022-05-15 09:35:54] [INFO ] Transformed 490 transitions.
[2022-05-15 09:35:54] [INFO ] Parsed PT model containing 43 places and 490 transitions in 209 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 09:35:54] [INFO ] Computed 0 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 383 resets, run finished after 75 ms. (steps per millisecond=133 ) 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 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10000 steps, including 26 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 26 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 25 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 27 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 31 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 29 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 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 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 26 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 :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 :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 :29
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :28
[2022-05-15 09:35:54] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2022-05-15 09:35:54] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-15 09:35:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:35:54] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-15 09:35:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:35:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:35:59] [INFO ] [Nat]Absence check using state equation in 4428 ms returned unsat
[2022-05-15 09:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:35:59] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-15 09:35:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:04] [INFO ] [Nat]Absence check using state equation in 4986 ms returned unknown
[2022-05-15 09:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:04] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-15 09:36:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:09] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
[2022-05-15 09:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:09] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-05-15 09:36:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:14] [INFO ] [Nat]Absence check using state equation in 4986 ms returned unknown
[2022-05-15 09:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:14] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-15 09:36:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:19] [INFO ] [Nat]Absence check using state equation in 4989 ms returned unknown
[2022-05-15 09:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:19] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
[2022-05-15 09:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:19] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2022-05-15 09:36:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:24] [INFO ] [Nat]Absence check using state equation in 4984 ms returned unknown
[2022-05-15 09:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:25] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-05-15 09:36:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:30] [INFO ] [Nat]Absence check using state equation in 4984 ms returned unknown
[2022-05-15 09:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:30] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-05-15 09:36:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:35] [INFO ] [Nat]Absence check using state equation in 4983 ms returned unknown
[2022-05-15 09:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:35] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-15 09:36:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:40] [INFO ] [Nat]Absence check using state equation in 4996 ms returned unknown
[2022-05-15 09:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:40] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2022-05-15 09:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:40] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-15 09:36:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:44] [INFO ] [Nat]Absence check using state equation in 3566 ms returned unsat
[2022-05-15 09:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:44] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-15 09:36:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:46] [INFO ] [Nat]Absence check using state equation in 2225 ms returned unsat
[2022-05-15 09:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:46] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-05-15 09:36:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:50] [INFO ] [Nat]Absence check using state equation in 3639 ms returned unsat
[2022-05-15 09:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:50] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-05-15 09:36:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:55] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2022-05-15 09:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:36:55] [INFO ] [Real]Absence check using state equation in 50 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, -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
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 43 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 7 places and 7 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 36 transition count 471
Applied a total of 19 rules in 46 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 09:36:55] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-15 09:36:55] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/43 places, 471/490 transitions.
// Phase 1: matrix 471 rows 36 cols
[2022-05-15 09:36:55] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 46073 resets, run finished after 4667 ms. (steps per millisecond=214 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4220 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 3980 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4141 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4239 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4133 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4497 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000000 steps, including 4271 resets, run finished after 795 ms. (steps per millisecond=1257 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000000 steps, including 3775 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4141 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 9) seen :18
// Phase 1: matrix 471 rows 36 cols
[2022-05-15 09:37:07] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-15 09:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:07] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-15 09:37:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:11] [INFO ] [Nat]Absence check using state equation in 4132 ms returned unsat
[2022-05-15 09:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:11] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-15 09:37:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:14] [INFO ] [Nat]Absence check using state equation in 2204 ms returned unsat
[2022-05-15 09:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:14] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 09:37:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:20] [INFO ] [Nat]Absence check using state equation in 6072 ms returned unknown
[2022-05-15 09:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:20] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-15 09:37:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:25] [INFO ] [Nat]Absence check using state equation in 5405 ms returned unsat
[2022-05-15 09:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:25] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-05-15 09:37:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:31] [INFO ] [Nat]Absence check using state equation in 6069 ms returned unknown
[2022-05-15 09:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:31] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-15 09:37:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:38] [INFO ] [Nat]Absence check using state equation in 6071 ms returned unknown
[2022-05-15 09:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:38] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 09:37:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:40] [INFO ] [Nat]Absence check using state equation in 2339 ms returned unsat
[2022-05-15 09:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:40] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-15 09:37:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:45] [INFO ] [Nat]Absence check using state equation in 4485 ms returned unsat
[2022-05-15 09:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:45] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-15 09:37:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:49] [INFO ] [Nat]Absence check using state equation in 4339 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, -1, 2, -1, -1, 2, 2, 2] Max seen :[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
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 471/471 transitions.
Graph (complete) has 471 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 35 transition count 465
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 33 transition count 463
Applied a total of 9 rules in 37 ms. Remains 33 /36 variables (removed 3) and now considering 463/471 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/36 places, 463/471 transitions.
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 09:37:49] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 42792 resets, run finished after 4189 ms. (steps per millisecond=238 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4389 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4344 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4384 resets, run finished after 764 ms. (steps per millisecond=1308 ) properties (out of 3) seen :6
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 09:37:56] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-15 09:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:56] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-15 09:37:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:59] [INFO ] [Nat]Absence check using state equation in 3068 ms returned unknown
[2022-05-15 09:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:37:59] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-15 09:37:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:38:02] [INFO ] [Nat]Absence check using state equation in 3071 ms returned unknown
[2022-05-15 09:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:38:02] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-15 09:38:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:38:05] [INFO ] [Nat]Absence check using state equation in 3075 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[2, 2, 2]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 463/463 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 463/463 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 463/463 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 09:38:05] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-15 09:38:05] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 09:38:05] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 09:38:05] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-15 09:38:06] [INFO ] Implicit Places using invariants and state equation in 625 ms returned [32]
Discarding 1 places :
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 696 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 32/33 places, 458/463 transitions.
Applied a total of 0 rules in 14 ms. Remains 32 /32 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 458/463 transitions.
// Phase 1: matrix 458 rows 32 cols
[2022-05-15 09:38:06] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 36339 resets, run finished after 3977 ms. (steps per millisecond=251 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000000 steps, including 3987 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 3992 resets, run finished after 764 ms. (steps per millisecond=1308 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 3982 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 3) seen :6
// Phase 1: matrix 458 rows 32 cols
[2022-05-15 09:38:12] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-15 09:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:38:12] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-15 09:38:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:38:14] [INFO ] [Nat]Absence check using state equation in 1308 ms returned unsat
[2022-05-15 09:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:38:14] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-15 09:38:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:38:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:38:16] [INFO ] [Nat]Absence check using state equation in 1876 ms returned unsat
[2022-05-15 09:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 09:38:16] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 09:38:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 09:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 09:38:17] [INFO ] [Nat]Absence check using state equation in 1317 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, 2] Max seen :[2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 143374 ms.

BK_STOP 1652607497471

--------------------
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="DNAwalker-PT-17redondantChoiceL"
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 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 r060-tall-165254772100501"
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 ;