fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r431-smll-171690581300096
Last Updated
July 7, 2024

About the Execution of ITS-Tools for TokenRing-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
383.315 67042.00 87302.00 349.40 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r431-smll-171690581300096.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is TokenRing-PT-005, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r431-smll-171690581300096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 61K Apr 11 19:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 352K Apr 11 19:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 433K Apr 11 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 27K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 55K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 168K Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 63K Apr 11 19:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 356K Apr 11 19:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 211K Apr 11 19:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 829K Apr 11 19:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1716978212007

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=TokenRing-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-05-29 10:23:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-29 10:23:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:23:34] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2024-05-29 10:23:34] [INFO ] Transformed 36 places.
[2024-05-29 10:23:34] [INFO ] Transformed 156 transitions.
[2024-05-29 10:23:34] [INFO ] Found NUPN structural information;
[2024-05-29 10:23:34] [INFO ] Parsed PT model containing 36 places and 156 transitions and 624 arcs in 552 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 11 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 7 ms.19145KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 36/36 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 50 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 96 ms. Remains : 36/36 places, 156/156 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 36/36 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 19 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 36 cols
[2024-05-29 10:23:34] [INFO ] Computed 6 invariants in 23 ms
[2024-05-29 10:23:35] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-29 10:23:35] [INFO ] Invariant cache hit.
[2024-05-29 10:23:35] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-29 10:23:35] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2024-05-29 10:23:35] [INFO ] Redundant transitions in 5 ms returned []
Running 151 sub problems to find dead transitions.
[2024-05-29 10:23:35] [INFO ] Invariant cache hit.
[2024-05-29 10:23:35] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:36] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 16 ms to minimize.
[2024-05-29 10:23:36] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
[2024-05-29 10:23:36] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-05-29 10:23:36] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-05-29 10:23:36] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 10:23:36] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 10:23:37] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 6 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:23:38] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:23:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 13 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:40] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 10:23:41] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:43] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 10:23:43] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:23:43] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 10:23:43] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:43] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:23:43] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-29 10:23:43] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:23:43] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:23:43] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:44] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 10:23:45] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 12/174 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:46] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:46] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-29 10:23:46] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 10:23:46] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 10:23:46] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-05-29 10:23:46] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:46] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 10:23:46] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 10:23:47] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:47] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-29 10:23:47] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 4 ms to minimize.
[2024-05-29 10:23:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 10:23:48] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:23:48] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 10:23:48] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 10:23:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:23:49] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:49] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 10:23:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 10:23:49] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:50] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:23:50] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 10:23:50] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 10:23:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 10:23:50] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:23:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 10:23:50] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:23:50] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 12/204 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:51] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:23:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-05-29 10:23:51] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-05-29 10:23:51] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 10:23:52] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 10:23:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:52] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:23:52] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:23:52] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:52] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/36 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:53] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-29 10:23:53] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:23:53] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:23:53] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:54] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:23:54] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/36 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:55] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:23:56] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:23:56] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/36 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:23:56] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-29 10:23:56] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/36 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/36 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 19 (OVERLAPS) 156/192 variables, 36/261 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/192 variables, 130/391 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 21 (INCLUDED_ONLY) 0/192 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/192 variables, and 391 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30024 ms.
Refiners :[Domain max(s): 36/36 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 183/183 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 183/225 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:06] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:24:06] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:24:06] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
[2024-05-29 10:24:07] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 10:24:07] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 10:24:07] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:24:07] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:24:07] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:24:07] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 10:24:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 10/235 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:07] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:24:08] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:24:08] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:24:08] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 10:24:08] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:24:08] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 10:24:08] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 7/242 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:09] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-29 10:24:09] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:24:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 10:24:09] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:11] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-29 10:24:11] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-29 10:24:11] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 10:24:11] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:11] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:12] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:24:12] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 10:24:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:13] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:15] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:15] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:16] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-29 10:24:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 10:24:17] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2024-05-29 10:24:17] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/36 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 15 (OVERLAPS) 156/192 variables, 36/297 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 130/427 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 151/578 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 19 (OVERLAPS) 0/192 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 578 constraints, problems are : Problem set: 0 solved, 151 unsolved in 29865 ms.
Refiners :[Domain max(s): 36/36 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 219/219 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61041 ms. Remains : 36/36 places, 156/156 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1536 ms (no deadlock found). (steps per millisecond=813 )
Random directed walk for 1250000 steps, including 0 resets, run took 1423 ms (no deadlock found). (steps per millisecond=878 )
[2024-05-29 10:24:38] [INFO ] Invariant cache hit.
[2024-05-29 10:24:38] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 64899 ms.

BK_STOP 1716978279049

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="TokenRing-PT-005"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool itstools"
echo " Input is TokenRing-PT-005, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r431-smll-171690581300096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-005.tgz
mv TokenRing-PT-005 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;