fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r186-tajo-165281571900159
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RERS17pb115-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16213.044 1704646.00 2015477.00 16552.80 ???TT?F??F???FTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281571900159.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RERS17pb115-PT-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281571900159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.5K Apr 30 06:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 06:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 30 06:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 30 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 30 06:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 69M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-00
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-01
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-02
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-03
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-04
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-05
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-06
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-07
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-08
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-09
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-10
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-11
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-12
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-13
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-14
FORMULA_NAME RERS17pb115-PT-2-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654447460299

Running Version 202205111006
[2022-06-05 16:44:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-05 16:44:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-05 16:44:23] [INFO ] Load time of PNML (sax parser for PT used): 2017 ms
[2022-06-05 16:44:23] [INFO ] Transformed 1399 places.
[2022-06-05 16:44:24] [INFO ] Transformed 144369 transitions.
[2022-06-05 16:44:24] [INFO ] Parsed PT model containing 1399 places and 144369 transitions in 2654 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1620 ms. (steps per millisecond=6 ) properties (out of 16) seen :3
FORMULA RERS17pb115-PT-2-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-2-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-2-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2022-06-05 16:44:28] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2022-06-05 16:44:29] [INFO ] Computed 37 place invariants in 468 ms
[2022-06-05 16:44:29] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-06-05 16:44:29] [INFO ] [Real]Absence check using 19 positive and 18 generalized place invariants in 3 ms returned sat
[2022-06-05 16:44:29] [INFO ] After 811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-05 16:44:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2022-06-05 16:44:30] [INFO ] [Nat]Absence check using 19 positive and 18 generalized place invariants in 4 ms returned sat
[2022-06-05 16:44:54] [INFO ] After 24374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-06-05 16:44:57] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 16:44:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-05 16:44:57] [INFO ] After 27145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 317 out of 1399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Applied a total of 18 rules in 1861 ms. Remains 1381 /1399 variables (removed 18) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1381/1399 places, 144369/144369 transitions.
Interrupted random walk after 263866 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 2
FORMULA RERS17pb115-PT-2-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-2-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 802769 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 0
Interrupted Best-First random walk after 388425 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 0
Interrupted Best-First random walk after 671748 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=134 ) properties seen 0
Interrupted Best-First random walk after 757452 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen 1
FORMULA RERS17pb115-PT-2-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 468135 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
Interrupted Best-First random walk after 883648 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=176 ) properties seen 0
Interrupted Best-First random walk after 409057 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen 0
Interrupted Best-First random walk after 587367 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen 0
Interrupted Best-First random walk after 966188 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen 0
Interrupted Best-First random walk after 530913 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen 0
Interrupted Best-First random walk after 652262 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen 0
Running SMT prover for 10 properties.
[2022-06-05 16:46:24] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2022-06-05 16:46:24] [INFO ] Computed 19 place invariants in 284 ms
[2022-06-05 16:46:25] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-06-05 16:46:25] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-05 16:46:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-06-05 16:46:57] [INFO ] After 31484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-06-05 16:46:58] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 16:47:23] [INFO ] After 25572ms SMT Verify possible using 2277 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-06-05 16:47:31] [INFO ] Deduced a trap composed of 73 places in 6581 ms of which 4 ms to minimize.
[2022-06-05 16:47:39] [INFO ] Deduced a trap composed of 65 places in 6238 ms of which 2 ms to minimize.
[2022-06-05 16:47:45] [INFO ] Deduced a trap composed of 97 places in 5202 ms of which 1 ms to minimize.
[2022-06-05 16:47:52] [INFO ] Deduced a trap composed of 81 places in 4903 ms of which 1 ms to minimize.
[2022-06-05 16:47:58] [INFO ] Deduced a trap composed of 129 places in 4461 ms of which 1 ms to minimize.
[2022-06-05 16:48:02] [INFO ] Deduced a trap composed of 49 places in 3113 ms of which 0 ms to minimize.
[2022-06-05 16:48:07] [INFO ] Deduced a trap composed of 65 places in 3409 ms of which 0 ms to minimize.
[2022-06-05 16:48:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 47712 ms
[2022-06-05 16:49:00] [INFO ] After 121828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 15216 ms.
[2022-06-05 16:49:15] [INFO ] After 170284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 240 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1291 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1381/1381 places, 144369/144369 transitions.
Interrupted random walk after 239570 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Interrupted Best-First random walk after 797955 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 0
Interrupted Best-First random walk after 390385 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
Interrupted Best-First random walk after 666759 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen 0
Interrupted Best-First random walk after 454018 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
Interrupted Best-First random walk after 885895 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 0
Interrupted Best-First random walk after 350710 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 0
Interrupted Best-First random walk after 636015 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=127 ) properties seen 1
FORMULA RERS17pb115-PT-2-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 885158 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=176 ) properties seen 0
Interrupted Best-First random walk after 455763 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 0
Interrupted Best-First random walk after 630761 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=126 ) properties seen 0
Running SMT prover for 9 properties.
[2022-06-05 16:50:37] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2022-06-05 16:50:37] [INFO ] Computed 19 place invariants in 275 ms
[2022-06-05 16:50:37] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2022-06-05 16:50:37] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-05 16:50:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-06-05 16:51:09] [INFO ] After 30961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-05 16:51:10] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 16:51:36] [INFO ] After 25884ms SMT Verify possible using 2277 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-05 16:51:44] [INFO ] Deduced a trap composed of 65 places in 6045 ms of which 0 ms to minimize.
[2022-06-05 16:51:51] [INFO ] Deduced a trap composed of 81 places in 5136 ms of which 1 ms to minimize.
[2022-06-05 16:51:57] [INFO ] Deduced a trap composed of 129 places in 5606 ms of which 1 ms to minimize.
[2022-06-05 16:52:04] [INFO ] Deduced a trap composed of 129 places in 5171 ms of which 1 ms to minimize.
[2022-06-05 16:52:10] [INFO ] Deduced a trap composed of 129 places in 4260 ms of which 0 ms to minimize.
[2022-06-05 16:52:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 37792 ms
[2022-06-05 16:52:55] [INFO ] After 105139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 14190 ms.
[2022-06-05 16:53:10] [INFO ] After 152284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 225 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1468 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1381/1381 places, 144369/144369 transitions.
Interrupted random walk after 269192 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 755098 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Interrupted Best-First random walk after 408152 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen 0
Interrupted Best-First random walk after 720281 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Interrupted Best-First random walk after 448471 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 872641 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=174 ) properties seen 0
Interrupted Best-First random walk after 298390 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen 0
Interrupted Best-First random walk after 938583 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=187 ) properties seen 0
Interrupted Best-First random walk after 468447 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
Interrupted Best-First random walk after 645637 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=129 ) properties seen 0
Interrupted probabilistic random walk after 357847 steps, run timeout after 225001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 357847 steps, saw 319129 distinct states, run finished after 225009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 9 properties.
[2022-06-05 16:58:12] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2022-06-05 16:58:12] [INFO ] Computed 19 place invariants in 374 ms
[2022-06-05 16:58:12] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-06-05 16:58:12] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-05 16:58:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-06-05 16:58:45] [INFO ] After 32101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-05 16:58:47] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 16:59:14] [INFO ] After 27608ms SMT Verify possible using 2277 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-05 16:59:22] [INFO ] Deduced a trap composed of 65 places in 6144 ms of which 1 ms to minimize.
[2022-06-05 16:59:28] [INFO ] Deduced a trap composed of 81 places in 5149 ms of which 1 ms to minimize.
[2022-06-05 16:59:35] [INFO ] Deduced a trap composed of 129 places in 5697 ms of which 0 ms to minimize.
[2022-06-05 16:59:42] [INFO ] Deduced a trap composed of 129 places in 5259 ms of which 0 ms to minimize.
[2022-06-05 16:59:48] [INFO ] Deduced a trap composed of 129 places in 4131 ms of which 0 ms to minimize.
[2022-06-05 16:59:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 37932 ms
[2022-06-05 17:00:33] [INFO ] After 106315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 13189 ms.
[2022-06-05 17:00:46] [INFO ] After 153590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 225 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 985 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1381/1381 places, 144369/144369 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 920 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2022-06-05 17:00:48] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2022-06-05 17:00:48] [INFO ] Computed 19 place invariants in 338 ms
[2022-06-05 17:00:53] [INFO ] Implicit Places using invariants in 5307 ms returned []
Implicit Place search using SMT only with invariants took 5309 ms to find 0 implicit places.
[2022-06-05 17:00:53] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2022-06-05 17:00:54] [INFO ] Computed 19 place invariants in 277 ms
[2022-06-05 17:01:24] [INFO ] Performed 105998/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-05 17:01:35] [INFO ] Dead Transitions using invariants and state equation in 41405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1381/1381 places, 144369/144369 transitions.
Interrupted random walk after 276404 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 839592 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Interrupted Best-First random walk after 446942 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 766121 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 0
Interrupted Best-First random walk after 506407 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4846 ms. (steps per millisecond=206 ) properties (out of 9) seen :0
Interrupted Best-First random walk after 371131 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=74 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4784 ms. (steps per millisecond=209 ) properties (out of 9) seen :0
Interrupted Best-First random walk after 500898 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 0
Interrupted Best-First random walk after 679177 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=135 ) properties seen 0
Interrupted probabilistic random walk after 299684 steps, run timeout after 222006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 299684 steps, saw 267075 distinct states, run finished after 222006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 9 properties.
[2022-06-05 17:06:32] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2022-06-05 17:06:32] [INFO ] Computed 19 place invariants in 385 ms
[2022-06-05 17:06:32] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-06-05 17:06:33] [INFO ] After 451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-05 17:06:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-06-05 17:07:02] [INFO ] After 28627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-05 17:07:03] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 17:07:26] [INFO ] After 23555ms SMT Verify possible using 2277 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-05 17:07:33] [INFO ] Deduced a trap composed of 65 places in 5437 ms of which 1 ms to minimize.
[2022-06-05 17:07:39] [INFO ] Deduced a trap composed of 81 places in 4888 ms of which 1 ms to minimize.
[2022-06-05 17:07:46] [INFO ] Deduced a trap composed of 129 places in 5018 ms of which 1 ms to minimize.
[2022-06-05 17:07:52] [INFO ] Deduced a trap composed of 129 places in 4960 ms of which 0 ms to minimize.
[2022-06-05 17:07:57] [INFO ] Deduced a trap composed of 129 places in 3804 ms of which 1 ms to minimize.
[2022-06-05 17:08:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 34475 ms
[2022-06-05 17:08:39] [INFO ] After 96264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 11401 ms.
[2022-06-05 17:08:50] [INFO ] After 137775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 225 out of 1381 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1248 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1381/1381 places, 144369/144369 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1381/1381 places, 144369/144369 transitions.
Applied a total of 0 rules in 1044 ms. Remains 1381 /1381 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2022-06-05 17:08:53] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2022-06-05 17:08:53] [INFO ] Computed 19 place invariants in 295 ms
[2022-06-05 17:08:58] [INFO ] Implicit Places using invariants in 5205 ms returned []
Implicit Place search using SMT only with invariants took 5205 ms to find 0 implicit places.
[2022-06-05 17:08:58] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1381 cols
[2022-06-05 17:08:58] [INFO ] Computed 19 place invariants in 211 ms
[2022-06-05 17:09:28] [INFO ] Performed 105466/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-05 17:09:39] [INFO ] Dead Transitions using invariants and state equation in 41549 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1381/1381 places, 144369/144369 transitions.
Ensure Unique test removed 63131 transitions
Reduce isomorphic transitions removed 63131 transitions.
Iterating post reduction 0 with 63131 rules applied. Total rules applied 63131 place count 1381 transition count 81238
Applied a total of 63131 rules in 2222 ms. Remains 1381 /1381 variables (removed 0) and now considering 81238/144369 (removed 63131) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 81238 rows 1381 cols
[2022-06-05 17:09:42] [INFO ] Computed 19 place invariants in 325 ms
[2022-06-05 17:09:43] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-06-05 17:09:43] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-05 17:09:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2022-06-05 17:10:11] [INFO ] After 27847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-05 17:10:15] [INFO ] Deduced a trap composed of 129 places in 2287 ms of which 1 ms to minimize.
[2022-06-05 17:10:18] [INFO ] Deduced a trap composed of 65 places in 1621 ms of which 1 ms to minimize.
[2022-06-05 17:10:20] [INFO ] Deduced a trap composed of 49 places in 1115 ms of which 0 ms to minimize.
[2022-06-05 17:10:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 11158 ms
[2022-06-05 17:10:46] [INFO ] After 62717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 11751 ms.
[2022-06-05 17:10:58] [INFO ] After 74972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2022-06-05 17:11:03] [INFO ] Flatten gal took : 4209 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15997487079658715182
[2022-06-05 17:11:06] [INFO ] Too many transitions (144369) to apply POR reductions. Disabling POR matrices.
[2022-06-05 17:11:08] [INFO ] Built C files in 2158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15997487079658715182
Running compilation step : cd /tmp/ltsmin15997487079658715182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '80' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-05 17:11:09] [INFO ] Applying decomposition
[2022-06-05 17:11:11] [INFO ] Flatten gal took : 5590 ms
[2022-06-05 17:11:14] [INFO ] Flatten gal took : 4432 ms
[2022-06-05 17:11:17] [INFO ] Input system was already deterministic with 144369 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18247961537945565297.txt' '-o' '/tmp/graph18247961537945565297.bin' '-w' '/tmp/graph18247961537945565297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18247961537945565297.bin' '-l' '-1' '-v' '-w' '/tmp/graph18247961537945565297.weights' '-q' '0' '-e' '0.001'
[2022-06-05 17:11:23] [INFO ] Decomposing Gal with order
[2022-06-05 17:11:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-05 17:11:34] [INFO ] Removed a total of 435685 redundant transitions.
[2022-06-05 17:11:35] [INFO ] Flatten gal took : 7080 ms
[2022-06-05 17:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2847 labels/synchronizations in 12720 ms.
[2022-06-05 17:11:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17729390715261794923.gal : 366 ms
[2022-06-05 17:11:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15367212240698598266.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17729390715261794923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15367212240698598266.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
[2022-06-05 17:11:55] [INFO ] Ran tautology test, simplified 0 / 9 in 44222 ms.
[2022-06-05 17:11:56] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-00(UNSAT) depth K=0 took 48 ms
[2022-06-05 17:11:56] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-01(UNSAT) depth K=0 took 1 ms
[2022-06-05 17:11:56] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-02(UNSAT) depth K=0 took 1 ms
[2022-06-05 17:11:56] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-05(UNSAT) depth K=0 took 1 ms
[2022-06-05 17:11:56] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-07(UNSAT) depth K=0 took 0 ms
[2022-06-05 17:11:56] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-08(UNSAT) depth K=0 took 0 ms
[2022-06-05 17:11:56] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-10(UNSAT) depth K=0 took 1 ms
[2022-06-05 17:11:56] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-11(UNSAT) depth K=0 took 0 ms
[2022-06-05 17:11:56] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-12(UNSAT) depth K=0 took 1 ms
[2022-06-05 17:11:57] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-00(UNSAT) depth K=1 took 56 ms
[2022-06-05 17:11:57] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-01(UNSAT) depth K=1 took 7 ms
[2022-06-05 17:11:57] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-02(UNSAT) depth K=1 took 8 ms
[2022-06-05 17:11:57] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-05(UNSAT) depth K=1 took 11 ms
[2022-06-05 17:11:57] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-07(UNSAT) depth K=1 took 1 ms
[2022-06-05 17:11:57] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-08(UNSAT) depth K=1 took 7 ms
[2022-06-05 17:11:57] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-10(UNSAT) depth K=1 took 1 ms
[2022-06-05 17:11:57] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-11(UNSAT) depth K=1 took 1 ms
[2022-06-05 17:11:57] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-12(UNSAT) depth K=1 took 2 ms
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15997487079658715182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '80' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 80 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15997487079658715182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '80' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 80 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-05 17:12:37] [INFO ] BMC solution for property RERS17pb115-PT-2-ReachabilityFireability-00(UNSAT) depth K=2 took 17302 ms

BK_STOP 1654449164945

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RERS17pb115-PT-2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281571900159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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