fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+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
1047.415 379418.00 1042818.00 801.50 1 2 2 2 1 2 2 2 2 1 2 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.r105-tall-167814482000997.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 ltsminxred
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 r105-tall-167814482000997
=====================================================================

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

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-16redondantChoiceR
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 23:53:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 23:53:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:53:28] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-09 23:53:28] [INFO ] Transformed 43 places.
[2023-03-09 23:53:28] [INFO ] Transformed 490 transitions.
[2023-03-09 23:53:28] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 489 out of 490 initially.
// Phase 1: matrix 489 rows 43 cols
[2023-03-09 23:53:28] [INFO ] Computed 0 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 380 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10001 steps, including 24 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 16 ms. (steps per millisecond=625 ) 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 23 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 :28
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 23 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 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 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
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :29
Incomplete Best-First random walk after 10000 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 30 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 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 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 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :29
[2023-03-09 23:53:28] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-09 23:53:28] [INFO ] Computed 0 place invariants in 10 ms
[2023-03-09 23:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:29] [INFO ] [Real]Absence check using state equation in 102 ms returned unsat
[2023-03-09 23:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:29] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-09 23:53:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:53:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:31] [INFO ] [Nat]Absence check using state equation in 2111 ms returned unsat
[2023-03-09 23:53:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:31] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-09 23:53:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:36] [INFO ] [Nat]Absence check using state equation in 4986 ms returned unknown
[2023-03-09 23:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:36] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-09 23:53:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:40] [INFO ] [Nat]Absence check using state equation in 4000 ms returned unsat
[2023-03-09 23:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:41] [INFO ] [Real]Absence check using state equation in 62 ms returned unsat
[2023-03-09 23:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:41] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-09 23:53:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:46] [INFO ] [Nat]Absence check using state equation in 4988 ms returned unknown
[2023-03-09 23:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:46] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-09 23:53:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:51] [INFO ] [Nat]Absence check using state equation in 4987 ms returned unknown
[2023-03-09 23:53:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:51] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-09 23:53:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:56] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
[2023-03-09 23:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:53:56] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-09 23:53:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:01] [INFO ] [Nat]Absence check using state equation in 4986 ms returned unknown
[2023-03-09 23:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:01] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2023-03-09 23:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:01] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-09 23:54:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:02] [INFO ] [Nat]Absence check using state equation in 823 ms returned unsat
[2023-03-09 23:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:02] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-09 23:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:07] [INFO ] [Nat]Absence check using state equation in 4987 ms returned unknown
[2023-03-09 23:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:07] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-09 23:54:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:12] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-09 23:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:12] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-09 23:54:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:16] [INFO ] [Nat]Absence check using state equation in 3254 ms returned unsat
[2023-03-09 23:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:16] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-09 23:54:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:21] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-09 23:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:21] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-09 23:54:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:26] [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 49 ms. Remains 36 /43 variables (removed 7) and now considering 471/490 (removed 19) transitions.
// Phase 1: matrix 471 rows 36 cols
[2023-03-09 23:54:26] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-09 23:54:26] [INFO ] Dead Transitions using invariants and state equation in 153 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-09 23:54:26] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 45937 resets, run finished after 4572 ms. (steps per millisecond=218 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000000 steps, including 4219 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 4257 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 3963 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4144 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 4004 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4229 resets, run finished after 800 ms. (steps per millisecond=1250 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4311 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000000 steps, including 4073 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 3986 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 9) seen :18
[2023-03-09 23:54:38] [INFO ] Invariant cache hit.
[2023-03-09 23:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:38] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-09 23:54:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:39] [INFO ] [Nat]Absence check using state equation in 1156 ms returned unsat
[2023-03-09 23:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:39] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-09 23:54:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:40] [INFO ] [Nat]Absence check using state equation in 1458 ms returned unsat
[2023-03-09 23:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:41] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-09 23:54:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:42] [INFO ] [Nat]Absence check using state equation in 1917 ms returned unsat
[2023-03-09 23:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:43] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 23:54:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:45] [INFO ] [Nat]Absence check using state equation in 2406 ms returned unsat
[2023-03-09 23:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:45] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-09 23:54:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:51] [INFO ] [Nat]Absence check using state equation in 6070 ms returned unknown
[2023-03-09 23:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:51] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-09 23:54:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:57] [INFO ] [Nat]Absence check using state equation in 6076 ms returned unknown
[2023-03-09 23:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:54:57] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-09 23:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:04] [INFO ] [Nat]Absence check using state equation in 6068 ms returned unknown
[2023-03-09 23:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:04] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-09 23:55:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:05] [INFO ] [Nat]Absence check using state equation in 1485 ms returned unsat
[2023-03-09 23:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:05] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-09 23:55:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:55:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:06] [INFO ] [Nat]Absence check using state equation in 1149 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 24 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 24 ms. Remains : 32/36 places, 462/471 transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-09 23:55:06] [INFO ] Computed 0 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 44450 resets, run finished after 4213 ms. (steps per millisecond=237 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4531 resets, run finished after 765 ms. (steps per millisecond=1307 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4728 resets, run finished after 763 ms. (steps per millisecond=1310 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 4482 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 3) seen :6
[2023-03-09 23:55:13] [INFO ] Invariant cache hit.
[2023-03-09 23:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:13] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-09 23:55:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:15] [INFO ] [Nat]Absence check using state equation in 1453 ms returned unsat
[2023-03-09 23:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:15] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-09 23:55:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:55:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:21] [INFO ] [Nat]Absence check using state equation in 6069 ms returned unknown
[2023-03-09 23:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:21] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 23:55:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:25] [INFO ] [Nat]Absence check using state equation in 4246 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 15 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-09 23:55:25] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 44515 resets, run finished after 4132 ms. (steps per millisecond=242 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4720 resets, run finished after 757 ms. (steps per millisecond=1321 ) properties (out of 1) seen :2
[2023-03-09 23:55:30] [INFO ] Invariant cache hit.
[2023-03-09 23:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:30] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-09 23:55:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:36] [INFO ] [Nat]Absence check using state equation in 6066 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 14 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 6 ms. Remains 32 /32 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-09 23:55:36] [INFO ] Invariant cache hit.
[2023-03-09 23:55:36] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-09 23:55:36] [INFO ] Invariant cache hit.
[2023-03-09 23:55:37] [INFO ] Implicit Places using invariants and state equation in 486 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 557 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 573 ms. Remains : 31/32 places, 457/462 transitions.
// Phase 1: matrix 457 rows 31 cols
[2023-03-09 23:55:37] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 37732 resets, run finished after 4093 ms. (steps per millisecond=244 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4267 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 1) seen :2
[2023-03-09 23:55:42] [INFO ] Invariant cache hit.
[2023-03-09 23:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:42] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-09 23:55:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:48] [INFO ] [Nat]Absence check using state equation in 6073 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 14 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 14 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-09 23:55:48] [INFO ] Invariant cache hit.
[2023-03-09 23:55:48] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 23:55:48] [INFO ] Invariant cache hit.
[2023-03-09 23:55:48] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2023-03-09 23:55:48] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-09 23:55:48] [INFO ] Invariant cache hit.
[2023-03-09 23:55:49] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 741 ms. Remains : 31/31 places, 457/457 transitions.
Starting property specific reduction for DNAwalker-PT-16redondantChoiceR-UpperBounds-11
[2023-03-09 23:55:49] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 384 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
[2023-03-09 23:55:49] [INFO ] Invariant cache hit.
[2023-03-09 23:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:49] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-09 23:55:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:54] [INFO ] [Nat]Absence check using state equation in 4983 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 16 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
[2023-03-09 23:55:54] [INFO ] Invariant cache hit.
[2023-03-09 23:55:54] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 31/31 places, 457/457 transitions.
[2023-03-09 23:55:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 37815 resets, run finished after 4078 ms. (steps per millisecond=245 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4265 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 1) seen :2
[2023-03-09 23:55:59] [INFO ] Invariant cache hit.
[2023-03-09 23:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:55:59] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-09 23:55:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:55:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:56:05] [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 7 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 6 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
[2023-03-09 23:56:05] [INFO ] Invariant cache hit.
[2023-03-09 23:56:05] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 23:56:05] [INFO ] Invariant cache hit.
[2023-03-09 23:56:05] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2023-03-09 23:56:05] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-09 23:56:05] [INFO ] Invariant cache hit.
[2023-03-09 23:56:06] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 712 ms. Remains : 31/31 places, 457/457 transitions.
Ending property specific reduction for DNAwalker-PT-16redondantChoiceR-UpperBounds-11 in 17057 ms.
[2023-03-09 23:56:06] [INFO ] Flatten gal took : 60 ms
[2023-03-09 23:56:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 23:56:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 457 transitions and 1369 arcs took 3 ms.
Total runtime 158024 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/687/ub_0_
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-11 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678406386353

--------------------
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
mcc2023
ub formula name DNAwalker-PT-16redondantChoiceR-UpperBounds-11
ub formula formula --maxsum=/tmp/687/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 31 places, 457 transitions and 1369 arcs
pnml2lts-sym: Petri net DNAwalker_PT_16redondantChoiceR analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 457->228 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 31; there are 228 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 67798543 group checks and 0 next state calls
pnml2lts-sym: reachability took 218.800 real 873.320 user 1.300 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 15151465261 states, 53553 nodes
pnml2lts-sym: Maximum sum of /tmp/687/ub_0_ is: 2
pnml2lts-sym: group_next: 2259 nodes total
pnml2lts-sym: group_explored: 1814 nodes, 1804 short vectors total
pnml2lts-sym: max token count: 2

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="ltsminxred"
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 ltsminxred"
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 r105-tall-167814482000997"
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 ;