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

About the Execution of Smart+red for DNAwalker-PT-16redondantChoiceR

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16214.084 1422789.00 1447012.00 18941.40 1 2 2 2 1 2 2 2 2 1 2 ? 2 2 2 2 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r107-tall-167814484900997.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 smartxred
Input is DNAwalker-PT-16redondantChoiceR, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484900997
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 211K 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 DNAwalker-PT-16redondantChoiceR-UpperBounds-00
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-01
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-02
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-03
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-04
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-05
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-06
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-07
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-08
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-09
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-10
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-11
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-12
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-13
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-14
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678445979647

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-16redondantChoiceR
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 10:59:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 10:59:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:59:41] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-10 10:59:41] [INFO ] Transformed 43 places.
[2023-03-10 10:59:41] [INFO ] Transformed 490 transitions.
[2023-03-10 10:59:41] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Normalized transition count is 489 out of 490 initially.
// Phase 1: matrix 489 rows 43 cols
[2023-03-10 10:59:41] [INFO ] Computed 0 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 378 resets, run finished after 71 ms. (steps per millisecond=140 ) 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 26 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 10000 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 23 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 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 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 27 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 27 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 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 33 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 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 29 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 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 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :29
[2023-03-10 10:59:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-10 10:59:41] [INFO ] Computed 0 place invariants in 12 ms
[2023-03-10 10:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:42] [INFO ] [Real]Absence check using state equation in 104 ms returned unsat
[2023-03-10 10:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:42] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-10 10:59:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:44] [INFO ] [Nat]Absence check using state equation in 2094 ms returned unsat
[2023-03-10 10:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:44] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-10 10:59:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:59:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:49] [INFO ] [Nat]Absence check using state equation in 4970 ms returned unknown
[2023-03-10 10:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:49] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-10 10:59:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:54] [INFO ] [Nat]Absence check using state equation in 4933 ms returned unsat
[2023-03-10 10:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:54] [INFO ] [Real]Absence check using state equation in 57 ms returned unsat
[2023-03-10 10:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:54] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-10 10:59:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:59] [INFO ] [Nat]Absence check using state equation in 4984 ms returned unknown
[2023-03-10 10:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:59:59] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 10:59:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:04] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
[2023-03-10 11:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:04] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-10 11:00:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:09] [INFO ] [Nat]Absence check using state equation in 4984 ms returned unknown
[2023-03-10 11:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:09] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-10 11:00:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:14] [INFO ] [Nat]Absence check using state equation in 4987 ms returned unknown
[2023-03-10 11:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:14] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2023-03-10 11:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:15] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-10 11:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:15] [INFO ] [Nat]Absence check using state equation in 840 ms returned unsat
[2023-03-10 11:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:16] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-10 11:00:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:21] [INFO ] [Nat]Absence check using state equation in 4981 ms returned unknown
[2023-03-10 11:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:21] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-10 11:00:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:26] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-10 11:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:26] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-10 11:00:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:29] [INFO ] [Nat]Absence check using state equation in 3378 ms returned unsat
[2023-03-10 11:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:29] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-10 11:00:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:34] [INFO ] [Nat]Absence check using state equation in 4986 ms returned unknown
[2023-03-10 11:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:34] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-10 11:00:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:39] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 2, -1, 2, 1, -1, -1, -1, -1, 1, 2, -1, -1, 2, -1, -1] Max seen :[1, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 57 ms. Remains 36 /43 variables (removed 7) and now considering 471/490 (removed 19) transitions.
// Phase 1: matrix 471 rows 36 cols
[2023-03-10 11:00:39] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-10 11:00:40] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 36/43 places, 471/490 transitions.
[2023-03-10 11:00:40] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 45948 resets, run finished after 4599 ms. (steps per millisecond=217 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4201 resets, run finished after 795 ms. (steps per millisecond=1257 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4262 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 3960 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 4134 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4025 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4236 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4321 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 4089 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 3993 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 9) seen :18
[2023-03-10 11:00:51] [INFO ] Invariant cache hit.
[2023-03-10 11:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:51] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 11:00:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:53] [INFO ] [Nat]Absence check using state equation in 1162 ms returned unsat
[2023-03-10 11:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:53] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-10 11:00:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:54] [INFO ] [Nat]Absence check using state equation in 1460 ms returned unsat
[2023-03-10 11:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:54] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 11:00:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:56] [INFO ] [Nat]Absence check using state equation in 1922 ms returned unsat
[2023-03-10 11:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:56] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-10 11:00:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:59] [INFO ] [Nat]Absence check using state equation in 2436 ms returned unsat
[2023-03-10 11:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:00:59] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-10 11:00:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:05] [INFO ] [Nat]Absence check using state equation in 6071 ms returned unknown
[2023-03-10 11:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:05] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 11:01:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:11] [INFO ] [Nat]Absence check using state equation in 6070 ms returned unknown
[2023-03-10 11:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:11] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 11:01:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:17] [INFO ] [Nat]Absence check using state equation in 6067 ms returned unknown
[2023-03-10 11:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:17] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-10 11:01:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:01:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:19] [INFO ] [Nat]Absence check using state equation in 1473 ms returned unsat
[2023-03-10 11:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:19] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-10 11:01:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:20] [INFO ] [Nat]Absence check using state equation in 1151 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, -1, -1, -1, 2, 2] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.5 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 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 32 transition count 462
Applied a total of 10 rules in 36 ms. Remains 32 /36 variables (removed 4) and now considering 462/471 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 32/36 places, 462/471 transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-10 11:01:20] [INFO ] Computed 0 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 44482 resets, run finished after 4145 ms. (steps per millisecond=241 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4555 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4660 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000000 steps, including 4479 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 3) seen :6
[2023-03-10 11:01:27] [INFO ] Invariant cache hit.
[2023-03-10 11:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:27] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 11:01:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:28] [INFO ] [Nat]Absence check using state equation in 1418 ms returned unsat
[2023-03-10 11:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:28] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-10 11:01:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:34] [INFO ] [Nat]Absence check using state equation in 6065 ms returned unknown
[2023-03-10 11:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:34] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-10 11:01:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:39] [INFO ] [Nat]Absence check using state equation in 4293 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, -1, 2] Max seen :[2, 2, 2]
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 462/462 transitions.
Applied a total of 0 rules in 14 ms. Remains 32 /32 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 32/32 places, 462/462 transitions.
[2023-03-10 11:01:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 44446 resets, run finished after 3999 ms. (steps per millisecond=250 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4685 resets, run finished after 740 ms. (steps per millisecond=1351 ) properties (out of 1) seen :2
[2023-03-10 11:01:43] [INFO ] Invariant cache hit.
[2023-03-10 11:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:43] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-10 11:01:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:50] [INFO ] [Nat]Absence check using state equation in 6063 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 462/462 transitions.
Applied a total of 0 rules in 13 ms. Remains 32 /32 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 32/32 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 462/462 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-10 11:01:50] [INFO ] Invariant cache hit.
[2023-03-10 11:01:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-10 11:01:50] [INFO ] Invariant cache hit.
[2023-03-10 11:01:50] [INFO ] Implicit Places using invariants and state equation in 454 ms returned [31]
Discarding 1 places :
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 517 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 31/32 places, 457/462 transitions.
Applied a total of 0 rules in 10 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 533 ms. Remains : 31/32 places, 457/462 transitions.
// Phase 1: matrix 457 rows 31 cols
[2023-03-10 11:01:50] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 37765 resets, run finished after 3826 ms. (steps per millisecond=261 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4273 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 1) seen :2
[2023-03-10 11:01:55] [INFO ] Invariant cache hit.
[2023-03-10 11:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:01:55] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-10 11:01:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:02:01] [INFO ] [Nat]Absence check using state equation in 6065 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 457/457 transitions.
Applied a total of 0 rules in 15 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 31/31 places, 457/457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 457/457 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
[2023-03-10 11:02:01] [INFO ] Invariant cache hit.
[2023-03-10 11:02:01] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-10 11:02:01] [INFO ] Invariant cache hit.
[2023-03-10 11:02:01] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-10 11:02:01] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-10 11:02:01] [INFO ] Invariant cache hit.
[2023-03-10 11:02:02] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 720 ms. Remains : 31/31 places, 457/457 transitions.
Starting property specific reduction for DNAwalker-PT-16redondantChoiceR-UpperBounds-11
[2023-03-10 11:02:02] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 376 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
[2023-03-10 11:02:02] [INFO ] Invariant cache hit.
[2023-03-10 11:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:02:02] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-10 11:02:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:02:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:02:07] [INFO ] [Nat]Absence check using state equation in 4987 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 457/457 transitions.
Applied a total of 0 rules in 13 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
[2023-03-10 11:02:07] [INFO ] Invariant cache hit.
[2023-03-10 11:02:07] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 31/31 places, 457/457 transitions.
[2023-03-10 11:02:07] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 37791 resets, run finished after 3828 ms. (steps per millisecond=261 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4276 resets, run finished after 740 ms. (steps per millisecond=1351 ) properties (out of 1) seen :2
[2023-03-10 11:02:11] [INFO ] Invariant cache hit.
[2023-03-10 11:02:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:02:11] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 11:02:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 11:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 11:02:18] [INFO ] [Nat]Absence check using state equation in 6071 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 457/457 transitions.
Applied a total of 0 rules in 8 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 31/31 places, 457/457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 457/457 transitions.
Applied a total of 0 rules in 9 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
[2023-03-10 11:02:18] [INFO ] Invariant cache hit.
[2023-03-10 11:02:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-10 11:02:18] [INFO ] Invariant cache hit.
[2023-03-10 11:02:18] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2023-03-10 11:02:18] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-10 11:02:18] [INFO ] Invariant cache hit.
[2023-03-10 11:02:18] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 687 ms. Remains : 31/31 places, 457/457 transitions.
Ending property specific reduction for DNAwalker-PT-16redondantChoiceR-UpperBounds-11 in 16749 ms.
[2023-03-10 11:02:18] [INFO ] Flatten gal took : 57 ms
[2023-03-10 11:02:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-10 11:02:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 457 transitions and 1369 arcs took 4 ms.
Total runtime 157675 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DNAwalker (PT), instance 16redondantChoiceR
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 31 places, 457 transitions, 1369 arcs.
Final Score: 1034.367
Took : 14 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1678447402436

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 735 Killed ${SMART}/smart ${INPUT_SM}

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-16redondantChoiceR"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is DNAwalker-PT-16redondantChoiceR, 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 r107-tall-167814484900997"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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