About the Execution of ITS-LoLa for DES-PT-60b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.230 | 3600000.00 | 3648426.00 | 1126.00 | FTFF?????F?F?FTF | 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/mcc2020-input.r180-ebro-158987900000330.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DES-PT-60b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000330
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 139K Mar 24 05:37 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 DES-PT-60b-00
FORMULA_NAME DES-PT-60b-01
FORMULA_NAME DES-PT-60b-02
FORMULA_NAME DES-PT-60b-03
FORMULA_NAME DES-PT-60b-04
FORMULA_NAME DES-PT-60b-05
FORMULA_NAME DES-PT-60b-06
FORMULA_NAME DES-PT-60b-07
FORMULA_NAME DES-PT-60b-08
FORMULA_NAME DES-PT-60b-09
FORMULA_NAME DES-PT-60b-10
FORMULA_NAME DES-PT-60b-11
FORMULA_NAME DES-PT-60b-12
FORMULA_NAME DES-PT-60b-13
FORMULA_NAME DES-PT-60b-14
FORMULA_NAME DES-PT-60b-15
=== Now, execution of the tool begins
BK_START 1591201188629
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:19:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 16:19:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:19:52] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2020-06-03 16:19:52] [INFO ] Transformed 519 places.
[2020-06-03 16:19:52] [INFO ] Transformed 470 transitions.
[2020-06-03 16:19:52] [INFO ] Found NUPN structural information;
[2020-06-03 16:19:52] [INFO ] Parsed PT model containing 519 places and 470 transitions in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 65 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 855 resets, run finished after 626 ms. (steps per millisecond=159 ) properties seen :[1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 470 rows 519 cols
[2020-06-03 16:19:52] [INFO ] Computed 65 place invariants in 72 ms
[2020-06-03 16:19:53] [INFO ] [Real]Absence check using 39 positive place invariants in 76 ms returned sat
[2020-06-03 16:19:53] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 62 ms returned sat
[2020-06-03 16:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:19:55] [INFO ] [Real]Absence check using state equation in 1807 ms returned sat
[2020-06-03 16:19:55] [INFO ] Deduced a trap composed of 8 places in 434 ms
[2020-06-03 16:19:56] [INFO ] Deduced a trap composed of 12 places in 362 ms
[2020-06-03 16:19:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 981 ms
[2020-06-03 16:19:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:19:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 95 ms returned sat
[2020-06-03 16:19:56] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 108 ms returned sat
[2020-06-03 16:19:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:19:58] [INFO ] [Nat]Absence check using state equation in 2125 ms returned sat
[2020-06-03 16:19:59] [INFO ] Deduced a trap composed of 12 places in 392 ms
[2020-06-03 16:19:59] [INFO ] Deduced a trap composed of 13 places in 369 ms
[2020-06-03 16:19:59] [INFO ] Deduced a trap composed of 22 places in 280 ms
[2020-06-03 16:20:00] [INFO ] Deduced a trap composed of 18 places in 249 ms
[2020-06-03 16:20:00] [INFO ] Deduced a trap composed of 31 places in 250 ms
[2020-06-03 16:20:00] [INFO ] Deduced a trap composed of 49 places in 169 ms
[2020-06-03 16:20:00] [INFO ] Deduced a trap composed of 38 places in 181 ms
[2020-06-03 16:20:01] [INFO ] Deduced a trap composed of 18 places in 165 ms
[2020-06-03 16:20:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2489 ms
[2020-06-03 16:20:01] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 60 ms.
[2020-06-03 16:20:08] [INFO ] Added : 315 causal constraints over 64 iterations in 6972 ms. Result :sat
[2020-06-03 16:20:08] [INFO ] Deduced a trap composed of 51 places in 261 ms
[2020-06-03 16:20:08] [INFO ] Deduced a trap composed of 27 places in 272 ms
[2020-06-03 16:20:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 862 ms
[2020-06-03 16:20:09] [INFO ] [Real]Absence check using 39 positive place invariants in 54 ms returned sat
[2020-06-03 16:20:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 55 ms returned sat
[2020-06-03 16:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:20:10] [INFO ] [Real]Absence check using state equation in 1479 ms returned sat
[2020-06-03 16:20:11] [INFO ] Deduced a trap composed of 29 places in 266 ms
[2020-06-03 16:20:11] [INFO ] Deduced a trap composed of 10 places in 155 ms
[2020-06-03 16:20:11] [INFO ] Deduced a trap composed of 14 places in 144 ms
[2020-06-03 16:20:11] [INFO ] Deduced a trap composed of 16 places in 158 ms
[2020-06-03 16:20:11] [INFO ] Deduced a trap composed of 15 places in 145 ms
[2020-06-03 16:20:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1129 ms
[2020-06-03 16:20:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:20:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 96 ms returned sat
[2020-06-03 16:20:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 60 ms returned sat
[2020-06-03 16:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:20:13] [INFO ] [Nat]Absence check using state equation in 1552 ms returned sat
[2020-06-03 16:20:14] [INFO ] Deduced a trap composed of 8 places in 353 ms
[2020-06-03 16:20:14] [INFO ] Deduced a trap composed of 20 places in 309 ms
[2020-06-03 16:20:14] [INFO ] Deduced a trap composed of 21 places in 309 ms
[2020-06-03 16:20:15] [INFO ] Deduced a trap composed of 87 places in 361 ms
[2020-06-03 16:20:15] [INFO ] Deduced a trap composed of 12 places in 328 ms
[2020-06-03 16:20:16] [INFO ] Deduced a trap composed of 88 places in 334 ms
[2020-06-03 16:20:16] [INFO ] Deduced a trap composed of 80 places in 297 ms
[2020-06-03 16:20:16] [INFO ] Deduced a trap composed of 92 places in 308 ms
[2020-06-03 16:20:17] [INFO ] Deduced a trap composed of 96 places in 284 ms
[2020-06-03 16:20:17] [INFO ] Deduced a trap composed of 90 places in 291 ms
[2020-06-03 16:20:17] [INFO ] Deduced a trap composed of 86 places in 324 ms
[2020-06-03 16:20:18] [INFO ] Deduced a trap composed of 86 places in 306 ms
[2020-06-03 16:20:18] [INFO ] Deduced a trap composed of 89 places in 289 ms
[2020-06-03 16:20:18] [INFO ] Deduced a trap composed of 105 places in 301 ms
[2020-06-03 16:20:19] [INFO ] Deduced a trap composed of 15 places in 280 ms
[2020-06-03 16:20:19] [INFO ] Deduced a trap composed of 16 places in 229 ms
[2020-06-03 16:20:19] [INFO ] Deduced a trap composed of 98 places in 227 ms
[2020-06-03 16:20:20] [INFO ] Deduced a trap composed of 20 places in 296 ms
[2020-06-03 16:20:20] [INFO ] Deduced a trap composed of 18 places in 252 ms
[2020-06-03 16:20:20] [INFO ] Deduced a trap composed of 12 places in 219 ms
[2020-06-03 16:20:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7071 ms
[2020-06-03 16:20:20] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 63 ms.
[2020-06-03 16:20:30] [INFO ] Added : 446 causal constraints over 90 iterations in 9681 ms. Result :sat
[2020-06-03 16:20:30] [INFO ] [Real]Absence check using 39 positive place invariants in 62 ms returned sat
[2020-06-03 16:20:30] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:20:32] [INFO ] [Real]Absence check using state equation in 1454 ms returned sat
[2020-06-03 16:20:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:20:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 77 ms returned sat
[2020-06-03 16:20:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 123 ms returned sat
[2020-06-03 16:20:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:20:34] [INFO ] [Nat]Absence check using state equation in 2087 ms returned sat
[2020-06-03 16:20:35] [INFO ] Deduced a trap composed of 37 places in 322 ms
[2020-06-03 16:20:35] [INFO ] Deduced a trap composed of 14 places in 294 ms
[2020-06-03 16:20:35] [INFO ] Deduced a trap composed of 15 places in 291 ms
[2020-06-03 16:20:36] [INFO ] Deduced a trap composed of 18 places in 285 ms
[2020-06-03 16:20:36] [INFO ] Deduced a trap composed of 20 places in 280 ms
[2020-06-03 16:20:36] [INFO ] Deduced a trap composed of 31 places in 298 ms
[2020-06-03 16:20:37] [INFO ] Deduced a trap composed of 22 places in 276 ms
[2020-06-03 16:20:37] [INFO ] Deduced a trap composed of 21 places in 613 ms
[2020-06-03 16:20:38] [INFO ] Deduced a trap composed of 34 places in 274 ms
[2020-06-03 16:20:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3445 ms
[2020-06-03 16:20:38] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 56 ms.
[2020-06-03 16:20:45] [INFO ] Added : 318 causal constraints over 65 iterations in 7554 ms. Result :sat
[2020-06-03 16:20:45] [INFO ] [Real]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-06-03 16:20:46] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 55 ms returned sat
[2020-06-03 16:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:20:47] [INFO ] [Real]Absence check using state equation in 1606 ms returned sat
[2020-06-03 16:20:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:20:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 83 ms returned sat
[2020-06-03 16:20:47] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 76 ms returned sat
[2020-06-03 16:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:20:49] [INFO ] [Nat]Absence check using state equation in 1584 ms returned sat
[2020-06-03 16:20:49] [INFO ] Deduced a trap composed of 45 places in 265 ms
[2020-06-03 16:20:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2020-06-03 16:20:49] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 47 ms.
[2020-06-03 16:20:59] [INFO ] Added : 446 causal constraints over 90 iterations in 9112 ms. Result :sat
[2020-06-03 16:20:59] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-06-03 16:20:59] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned unsat
[2020-06-03 16:20:59] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-06-03 16:20:59] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 56 ms returned sat
[2020-06-03 16:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:21:00] [INFO ] [Real]Absence check using state equation in 1407 ms returned sat
[2020-06-03 16:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:21:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:21:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 78 ms returned sat
[2020-06-03 16:21:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:21:02] [INFO ] [Nat]Absence check using state equation in 1346 ms returned sat
[2020-06-03 16:21:02] [INFO ] Deduced a trap composed of 13 places in 319 ms
[2020-06-03 16:21:03] [INFO ] Deduced a trap composed of 12 places in 302 ms
[2020-06-03 16:21:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 853 ms
[2020-06-03 16:21:03] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 56 ms.
[2020-06-03 16:21:09] [INFO ] Added : 354 causal constraints over 71 iterations in 6531 ms. Result :sat
[2020-06-03 16:21:10] [INFO ] [Real]Absence check using 39 positive place invariants in 162 ms returned sat
[2020-06-03 16:21:10] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 145 ms returned sat
[2020-06-03 16:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:21:12] [INFO ] [Real]Absence check using state equation in 2034 ms returned sat
[2020-06-03 16:21:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:21:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 78 ms returned sat
[2020-06-03 16:21:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 179 ms returned sat
[2020-06-03 16:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:21:14] [INFO ] [Nat]Absence check using state equation in 1837 ms returned sat
[2020-06-03 16:21:14] [INFO ] Deduced a trap composed of 8 places in 209 ms
[2020-06-03 16:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2020-06-03 16:21:15] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 53 ms.
[2020-06-03 16:21:20] [INFO ] Added : 255 causal constraints over 51 iterations in 5724 ms. Result :sat
[2020-06-03 16:21:21] [INFO ] Deduced a trap composed of 55 places in 322 ms
[2020-06-03 16:21:21] [INFO ] Deduced a trap composed of 45 places in 329 ms
[2020-06-03 16:21:21] [INFO ] Deduced a trap composed of 43 places in 284 ms
[2020-06-03 16:21:22] [INFO ] Deduced a trap composed of 64 places in 298 ms
[2020-06-03 16:21:22] [INFO ] Deduced a trap composed of 59 places in 268 ms
[2020-06-03 16:21:23] [INFO ] Deduced a trap composed of 57 places in 268 ms
[2020-06-03 16:21:23] [INFO ] Deduced a trap composed of 54 places in 268 ms
[2020-06-03 16:21:23] [INFO ] Deduced a trap composed of 55 places in 311 ms
[2020-06-03 16:21:24] [INFO ] Deduced a trap composed of 52 places in 258 ms
[2020-06-03 16:21:24] [INFO ] Deduced a trap composed of 52 places in 255 ms
[2020-06-03 16:21:24] [INFO ] Deduced a trap composed of 27 places in 295 ms
[2020-06-03 16:21:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4168 ms
[2020-06-03 16:21:25] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-06-03 16:21:25] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 16:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:21:26] [INFO ] [Real]Absence check using state equation in 1531 ms returned sat
[2020-06-03 16:21:27] [INFO ] Deduced a trap composed of 17 places in 328 ms
[2020-06-03 16:21:27] [INFO ] Deduced a trap composed of 12 places in 263 ms
[2020-06-03 16:21:27] [INFO ] Deduced a trap composed of 15 places in 205 ms
[2020-06-03 16:21:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 994 ms
[2020-06-03 16:21:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:21:27] [INFO ] [Nat]Absence check using 39 positive place invariants in 82 ms returned sat
[2020-06-03 16:21:27] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 67 ms returned sat
[2020-06-03 16:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:21:29] [INFO ] [Nat]Absence check using state equation in 1931 ms returned sat
[2020-06-03 16:21:30] [INFO ] Deduced a trap composed of 16 places in 310 ms
[2020-06-03 16:21:30] [INFO ] Deduced a trap composed of 8 places in 249 ms
[2020-06-03 16:21:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2020-06-03 16:21:30] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 42 ms.
[2020-06-03 16:21:41] [INFO ] Added : 444 causal constraints over 90 iterations in 11296 ms. Result :sat
[2020-06-03 16:21:42] [INFO ] Deduced a trap composed of 35 places in 222 ms
[2020-06-03 16:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 381 ms
[2020-06-03 16:21:42] [INFO ] [Real]Absence check using 39 positive place invariants in 66 ms returned sat
[2020-06-03 16:21:42] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 55 ms returned sat
[2020-06-03 16:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:21:43] [INFO ] [Real]Absence check using state equation in 1430 ms returned sat
[2020-06-03 16:21:44] [INFO ] Deduced a trap composed of 12 places in 306 ms
[2020-06-03 16:21:44] [INFO ] Deduced a trap composed of 27 places in 270 ms
[2020-06-03 16:21:44] [INFO ] Deduced a trap composed of 14 places in 183 ms
[2020-06-03 16:21:45] [INFO ] Deduced a trap composed of 18 places in 177 ms
[2020-06-03 16:21:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1241 ms
[2020-06-03 16:21:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:21:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 81 ms returned sat
[2020-06-03 16:21:45] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 59 ms returned sat
[2020-06-03 16:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:21:47] [INFO ] [Nat]Absence check using state equation in 1641 ms returned sat
[2020-06-03 16:21:47] [INFO ] Deduced a trap composed of 19 places in 267 ms
[2020-06-03 16:21:47] [INFO ] Deduced a trap composed of 8 places in 267 ms
[2020-06-03 16:21:48] [INFO ] Deduced a trap composed of 12 places in 268 ms
[2020-06-03 16:21:48] [INFO ] Deduced a trap composed of 20 places in 246 ms
[2020-06-03 16:21:48] [INFO ] Deduced a trap composed of 12 places in 245 ms
[2020-06-03 16:21:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1525 ms
[2020-06-03 16:21:48] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 45 ms.
[2020-06-03 16:21:59] [INFO ] Added : 444 causal constraints over 89 iterations in 10549 ms. Result :sat
[2020-06-03 16:21:59] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-06-03 16:21:59] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 16:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:22:01] [INFO ] [Real]Absence check using state equation in 1727 ms returned sat
[2020-06-03 16:22:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:22:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:22:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 16:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:22:03] [INFO ] [Nat]Absence check using state equation in 1704 ms returned sat
[2020-06-03 16:22:03] [INFO ] Deduced a trap composed of 14 places in 417 ms
[2020-06-03 16:22:04] [INFO ] Deduced a trap composed of 10 places in 327 ms
[2020-06-03 16:22:04] [INFO ] Deduced a trap composed of 24 places in 252 ms
[2020-06-03 16:22:04] [INFO ] Deduced a trap composed of 17 places in 158 ms
[2020-06-03 16:22:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1414 ms
[2020-06-03 16:22:04] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 43 ms.
[2020-06-03 16:22:14] [INFO ] Added : 355 causal constraints over 72 iterations in 10019 ms. Result :sat
[2020-06-03 16:22:15] [INFO ] Deduced a trap composed of 50 places in 243 ms
[2020-06-03 16:22:15] [INFO ] Deduced a trap composed of 35 places in 294 ms
[2020-06-03 16:22:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1138 ms
[2020-06-03 16:22:16] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:22:16] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:22:17] [INFO ] [Real]Absence check using state equation in 1544 ms returned sat
[2020-06-03 16:22:18] [INFO ] Deduced a trap composed of 8 places in 210 ms
[2020-06-03 16:22:18] [INFO ] Deduced a trap composed of 12 places in 225 ms
[2020-06-03 16:22:18] [INFO ] Deduced a trap composed of 19 places in 88 ms
[2020-06-03 16:22:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 685 ms
[2020-06-03 16:22:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:22:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:22:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:22:20] [INFO ] [Nat]Absence check using state equation in 1653 ms returned sat
[2020-06-03 16:22:20] [INFO ] Deduced a trap composed of 8 places in 470 ms
[2020-06-03 16:22:21] [INFO ] Deduced a trap composed of 12 places in 521 ms
[2020-06-03 16:22:21] [INFO ] Deduced a trap composed of 21 places in 337 ms
[2020-06-03 16:22:22] [INFO ] Deduced a trap composed of 16 places in 278 ms
[2020-06-03 16:22:22] [INFO ] Deduced a trap composed of 18 places in 716 ms
[2020-06-03 16:22:23] [INFO ] Deduced a trap composed of 44 places in 542 ms
[2020-06-03 16:22:24] [INFO ] Deduced a trap composed of 18 places in 451 ms
[2020-06-03 16:22:24] [INFO ] Deduced a trap composed of 23 places in 344 ms
[2020-06-03 16:22:24] [INFO ] Deduced a trap composed of 25 places in 321 ms
[2020-06-03 16:22:25] [INFO ] Deduced a trap composed of 38 places in 335 ms
[2020-06-03 16:22:25] [INFO ] Deduced a trap composed of 35 places in 271 ms
[2020-06-03 16:22:25] [INFO ] Deduced a trap composed of 30 places in 249 ms
[2020-06-03 16:22:26] [INFO ] Deduced a trap composed of 34 places in 233 ms
[2020-06-03 16:22:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5724 ms
[2020-06-03 16:22:26] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 54 ms.
[2020-06-03 16:22:37] [INFO ] Added : 445 causal constraints over 89 iterations in 11554 ms. Result :sat
[2020-06-03 16:22:38] [INFO ] Deduced a trap composed of 27 places in 330 ms
[2020-06-03 16:22:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 522 ms
[2020-06-03 16:22:38] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:22:38] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:22:40] [INFO ] [Real]Absence check using state equation in 1613 ms returned sat
[2020-06-03 16:22:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:22:40] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:22:40] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 75 ms returned sat
[2020-06-03 16:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:22:42] [INFO ] [Nat]Absence check using state equation in 2211 ms returned sat
[2020-06-03 16:22:42] [INFO ] Deduced a trap composed of 12 places in 329 ms
[2020-06-03 16:22:43] [INFO ] Deduced a trap composed of 14 places in 199 ms
[2020-06-03 16:22:43] [INFO ] Deduced a trap composed of 30 places in 189 ms
[2020-06-03 16:22:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 904 ms
[2020-06-03 16:22:43] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 41 ms.
[2020-06-03 16:22:49] [INFO ] Added : 282 causal constraints over 57 iterations in 6273 ms. Result :sat
[2020-06-03 16:22:50] [INFO ] Deduced a trap composed of 44 places in 308 ms
[2020-06-03 16:22:50] [INFO ] Deduced a trap composed of 32 places in 367 ms
[2020-06-03 16:22:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 908 ms
[2020-06-03 16:22:50] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-06-03 16:22:50] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 63 ms returned sat
[2020-06-03 16:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:22:52] [INFO ] [Real]Absence check using state equation in 1412 ms returned sat
[2020-06-03 16:22:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:22:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 83 ms returned sat
[2020-06-03 16:22:52] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 77 ms returned sat
[2020-06-03 16:22:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:22:55] [INFO ] [Nat]Absence check using state equation in 2693 ms returned sat
[2020-06-03 16:22:55] [INFO ] Deduced a trap composed of 19 places in 397 ms
[2020-06-03 16:22:56] [INFO ] Deduced a trap composed of 18 places in 325 ms
[2020-06-03 16:22:56] [INFO ] Deduced a trap composed of 19 places in 355 ms
[2020-06-03 16:22:56] [INFO ] Deduced a trap composed of 24 places in 174 ms
[2020-06-03 16:22:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1542 ms
[2020-06-03 16:22:56] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 65 ms.
[2020-06-03 16:23:04] [INFO ] Added : 461 causal constraints over 93 iterations in 8016 ms. Result :sat
[2020-06-03 16:23:05] [INFO ] Deduced a trap composed of 44 places in 204 ms
[2020-06-03 16:23:05] [INFO ] Deduced a trap composed of 35 places in 209 ms
[2020-06-03 16:23:05] [INFO ] Deduced a trap composed of 30 places in 99 ms
[2020-06-03 16:23:06] [INFO ] Deduced a trap composed of 39 places in 312 ms
[2020-06-03 16:23:06] [INFO ] Deduced a trap composed of 39 places in 324 ms
[2020-06-03 16:23:06] [INFO ] Deduced a trap composed of 44 places in 277 ms
[2020-06-03 16:23:07] [INFO ] Deduced a trap composed of 35 places in 289 ms
[2020-06-03 16:23:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2658 ms
[2020-06-03 16:23:07] [INFO ] [Real]Absence check using 39 positive place invariants in 51 ms returned sat
[2020-06-03 16:23:07] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 61 ms returned sat
[2020-06-03 16:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:23:09] [INFO ] [Real]Absence check using state equation in 1532 ms returned sat
[2020-06-03 16:23:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:23:09] [INFO ] [Nat]Absence check using 39 positive place invariants in 81 ms returned sat
[2020-06-03 16:23:09] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 105 ms returned sat
[2020-06-03 16:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:23:11] [INFO ] [Nat]Absence check using state equation in 1669 ms returned sat
[2020-06-03 16:23:11] [INFO ] Deduced a trap composed of 19 places in 316 ms
[2020-06-03 16:23:11] [INFO ] Deduced a trap composed of 43 places in 271 ms
[2020-06-03 16:23:12] [INFO ] Deduced a trap composed of 18 places in 198 ms
[2020-06-03 16:23:12] [INFO ] Deduced a trap composed of 32 places in 128 ms
[2020-06-03 16:23:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1174 ms
[2020-06-03 16:23:12] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 50 ms.
[2020-06-03 16:23:21] [INFO ] Added : 460 causal constraints over 93 iterations in 8938 ms. Result :sat
[2020-06-03 16:23:21] [INFO ] [Real]Absence check using 39 positive place invariants in 72 ms returned sat
[2020-06-03 16:23:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:23:23] [INFO ] [Real]Absence check using state equation in 1518 ms returned sat
[2020-06-03 16:23:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:23:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 88 ms returned sat
[2020-06-03 16:23:23] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 82 ms returned sat
[2020-06-03 16:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:23:25] [INFO ] [Nat]Absence check using state equation in 1570 ms returned sat
[2020-06-03 16:23:25] [INFO ] Deduced a trap composed of 12 places in 324 ms
[2020-06-03 16:23:25] [INFO ] Deduced a trap composed of 13 places in 249 ms
[2020-06-03 16:23:26] [INFO ] Deduced a trap composed of 21 places in 236 ms
[2020-06-03 16:23:26] [INFO ] Deduced a trap composed of 14 places in 192 ms
[2020-06-03 16:23:26] [INFO ] Deduced a trap composed of 35 places in 292 ms
[2020-06-03 16:23:27] [INFO ] Deduced a trap composed of 31 places in 198 ms
[2020-06-03 16:23:27] [INFO ] Deduced a trap composed of 32 places in 208 ms
[2020-06-03 16:23:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2267 ms
[2020-06-03 16:23:27] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 58 ms.
[2020-06-03 16:23:33] [INFO ] Added : 296 causal constraints over 60 iterations in 6114 ms. Result :sat
[2020-06-03 16:23:33] [INFO ] Deduced a trap composed of 40 places in 295 ms
[2020-06-03 16:23:34] [INFO ] Deduced a trap composed of 59 places in 267 ms
[2020-06-03 16:23:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 835 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 16:23:34] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 16:23:34] [INFO ] Flatten gal took : 157 ms
FORMULA DES-PT-60b-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:23:34] [INFO ] Applying decomposition
[2020-06-03 16:23:34] [INFO ] Flatten gal took : 79 ms
[2020-06-03 16:23:35] [INFO ] Decomposing Gal with order
[2020-06-03 16:23:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 16:23:35] [INFO ] Removed a total of 257 redundant transitions.
[2020-06-03 16:23:35] [INFO ] Flatten gal took : 277 ms
[2020-06-03 16:23:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 882 labels/synchronizations in 70 ms.
[2020-06-03 16:23:35] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2020-06-03 16:23:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DES-PT-60b @ 3570 seconds
FORMULA DES-PT-60b-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-60b-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 11745292 kB
After kill :
MemTotal: 16427456 kB
MemFree: 11753404 kB
--------------------
content from stderr:
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="DES-PT-60b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is DES-PT-60b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900000330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;