fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695800765
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DNAwalker-PT-01track12Block1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
477.976 247012.00 258217.00 613.50 2 2 2 2 2 2 2 2 2 2 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/mcc2026-input.r098-tall-177955695800765.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DNAwalker-PT-01track12Block1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K Mar 6 15:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 15:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 15:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 15:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Mar 6 15:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 6 15:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 6 15:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 16 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 36K Mar 3 18:30 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-00
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-01
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-02
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-03
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-04
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-05
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-06
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-07
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-08
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-09
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-10
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-11
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-12
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-13
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-14
FORMULA_NAME DNAwalker-PT-01track12Block1-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779663522231

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-01track12Block1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 22:58:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 22:58:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:58:43] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2026-05-24 22:58:43] [INFO ] Transformed 13 places.
[2026-05-24 22:58:43] [INFO ] Transformed 82 transitions.
[2026-05-24 22:58:43] [INFO ] Parsed PT model containing 13 places and 82 transitions and 241 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 8
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 1, 1, 1, 2, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 1, 1, 1, 2, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1676976511627966337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5447437085152352564.kers'
[2026-05-24 22:58:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1676976511627966337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5447437085152352564.kers]
Normalized transition count is 80 out of 82 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 13 cols 159 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 22:58:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5447437085152352564.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 2, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (1221 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 80007 steps (1714 resets) in 122 ms. (650 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-24 22:58:43] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4992617178612370822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2365892910221170347.kers'
[2026-05-24 22:58:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4992617178612370822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2365892910221170347.kers]
Normalized transition count is 80 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 13 cols 159 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 22:58:43] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2365892910221170347.kers
Total runtime 0 ms.
[2026-05-24 22:58:44] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-24 22:58:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:58:45] [INFO ] [Nat]Absence check using state equation in 1028 ms returned unknown
[2026-05-24 22:58:45] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-24 22:58:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:58:46] [INFO ] [Nat]Absence check using state equation in 1014 ms returned unknown
[2026-05-24 22:58:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2026-05-24 22:58:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:58:47] [INFO ] [Nat]Absence check using state equation in 1017 ms returned unknown
[2026-05-24 22:58:47] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-24 22:58:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:58:48] [INFO ] [Nat]Absence check using state equation in 1021 ms returned unknown
[2026-05-24 22:58:48] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-24 22:58:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:58:49] [INFO ] [Nat]Absence check using state equation in 1027 ms returned unknown
[2026-05-24 22:58:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-24 22:58:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:58:50] [INFO ] [Nat]Absence check using state equation in 1035 ms returned unknown
[2026-05-24 22:58:50] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-24 22:58:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:58:51] [INFO ] [Nat]Absence check using state equation in 1015 ms returned unknown
[2026-05-24 22:58:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-24 22:58:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:58:52] [INFO ] [Nat]Absence check using state equation in 1014 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 82/82 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 78
Applied a total of 4 rules in 29 ms. Remains 12 /13 variables (removed 1) and now considering 78/82 (removed 4) transitions.
Running 73 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9908743845392006625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10684778070679339895.kers'
[2026-05-24 22:58:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9908743845392006625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10684778070679339895.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 12 cols 156 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-24 22:58:52] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10684778070679339895.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 78/90 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 12 constraints, problems are : Problem set: 0 solved, 73 unsolved in 772 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 78/90 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 90/90 variables, and 85 constraints, problems are : Problem set: 0 solved, 73 unsolved in 20041 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20891ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 20901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20958 ms. Remains : 12/13 places, 78/82 transitions.
findPositiveTsemiflow completed in 9 ms - Net is bounded UNSAT
[2026-05-24 22:59:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (133235 resets) in 1403 ms. (712 steps per ms)
BEST_FIRST walk for 8000005 steps (194104 resets) in 2989 ms. (2675 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-24 22:59:18] [INFO ] Invariant cache hit.
[2026-05-24 22:59:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-24 22:59:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:59:22] [INFO ] [Nat]Absence check using state equation in 4517 ms returned unknown
[2026-05-24 22:59:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-24 22:59:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:59:27] [INFO ] [Nat]Absence check using state equation in 4513 ms returned unknown
[2026-05-24 22:59:27] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-24 22:59:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:59:31] [INFO ] [Nat]Absence check using state equation in 4517 ms returned unknown
[2026-05-24 22:59:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-24 22:59:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:59:36] [INFO ] [Nat]Absence check using state equation in 4524 ms returned unknown
[2026-05-24 22:59:36] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-24 22:59:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:59:41] [INFO ] [Nat]Absence check using state equation in 4520 ms returned unknown
[2026-05-24 22:59:41] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-24 22:59:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:59:45] [INFO ] [Nat]Absence check using state equation in 4514 ms returned unknown
[2026-05-24 22:59:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-24 22:59:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:59:50] [INFO ] [Nat]Absence check using state equation in 4514 ms returned unknown
[2026-05-24 22:59:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-24 22:59:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:59:54] [INFO ] [Nat]Absence check using state equation in 4514 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 78/78 transitions.
Applied a total of 0 rules in 6 ms. Remains 12 /12 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 12/12 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 78/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-24 22:59:54] [INFO ] Invariant cache hit.
[2026-05-24 22:59:54] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-24 22:59:54] [INFO ] Invariant cache hit.
[2026-05-24 22:59:54] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [7, 11]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 68 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/12 places, 77/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76 ms. Remains : 10/12 places, 77/78 transitions.
findPositiveTsemiflow completed in 6 ms - Net is bounded UNSAT
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14299798073812973085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13647727209472136727.kers'
[2026-05-24 22:59:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14299798073812973085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13647727209472136727.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 10 cols 149 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 22:59:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13647727209472136727.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (127582 resets) in 1288 ms. (775 steps per ms)
BEST_FIRST walk for 8000005 steps (193179 resets) in 2747 ms. (2911 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-24 22:59:59] [INFO ] Invariant cache hit.
[2026-05-24 22:59:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-24 22:59:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:06] [INFO ] [Nat]Absence check using state equation in 7814 ms returned unsat
[2026-05-24 23:00:06] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-24 23:00:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:15] [INFO ] [Nat]Absence check using state equation in 9019 ms returned unknown
[2026-05-24 23:00:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-24 23:00:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:25] [INFO ] [Nat]Absence check using state equation in 9012 ms returned unknown
[2026-05-24 23:00:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-24 23:00:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:30] [INFO ] [Nat]Absence check using state equation in 5351 ms returned unsat
[2026-05-24 23:00:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-24 23:00:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:39] [INFO ] [Nat]Absence check using state equation in 9013 ms returned unknown
[2026-05-24 23:00:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-24 23:00:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:48] [INFO ] [Nat]Absence check using state equation in 9013 ms returned unknown
[2026-05-24 23:00:48] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-24 23:00:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:00:57] [INFO ] [Nat]Absence check using state equation in 9018 ms returned unknown
[2026-05-24 23:00:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-24 23:00:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:01:06] [INFO ] [Nat]Absence check using state equation in 8721 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[2, +inf, +inf, 2, +inf, +inf, +inf, 2]
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 77/77 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 74
Applied a total of 3 rules in 7 ms. Remains 10 /10 variables (removed 0) and now considering 74/77 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 10/10 places, 74/77 transitions.
findPositiveTsemiflow completed in 6 ms - Net is bounded UNSAT
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6966819203750736770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16036265140411945508.kers'
[2026-05-24 23:01:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6966819203750736770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16036265140411945508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 74 rows 10 cols 146 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 23:01:06] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16036265140411945508.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (113305 resets) in 1205 ms. (829 steps per ms)
BEST_FIRST walk for 5000003 steps (115639 resets) in 1743 ms. (2866 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2026-05-24 23:01:09] [INFO ] Invariant cache hit.
[2026-05-24 23:01:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-24 23:01:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:01:17] [INFO ] [Nat]Absence check using state equation in 8284 ms returned unsat
[2026-05-24 23:01:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-24 23:01:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:01:26] [INFO ] [Nat]Absence check using state equation in 9012 ms returned unknown
[2026-05-24 23:01:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-24 23:01:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:01:31] [INFO ] [Nat]Absence check using state equation in 4718 ms returned unsat
[2026-05-24 23:01:31] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-24 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:01:40] [INFO ] [Nat]Absence check using state equation in 9019 ms returned unknown
[2026-05-24 23:01:40] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-24 23:01:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:01:48] [INFO ] [Nat]Absence check using state equation in 8067 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2] Max Struct:[2, +inf, 2, +inf, 2]
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[+inf, +inf]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 74/74 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 72
Applied a total of 2 rules in 12 ms. Remains 10 /10 variables (removed 0) and now considering 72/74 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 10/10 places, 72/74 transitions.
findPositiveTsemiflow completed in 5 ms - Net is bounded UNSAT
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2464016135470240324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7780003347862681797.kers'
[2026-05-24 23:01:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2464016135470240324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7780003347862681797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 10 cols 144 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 23:01:48] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7780003347862681797.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (103794 resets) in 1105 ms. (904 steps per ms)
BEST_FIRST walk for 2000002 steps (45019 resets) in 687 ms. (2906 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[+inf, +inf]
[2026-05-24 23:01:50] [INFO ] Invariant cache hit.
[2026-05-24 23:01:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-24 23:01:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:01:57] [INFO ] [Nat]Absence check using state equation in 6637 ms returned unsat
[2026-05-24 23:01:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-24 23:01:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:06] [INFO ] [Nat]Absence check using state equation in 9011 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[2, +inf]
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/10 places, 72/72 transitions.
findPositiveTsemiflow completed in 5 ms - Net is bounded UNSAT
[2026-05-24 23:02:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (103768 resets) in 1093 ms. (914 steps per ms)
BEST_FIRST walk for 1000001 steps (22497 resets) in 341 ms. (2923 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2026-05-24 23:02:07] [INFO ] Invariant cache hit.
[2026-05-24 23:02:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-24 23:02:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 23:02:16] [INFO ] [Nat]Absence check using state equation in 9016 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 10 /10 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 10/10 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2026-05-24 23:02:16] [INFO ] Invariant cache hit.
[2026-05-24 23:02:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 23:02:16] [INFO ] Invariant cache hit.
[2026-05-24 23:02:17] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-24 23:02:17] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2026-05-24 23:02:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 72/82 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 10 constraints, problems are : Problem set: 0 solved, 67 unsolved in 620 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 72/82 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 0/82 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 77 constraints, problems are : Problem set: 0 solved, 67 unsolved in 30012 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30651ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 30652ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30734 ms. Remains : 10/10 places, 72/72 transitions.
findPositiveTsemiflow completed in 6 ms - Net is bounded UNSAT
RANDOM walk for 40000 steps (4147 resets) in 447 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (899 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Probably explored full state space saw : 1936 states, properties seen :0
Probabilistic random walk after 8133 steps, saw 1936 distinct states, run finished after 26 ms. (steps per millisecond=312 ) properties seen :0
Explored full state space saw : 1936 states, properties seen :0
Exhaustive walk after 8133 steps, saw 1936 distinct states, run finished after 22 ms. (steps per millisecond=369 ) properties seen :0
[2026-05-24 23:02:48] [INFO ] Flatten gal took : 28 ms
[2026-05-24 23:02:48] [INFO ] Flatten gal took : 7 ms
[2026-05-24 23:02:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16890763444020267228.gal : 5 ms
[2026-05-24 23:02:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4713543691562277763.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16890763444020267228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4713543691562277763.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-01track12Block1-UpperBounds-08 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-24 23:02:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (103797 resets) in 1100 ms. (908 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 245713 ms.

BK_STOP 1779663769243

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DNAwalker-PT-01track12Block1, 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 r098-tall-177955695800765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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