fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r210-tajo-159033476000663
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ShieldPPPt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.710 94506.00 115260.00 476.40 FTFTTTFTFFFFTTTT 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.r210-tajo-159033476000663.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 itstools
Input is ShieldPPPt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476000663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 3.6K May 14 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 19:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 19:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 08:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 185K May 12 20:42 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 ShieldPPPt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590610500058

[2020-05-27 20:15:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 20:15:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 20:15:01] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2020-05-27 20:15:01] [INFO ] Transformed 783 places.
[2020-05-27 20:15:01] [INFO ] Transformed 713 transitions.
[2020-05-27 20:15:01] [INFO ] Found NUPN structural information;
[2020-05-27 20:15:01] [INFO ] Parsed PT model containing 783 places and 713 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0]
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 1]
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 713 rows 783 cols
[2020-05-27 20:15:02] [INFO ] Computed 111 place invariants in 16 ms
[2020-05-27 20:15:02] [INFO ] [Real]Absence check using 111 positive place invariants in 76 ms returned sat
[2020-05-27 20:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:03] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2020-05-27 20:15:03] [INFO ] Deduced a trap composed of 25 places in 230 ms
[2020-05-27 20:15:03] [INFO ] Deduced a trap composed of 20 places in 218 ms
[2020-05-27 20:15:03] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-05-27 20:15:04] [INFO ] Deduced a trap composed of 23 places in 154 ms
[2020-05-27 20:15:04] [INFO ] Deduced a trap composed of 20 places in 140 ms
[2020-05-27 20:15:04] [INFO ] Deduced a trap composed of 22 places in 132 ms
[2020-05-27 20:15:04] [INFO ] Deduced a trap composed of 19 places in 144 ms
[2020-05-27 20:15:04] [INFO ] Deduced a trap composed of 20 places in 130 ms
[2020-05-27 20:15:05] [INFO ] Deduced a trap composed of 22 places in 146 ms
[2020-05-27 20:15:05] [INFO ] Deduced a trap composed of 28 places in 180 ms
[2020-05-27 20:15:05] [INFO ] Deduced a trap composed of 21 places in 121 ms
[2020-05-27 20:15:05] [INFO ] Deduced a trap composed of 30 places in 148 ms
[2020-05-27 20:15:05] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2020-05-27 20:15:05] [INFO ] Deduced a trap composed of 28 places in 83 ms
[2020-05-27 20:15:05] [INFO ] Deduced a trap composed of 26 places in 107 ms
[2020-05-27 20:15:06] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2767 ms
[2020-05-27 20:15:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:15:06] [INFO ] [Nat]Absence check using 111 positive place invariants in 153 ms returned sat
[2020-05-27 20:15:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:07] [INFO ] [Nat]Absence check using state equation in 1389 ms returned sat
[2020-05-27 20:15:07] [INFO ] Deduced a trap composed of 22 places in 248 ms
[2020-05-27 20:15:08] [INFO ] Deduced a trap composed of 21 places in 190 ms
[2020-05-27 20:15:08] [INFO ] Deduced a trap composed of 25 places in 192 ms
[2020-05-27 20:15:08] [INFO ] Deduced a trap composed of 20 places in 176 ms
[2020-05-27 20:15:08] [INFO ] Deduced a trap composed of 18 places in 157 ms
[2020-05-27 20:15:08] [INFO ] Deduced a trap composed of 18 places in 134 ms
[2020-05-27 20:15:09] [INFO ] Deduced a trap composed of 32 places in 139 ms
[2020-05-27 20:15:09] [INFO ] Deduced a trap composed of 17 places in 120 ms
[2020-05-27 20:15:09] [INFO ] Deduced a trap composed of 21 places in 110 ms
[2020-05-27 20:15:09] [INFO ] Deduced a trap composed of 25 places in 109 ms
[2020-05-27 20:15:09] [INFO ] Deduced a trap composed of 22 places in 136 ms
[2020-05-27 20:15:09] [INFO ] Deduced a trap composed of 25 places in 98 ms
[2020-05-27 20:15:10] [INFO ] Deduced a trap composed of 22 places in 103 ms
[2020-05-27 20:15:10] [INFO ] Deduced a trap composed of 23 places in 79 ms
[2020-05-27 20:15:10] [INFO ] Deduced a trap composed of 30 places in 61 ms
[2020-05-27 20:15:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2569 ms
[2020-05-27 20:15:10] [INFO ] Computed and/alt/rep : 712/1063/712 causal constraints in 51 ms.
[2020-05-27 20:15:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t41 0) (and (> t40 0) (< o40 o41)))") while checking expression at index 0
[2020-05-27 20:15:11] [INFO ] [Real]Absence check using 111 positive place invariants in 90 ms returned sat
[2020-05-27 20:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:12] [INFO ] [Real]Absence check using state equation in 1279 ms returned sat
[2020-05-27 20:15:12] [INFO ] Deduced a trap composed of 26 places in 298 ms
[2020-05-27 20:15:13] [INFO ] Deduced a trap composed of 19 places in 258 ms
[2020-05-27 20:15:13] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2020-05-27 20:15:13] [INFO ] Deduced a trap composed of 21 places in 251 ms
[2020-05-27 20:15:13] [INFO ] Deduced a trap composed of 20 places in 227 ms
[2020-05-27 20:15:14] [INFO ] Deduced a trap composed of 18 places in 212 ms
[2020-05-27 20:15:14] [INFO ] Deduced a trap composed of 19 places in 229 ms
[2020-05-27 20:15:14] [INFO ] Deduced a trap composed of 17 places in 210 ms
[2020-05-27 20:15:14] [INFO ] Deduced a trap composed of 21 places in 182 ms
[2020-05-27 20:15:15] [INFO ] Deduced a trap composed of 24 places in 180 ms
[2020-05-27 20:15:15] [INFO ] Deduced a trap composed of 27 places in 193 ms
[2020-05-27 20:15:15] [INFO ] Deduced a trap composed of 17 places in 156 ms
[2020-05-27 20:15:15] [INFO ] Deduced a trap composed of 42 places in 156 ms
[2020-05-27 20:15:15] [INFO ] Deduced a trap composed of 28 places in 151 ms
[2020-05-27 20:15:16] [INFO ] Deduced a trap composed of 28 places in 195 ms
[2020-05-27 20:15:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s321 s322 s323 s324 s325 s326 s332 s333 s334 s337 s338 s346 s348 s351 s377 s378 s379 s380 s381 s382 s383 s384) 0)") while checking expression at index 1
[2020-05-27 20:15:16] [INFO ] [Real]Absence check using 111 positive place invariants in 85 ms returned sat
[2020-05-27 20:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:17] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2020-05-27 20:15:17] [INFO ] Deduced a trap composed of 18 places in 212 ms
[2020-05-27 20:15:17] [INFO ] Deduced a trap composed of 22 places in 173 ms
[2020-05-27 20:15:18] [INFO ] Deduced a trap composed of 26 places in 195 ms
[2020-05-27 20:15:18] [INFO ] Deduced a trap composed of 22 places in 202 ms
[2020-05-27 20:15:18] [INFO ] Deduced a trap composed of 23 places in 165 ms
[2020-05-27 20:15:18] [INFO ] Deduced a trap composed of 32 places in 144 ms
[2020-05-27 20:15:18] [INFO ] Deduced a trap composed of 28 places in 127 ms
[2020-05-27 20:15:19] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2020-05-27 20:15:19] [INFO ] Deduced a trap composed of 20 places in 115 ms
[2020-05-27 20:15:19] [INFO ] Deduced a trap composed of 20 places in 117 ms
[2020-05-27 20:15:19] [INFO ] Deduced a trap composed of 27 places in 111 ms
[2020-05-27 20:15:19] [INFO ] Deduced a trap composed of 26 places in 104 ms
[2020-05-27 20:15:19] [INFO ] Deduced a trap composed of 20 places in 160 ms
[2020-05-27 20:15:19] [INFO ] Deduced a trap composed of 23 places in 85 ms
[2020-05-27 20:15:20] [INFO ] Deduced a trap composed of 20 places in 82 ms
[2020-05-27 20:15:20] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2020-05-27 20:15:20] [INFO ] Deduced a trap composed of 25 places in 93 ms
[2020-05-27 20:15:20] [INFO ] Deduced a trap composed of 21 places in 125 ms
[2020-05-27 20:15:20] [INFO ] Deduced a trap composed of 26 places in 117 ms
[2020-05-27 20:15:20] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3065 ms
[2020-05-27 20:15:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:15:20] [INFO ] [Nat]Absence check using 111 positive place invariants in 114 ms returned sat
[2020-05-27 20:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:21] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2020-05-27 20:15:22] [INFO ] Deduced a trap composed of 23 places in 327 ms
[2020-05-27 20:15:22] [INFO ] Deduced a trap composed of 18 places in 269 ms
[2020-05-27 20:15:22] [INFO ] Deduced a trap composed of 23 places in 235 ms
[2020-05-27 20:15:23] [INFO ] Deduced a trap composed of 24 places in 262 ms
[2020-05-27 20:15:23] [INFO ] Deduced a trap composed of 22 places in 194 ms
[2020-05-27 20:15:23] [INFO ] Deduced a trap composed of 20 places in 181 ms
[2020-05-27 20:15:23] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2020-05-27 20:15:23] [INFO ] Deduced a trap composed of 18 places in 223 ms
[2020-05-27 20:15:24] [INFO ] Deduced a trap composed of 23 places in 178 ms
[2020-05-27 20:15:24] [INFO ] Deduced a trap composed of 21 places in 201 ms
[2020-05-27 20:15:24] [INFO ] Deduced a trap composed of 29 places in 180 ms
[2020-05-27 20:15:24] [INFO ] Deduced a trap composed of 20 places in 155 ms
[2020-05-27 20:15:24] [INFO ] Deduced a trap composed of 23 places in 177 ms
[2020-05-27 20:15:25] [INFO ] Deduced a trap composed of 26 places in 135 ms
[2020-05-27 20:15:25] [INFO ] Deduced a trap composed of 22 places in 168 ms
[2020-05-27 20:15:25] [INFO ] Deduced a trap composed of 30 places in 163 ms
[2020-05-27 20:15:25] [INFO ] Deduced a trap composed of 27 places in 167 ms
[2020-05-27 20:15:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s167 s168 s169 s170 s171 s178 s179 s180 s181 s182 s185 s186 s187 s188 s189 s199 s208 s209 s210) 0)") while checking expression at index 2
[2020-05-27 20:15:25] [INFO ] [Real]Absence check using 111 positive place invariants in 83 ms returned sat
[2020-05-27 20:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:27] [INFO ] [Real]Absence check using state equation in 1185 ms returned sat
[2020-05-27 20:15:27] [INFO ] Deduced a trap composed of 19 places in 240 ms
[2020-05-27 20:15:27] [INFO ] Deduced a trap composed of 30 places in 211 ms
[2020-05-27 20:15:27] [INFO ] Deduced a trap composed of 23 places in 264 ms
[2020-05-27 20:15:28] [INFO ] Deduced a trap composed of 17 places in 281 ms
[2020-05-27 20:15:28] [INFO ] Deduced a trap composed of 23 places in 241 ms
[2020-05-27 20:15:28] [INFO ] Deduced a trap composed of 18 places in 219 ms
[2020-05-27 20:15:29] [INFO ] Deduced a trap composed of 23 places in 227 ms
[2020-05-27 20:15:29] [INFO ] Deduced a trap composed of 37 places in 225 ms
[2020-05-27 20:15:29] [INFO ] Deduced a trap composed of 22 places in 198 ms
[2020-05-27 20:15:29] [INFO ] Deduced a trap composed of 26 places in 201 ms
[2020-05-27 20:15:29] [INFO ] Deduced a trap composed of 21 places in 170 ms
[2020-05-27 20:15:30] [INFO ] Deduced a trap composed of 25 places in 193 ms
[2020-05-27 20:15:30] [INFO ] Deduced a trap composed of 21 places in 179 ms
[2020-05-27 20:15:30] [INFO ] Deduced a trap composed of 20 places in 172 ms
[2020-05-27 20:15:30] [INFO ] Deduced a trap composed of 20 places in 173 ms
[2020-05-27 20:15:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s475 s476 s477 s478 s479 s480 s500 s607 s608 s609 s610 s611 s612 s613 s614 s615) 0)") while checking expression at index 3
[2020-05-27 20:15:31] [INFO ] [Real]Absence check using 111 positive place invariants in 87 ms returned sat
[2020-05-27 20:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:32] [INFO ] [Real]Absence check using state equation in 1341 ms returned sat
[2020-05-27 20:15:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:15:32] [INFO ] [Nat]Absence check using 111 positive place invariants in 155 ms returned sat
[2020-05-27 20:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:33] [INFO ] [Nat]Absence check using state equation in 1272 ms returned sat
[2020-05-27 20:15:34] [INFO ] Deduced a trap composed of 14 places in 294 ms
[2020-05-27 20:15:34] [INFO ] Deduced a trap composed of 20 places in 272 ms
[2020-05-27 20:15:34] [INFO ] Deduced a trap composed of 22 places in 274 ms
[2020-05-27 20:15:35] [INFO ] Deduced a trap composed of 21 places in 304 ms
[2020-05-27 20:15:35] [INFO ] Deduced a trap composed of 17 places in 282 ms
[2020-05-27 20:15:35] [INFO ] Deduced a trap composed of 19 places in 242 ms
[2020-05-27 20:15:36] [INFO ] Deduced a trap composed of 20 places in 240 ms
[2020-05-27 20:15:36] [INFO ] Deduced a trap composed of 22 places in 261 ms
[2020-05-27 20:15:36] [INFO ] Deduced a trap composed of 28 places in 247 ms
[2020-05-27 20:15:36] [INFO ] Deduced a trap composed of 30 places in 213 ms
[2020-05-27 20:15:37] [INFO ] Deduced a trap composed of 25 places in 193 ms
[2020-05-27 20:15:37] [INFO ] Deduced a trap composed of 23 places in 177 ms
[2020-05-27 20:15:37] [INFO ] Deduced a trap composed of 24 places in 168 ms
[2020-05-27 20:15:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s321 s322 s323 s324 s325 s326 s346 s348 s349 s388 s389 s390 s391 s392 s393 s394 s395 s396) 0)") while checking expression at index 4
[2020-05-27 20:15:37] [INFO ] [Real]Absence check using 111 positive place invariants in 67 ms returned sat
[2020-05-27 20:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:38] [INFO ] [Real]Absence check using state equation in 1009 ms returned sat
[2020-05-27 20:15:39] [INFO ] Deduced a trap composed of 20 places in 259 ms
[2020-05-27 20:15:39] [INFO ] Deduced a trap composed of 27 places in 182 ms
[2020-05-27 20:15:39] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-05-27 20:15:39] [INFO ] Deduced a trap composed of 18 places in 234 ms
[2020-05-27 20:15:39] [INFO ] Deduced a trap composed of 21 places in 206 ms
[2020-05-27 20:15:40] [INFO ] Deduced a trap composed of 23 places in 203 ms
[2020-05-27 20:15:40] [INFO ] Deduced a trap composed of 22 places in 204 ms
[2020-05-27 20:15:40] [INFO ] Deduced a trap composed of 23 places in 194 ms
[2020-05-27 20:15:40] [INFO ] Deduced a trap composed of 24 places in 177 ms
[2020-05-27 20:15:41] [INFO ] Deduced a trap composed of 28 places in 177 ms
[2020-05-27 20:15:41] [INFO ] Deduced a trap composed of 20 places in 135 ms
[2020-05-27 20:15:41] [INFO ] Deduced a trap composed of 24 places in 123 ms
[2020-05-27 20:15:41] [INFO ] Deduced a trap composed of 23 places in 92 ms
[2020-05-27 20:15:41] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2020-05-27 20:15:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2921 ms
[2020-05-27 20:15:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:15:41] [INFO ] [Nat]Absence check using 111 positive place invariants in 125 ms returned sat
[2020-05-27 20:15:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:43] [INFO ] [Nat]Absence check using state equation in 1436 ms returned sat
[2020-05-27 20:15:43] [INFO ] Deduced a trap composed of 18 places in 300 ms
[2020-05-27 20:15:43] [INFO ] Deduced a trap composed of 23 places in 260 ms
[2020-05-27 20:15:44] [INFO ] Deduced a trap composed of 22 places in 236 ms
[2020-05-27 20:15:44] [INFO ] Deduced a trap composed of 17 places in 256 ms
[2020-05-27 20:15:44] [INFO ] Deduced a trap composed of 21 places in 262 ms
[2020-05-27 20:15:45] [INFO ] Deduced a trap composed of 27 places in 236 ms
[2020-05-27 20:15:45] [INFO ] Deduced a trap composed of 20 places in 236 ms
[2020-05-27 20:15:45] [INFO ] Deduced a trap composed of 24 places in 225 ms
[2020-05-27 20:15:45] [INFO ] Deduced a trap composed of 21 places in 214 ms
[2020-05-27 20:15:46] [INFO ] Deduced a trap composed of 19 places in 195 ms
[2020-05-27 20:15:46] [INFO ] Deduced a trap composed of 22 places in 179 ms
[2020-05-27 20:15:46] [INFO ] Deduced a trap composed of 25 places in 195 ms
[2020-05-27 20:15:46] [INFO ] Deduced a trap composed of 20 places in 176 ms
[2020-05-27 20:15:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 20:15:47] [INFO ] Deduced a trap composed of 22 places in 411 ms
[2020-05-27 20:15:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s552 s553 s554 s555 s560 s561 s596 s603 s604 s605 s619 s620 s621 s622 s623 s624 s625 s626 s627) 0)") while checking expression at index 5
Support contains 30 out of 783 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 783/783 places, 713/713 transitions.
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 177 place count 783 transition count 536
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 179 rules applied. Total rules applied 356 place count 606 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 605 transition count 534
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 357 place count 605 transition count 490
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 445 place count 561 transition count 490
Symmetric choice reduction at 3 with 70 rule applications. Total rules 515 place count 561 transition count 490
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 70 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 655 place count 491 transition count 420
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 655 place count 491 transition count 395
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 705 place count 466 transition count 395
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 1011 place count 313 transition count 242
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1065 place count 286 transition count 242
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1089 place count 286 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1090 place count 285 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1091 place count 284 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1091 place count 284 transition count 239
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1095 place count 282 transition count 239
Applied a total of 1095 rules in 157 ms. Remains 282 /783 variables (removed 501) and now considering 239/713 (removed 474) transitions.
Finished structural reductions, in 1 iterations. Remains : 282/783 places, 239/713 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2887 ms. (steps per millisecond=346 ) properties seen :[0, 0, 1, 0, 1, 1]
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1548 ms. (steps per millisecond=645 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1 resets, run finished after 1669 ms. (steps per millisecond=599 ) properties seen :[0, 1, 0]
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1561 ms. (steps per millisecond=640 ) properties seen :[0, 0]
// Phase 1: matrix 239 rows 282 cols
[2020-05-27 20:15:54] [INFO ] Computed 110 place invariants in 2 ms
[2020-05-27 20:15:55] [INFO ] [Real]Absence check using 110 positive place invariants in 63 ms returned sat
[2020-05-27 20:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:55] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2020-05-27 20:15:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-05-27 20:15:55] [INFO ] [Real]Added 13 Read/Feed constraints in 4 ms returned sat
[2020-05-27 20:15:55] [INFO ] Deduced a trap composed of 3 places in 96 ms
[2020-05-27 20:15:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2020-05-27 20:15:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:15:55] [INFO ] [Nat]Absence check using 110 positive place invariants in 46 ms returned sat
[2020-05-27 20:15:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:55] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2020-05-27 20:15:55] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2020-05-27 20:15:55] [INFO ] Deduced a trap composed of 8 places in 66 ms
[2020-05-27 20:15:55] [INFO ] Deduced a trap composed of 3 places in 43 ms
[2020-05-27 20:15:56] [INFO ] Deduced a trap composed of 3 places in 54 ms
[2020-05-27 20:15:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2020-05-27 20:15:56] [INFO ] Computed and/alt/rep : 226/563/226 causal constraints in 14 ms.
[2020-05-27 20:15:56] [INFO ] Added : 186 causal constraints over 38 iterations in 715 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-27 20:15:56] [INFO ] [Real]Absence check using 110 positive place invariants in 34 ms returned sat
[2020-05-27 20:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:57] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-05-27 20:15:57] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2020-05-27 20:15:57] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-27 20:15:57] [INFO ] Deduced a trap composed of 3 places in 28 ms
[2020-05-27 20:15:57] [INFO ] Deduced a trap composed of 3 places in 32 ms
[2020-05-27 20:15:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 133 ms
[2020-05-27 20:15:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:15:57] [INFO ] [Nat]Absence check using 110 positive place invariants in 41 ms returned sat
[2020-05-27 20:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:15:57] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-05-27 20:15:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 12 ms returned sat
[2020-05-27 20:15:57] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2020-05-27 20:15:57] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-27 20:15:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2020-05-27 20:15:57] [INFO ] Computed and/alt/rep : 226/563/226 causal constraints in 28 ms.
[2020-05-27 20:15:58] [INFO ] Added : 218 causal constraints over 45 iterations in 1211 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 4800 steps, including 109 resets, run finished after 34 ms. (steps per millisecond=141 ) properties seen :[0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 26800 steps, including 163 resets, run finished after 103 ms. (steps per millisecond=260 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 282 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 282/282 places, 239/239 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 280 transition count 237
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 280 transition count 232
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 275 transition count 232
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 275 transition count 232
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 274 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 274 transition count 230
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 273 transition count 230
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 37 place count 264 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 262 transition count 221
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 262 transition count 221
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 262 transition count 221
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 261 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 260 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 259 transition count 218
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 258 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 257 transition count 216
Applied a total of 50 rules in 71 ms. Remains 257 /282 variables (removed 25) and now considering 216/239 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 257/282 places, 216/239 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2498 ms. (steps per millisecond=400 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1540 ms. (steps per millisecond=649 ) properties seen :[0]
Interrupted probabilistic random walk after 10313177 steps, run timeout after 30001 ms. (steps per millisecond=343 ) properties seen :[0]
Probabilistic random walk after 10313177 steps, saw 1356087 distinct states, run finished after 30001 ms. (steps per millisecond=343 ) properties seen :[0]
// Phase 1: matrix 216 rows 257 cols
[2020-05-27 20:16:33] [INFO ] Computed 110 place invariants in 1 ms
[2020-05-27 20:16:33] [INFO ] [Real]Absence check using 110 positive place invariants in 53 ms returned sat
[2020-05-27 20:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:16:33] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-05-27 20:16:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:16:33] [INFO ] [Nat]Absence check using 110 positive place invariants in 52 ms returned sat
[2020-05-27 20:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:16:33] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-05-27 20:16:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2020-05-27 20:16:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2020-05-27 20:16:33] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-05-27 20:16:33] [INFO ] Deduced a trap composed of 3 places in 38 ms
[2020-05-27 20:16:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2020-05-27 20:16:33] [INFO ] Computed and/alt/rep : 209/515/209 causal constraints in 13 ms.
[2020-05-27 20:16:34] [INFO ] Added : 152 causal constraints over 31 iterations in 439 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Finished Parikh walk after 110 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=110 )
FORMULA ShieldPPPt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590610594564

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ShieldPPPt-PT-010B"
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"

# 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 ShieldPPPt-PT-010B, 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 r210-tajo-159033476000663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B 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 ;