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.r211-tajo-159033477800676.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 ShieldPPPt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477800676
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 3.4K May 14 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:52 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 376K 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-020B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591320671291

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 01:31:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 01:31:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 01:31:13] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2020-06-05 01:31:13] [INFO ] Transformed 1563 places.
[2020-06-05 01:31:13] [INFO ] Transformed 1423 transitions.
[2020-06-05 01:31:13] [INFO ] Found NUPN structural information;
[2020-06-05 01:31:13] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 69 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 461 ms. (steps per millisecond=216 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 1423 rows 1563 cols
[2020-06-05 01:31:13] [INFO ] Computed 221 place invariants in 34 ms
[2020-06-05 01:31:14] [INFO ] [Real]Absence check using 221 positive place invariants in 199 ms returned sat
[2020-06-05 01:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:31:18] [INFO ] [Real]Absence check using state equation in 3801 ms returned sat
[2020-06-05 01:31:18] [INFO ] Deduced a trap composed of 16 places in 619 ms
[2020-06-05 01:31:19] [INFO ] Deduced a trap composed of 21 places in 530 ms
[2020-06-05 01:31:19] [INFO ] Deduced a trap composed of 31 places in 493 ms
[2020-06-05 01:31:20] [INFO ] Deduced a trap composed of 25 places in 505 ms
[2020-06-05 01:31:20] [INFO ] Deduced a trap composed of 23 places in 475 ms
[2020-06-05 01:31:21] [INFO ] Deduced a trap composed of 22 places in 489 ms
[2020-06-05 01:31:22] [INFO ] Deduced a trap composed of 25 places in 443 ms
[2020-06-05 01:31:22] [INFO ] Deduced a trap composed of 29 places in 415 ms
[2020-06-05 01:31:22] [INFO ] Deduced a trap composed of 21 places in 409 ms
[2020-06-05 01:31:23] [INFO ] Deduced a trap composed of 34 places in 789 ms
[2020-06-05 01:31:24] [INFO ] Deduced a trap composed of 21 places in 396 ms
[2020-06-05 01:31:24] [INFO ] Deduced a trap composed of 27 places in 419 ms
[2020-06-05 01:31:25] [INFO ] Deduced a trap composed of 19 places in 380 ms
[2020-06-05 01:31:25] [INFO ] Deduced a trap composed of 24 places in 387 ms
[2020-06-05 01:31:25] [INFO ] Deduced a trap composed of 18 places in 362 ms
[2020-06-05 01:31:26] [INFO ] Deduced a trap composed of 25 places in 387 ms
[2020-06-05 01:31:26] [INFO ] Deduced a trap composed of 30 places in 500 ms
[2020-06-05 01:31:27] [INFO ] Deduced a trap composed of 26 places in 400 ms
[2020-06-05 01:31:27] [INFO ] Deduced a trap composed of 30 places in 376 ms
[2020-06-05 01:31:28] [INFO ] Deduced a trap composed of 29 places in 498 ms
[2020-06-05 01:31:28] [INFO ] Deduced a trap composed of 34 places in 449 ms
[2020-06-05 01:31:29] [INFO ] Deduced a trap composed of 31 places in 356 ms
[2020-06-05 01:31:29] [INFO ] Deduced a trap composed of 28 places in 335 ms
[2020-06-05 01:31:30] [INFO ] Deduced a trap composed of 33 places in 345 ms
[2020-06-05 01:31:30] [INFO ] Deduced a trap composed of 31 places in 296 ms
[2020-06-05 01:31:30] [INFO ] Deduced a trap composed of 36 places in 308 ms
[2020-06-05 01:31:31] [INFO ] Deduced a trap composed of 29 places in 292 ms
[2020-06-05 01:31:31] [INFO ] Deduced a trap composed of 30 places in 317 ms
[2020-06-05 01:31:31] [INFO ] Deduced a trap composed of 32 places in 319 ms
[2020-06-05 01:31:32] [INFO ] Deduced a trap composed of 31 places in 297 ms
[2020-06-05 01:31:32] [INFO ] Deduced a trap composed of 37 places in 269 ms
[2020-06-05 01:31:32] [INFO ] Deduced a trap composed of 36 places in 329 ms
[2020-06-05 01:31:33] [INFO ] Deduced a trap composed of 33 places in 245 ms
[2020-06-05 01:31:33] [INFO ] Deduced a trap composed of 32 places in 237 ms
[2020-06-05 01:31:33] [INFO ] Deduced a trap composed of 30 places in 217 ms
[2020-06-05 01:31:33] [INFO ] Deduced a trap composed of 34 places in 228 ms
[2020-06-05 01:31:33] [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 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s177 s178 s179 s180 s181 s182 s183 s184 s188 s222 s223 s224 s225 s226 s227 s228) 0)") while checking expression at index 0
[2020-06-05 01:31:34] [INFO ] [Real]Absence check using 221 positive place invariants in 173 ms returned sat
[2020-06-05 01:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:31:37] [INFO ] [Real]Absence check using state equation in 3672 ms returned sat
[2020-06-05 01:31:38] [INFO ] Deduced a trap composed of 25 places in 579 ms
[2020-06-05 01:31:39] [INFO ] Deduced a trap composed of 23 places in 436 ms
[2020-06-05 01:31:39] [INFO ] Deduced a trap composed of 24 places in 536 ms
[2020-06-05 01:31:40] [INFO ] Deduced a trap composed of 33 places in 388 ms
[2020-06-05 01:31:40] [INFO ] Deduced a trap composed of 21 places in 413 ms
[2020-06-05 01:31:40] [INFO ] Deduced a trap composed of 29 places in 357 ms
[2020-06-05 01:31:41] [INFO ] Deduced a trap composed of 27 places in 443 ms
[2020-06-05 01:31:41] [INFO ] Deduced a trap composed of 21 places in 413 ms
[2020-06-05 01:31:42] [INFO ] Deduced a trap composed of 25 places in 359 ms
[2020-06-05 01:31:42] [INFO ] Deduced a trap composed of 21 places in 342 ms
[2020-06-05 01:31:43] [INFO ] Deduced a trap composed of 22 places in 311 ms
[2020-06-05 01:31:43] [INFO ] Deduced a trap composed of 45 places in 377 ms
[2020-06-05 01:31:43] [INFO ] Deduced a trap composed of 24 places in 302 ms
[2020-06-05 01:31:44] [INFO ] Deduced a trap composed of 34 places in 282 ms
[2020-06-05 01:31:44] [INFO ] Deduced a trap composed of 19 places in 307 ms
[2020-06-05 01:31:44] [INFO ] Deduced a trap composed of 30 places in 271 ms
[2020-06-05 01:31:45] [INFO ] Deduced a trap composed of 24 places in 271 ms
[2020-06-05 01:31:45] [INFO ] Deduced a trap composed of 27 places in 304 ms
[2020-06-05 01:31:45] [INFO ] Deduced a trap composed of 39 places in 358 ms
[2020-06-05 01:31:46] [INFO ] Deduced a trap composed of 29 places in 360 ms
[2020-06-05 01:31:46] [INFO ] Deduced a trap composed of 29 places in 343 ms
[2020-06-05 01:31:47] [INFO ] Deduced a trap composed of 27 places in 308 ms
[2020-06-05 01:31:47] [INFO ] Deduced a trap composed of 26 places in 364 ms
[2020-06-05 01:31:47] [INFO ] Deduced a trap composed of 30 places in 256 ms
[2020-06-05 01:31:48] [INFO ] Deduced a trap composed of 36 places in 307 ms
[2020-06-05 01:31:48] [INFO ] Deduced a trap composed of 35 places in 340 ms
[2020-06-05 01:31:48] [INFO ] Deduced a trap composed of 34 places in 329 ms
[2020-06-05 01:31:49] [INFO ] Deduced a trap composed of 35 places in 314 ms
[2020-06-05 01:31:49] [INFO ] Deduced a trap composed of 37 places in 248 ms
[2020-06-05 01:31:49] [INFO ] Deduced a trap composed of 25 places in 208 ms
[2020-06-05 01:31:50] [INFO ] Deduced a trap composed of 32 places in 277 ms
[2020-06-05 01:31:50] [INFO ] Deduced a trap composed of 30 places in 303 ms
[2020-06-05 01:31:50] [INFO ] Deduced a trap composed of 36 places in 281 ms
[2020-06-05 01:31:51] [INFO ] Deduced a trap composed of 32 places in 249 ms
[2020-06-05 01:31:51] [INFO ] Deduced a trap composed of 33 places in 246 ms
[2020-06-05 01:31:51] [INFO ] Deduced a trap composed of 28 places in 262 ms
[2020-06-05 01:31:52] [INFO ] Deduced a trap composed of 45 places in 242 ms
[2020-06-05 01:31:52] [INFO ] Deduced a trap composed of 42 places in 259 ms
[2020-06-05 01:31:52] [INFO ] Deduced a trap composed of 32 places in 216 ms
[2020-06-05 01:31:52] [INFO ] Deduced a trap composed of 28 places in 220 ms
[2020-06-05 01:31:53] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 15066 ms
[2020-06-05 01:31:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:31:53] [INFO ] [Nat]Absence check using 221 positive place invariants in 307 ms returned sat
[2020-06-05 01:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:31:57] [INFO ] [Nat]Absence check using state equation in 3794 ms returned sat
[2020-06-05 01:31:57] [INFO ] Deduced a trap composed of 19 places in 552 ms
[2020-06-05 01:31:58] [INFO ] Deduced a trap composed of 18 places in 469 ms
[2020-06-05 01:31:58] [INFO ] Deduced a trap composed of 37 places in 418 ms
[2020-06-05 01:31:59] [INFO ] Deduced a trap composed of 19 places in 372 ms
[2020-06-05 01:31:59] [INFO ] Deduced a trap composed of 29 places in 401 ms
[2020-06-05 01:32:00] [INFO ] Deduced a trap composed of 21 places in 360 ms
[2020-06-05 01:32:00] [INFO ] Deduced a trap composed of 24 places in 357 ms
[2020-06-05 01:32:00] [INFO ] Deduced a trap composed of 26 places in 353 ms
[2020-06-05 01:32:01] [INFO ] Deduced a trap composed of 34 places in 386 ms
[2020-06-05 01:32:01] [INFO ] Deduced a trap composed of 26 places in 360 ms
[2020-06-05 01:32:02] [INFO ] Deduced a trap composed of 13 places in 353 ms
[2020-06-05 01:32:02] [INFO ] Deduced a trap composed of 33 places in 347 ms
[2020-06-05 01:32:02] [INFO ] Deduced a trap composed of 29 places in 352 ms
[2020-06-05 01:32:03] [INFO ] Deduced a trap composed of 22 places in 345 ms
[2020-06-05 01:32:03] [INFO ] Deduced a trap composed of 20 places in 331 ms
[2020-06-05 01:32:04] [INFO ] Deduced a trap composed of 23 places in 351 ms
[2020-06-05 01:32:04] [INFO ] Deduced a trap composed of 21 places in 365 ms
[2020-06-05 01:32:04] [INFO ] Deduced a trap composed of 22 places in 408 ms
[2020-06-05 01:32:05] [INFO ] Deduced a trap composed of 23 places in 410 ms
[2020-06-05 01:32:05] [INFO ] Deduced a trap composed of 33 places in 401 ms
[2020-06-05 01:32:06] [INFO ] Deduced a trap composed of 27 places in 304 ms
[2020-06-05 01:32:06] [INFO ] Deduced a trap composed of 32 places in 385 ms
[2020-06-05 01:32:07] [INFO ] Deduced a trap composed of 28 places in 393 ms
[2020-06-05 01:32:07] [INFO ] Deduced a trap composed of 30 places in 411 ms
[2020-06-05 01:32:07] [INFO ] Deduced a trap composed of 28 places in 371 ms
[2020-06-05 01:32:08] [INFO ] Deduced a trap composed of 25 places in 376 ms
[2020-06-05 01:32:08] [INFO ] Deduced a trap composed of 32 places in 373 ms
[2020-06-05 01:32:09] [INFO ] Deduced a trap composed of 28 places in 376 ms
[2020-06-05 01:32:09] [INFO ] Deduced a trap composed of 29 places in 348 ms
[2020-06-05 01:32:10] [INFO ] Deduced a trap composed of 33 places in 346 ms
[2020-06-05 01:32:10] [INFO ] Deduced a trap composed of 27 places in 325 ms
[2020-06-05 01:32:10] [INFO ] Deduced a trap composed of 25 places in 279 ms
[2020-06-05 01:32:11] [INFO ] Deduced a trap composed of 30 places in 311 ms
[2020-06-05 01:32:11] [INFO ] Deduced a trap composed of 35 places in 320 ms
[2020-06-05 01:32:11] [INFO ] Deduced a trap composed of 33 places in 284 ms
[2020-06-05 01:32:12] [INFO ] Deduced a trap composed of 31 places in 255 ms
[2020-06-05 01:32:12] [INFO ] Deduced a trap composed of 32 places in 293 ms
[2020-06-05 01:32:12] [INFO ] Deduced a trap composed of 37 places in 276 ms
[2020-06-05 01:32:13] [INFO ] Deduced a trap composed of 34 places in 237 ms
[2020-06-05 01:32:13] [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 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s177 s178 s179 s180 s181 s182 s183 s184 s188 s222 s223 s224 s225 s226 s227 s228) 0)") while checking expression at index 1
[2020-06-05 01:32:13] [INFO ] [Real]Absence check using 221 positive place invariants in 246 ms returned sat
[2020-06-05 01:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:32:17] [INFO ] [Real]Absence check using state equation in 3843 ms returned sat
[2020-06-05 01:32:18] [INFO ] Deduced a trap composed of 21 places in 507 ms
[2020-06-05 01:32:18] [INFO ] Deduced a trap composed of 18 places in 508 ms
[2020-06-05 01:32:19] [INFO ] Deduced a trap composed of 20 places in 482 ms
[2020-06-05 01:32:19] [INFO ] Deduced a trap composed of 19 places in 546 ms
[2020-06-05 01:32:20] [INFO ] Deduced a trap composed of 21 places in 438 ms
[2020-06-05 01:32:20] [INFO ] Deduced a trap composed of 18 places in 476 ms
[2020-06-05 01:32:21] [INFO ] Deduced a trap composed of 27 places in 399 ms
[2020-06-05 01:32:21] [INFO ] Deduced a trap composed of 28 places in 398 ms
[2020-06-05 01:32:21] [INFO ] Deduced a trap composed of 25 places in 406 ms
[2020-06-05 01:32:22] [INFO ] Deduced a trap composed of 28 places in 419 ms
[2020-06-05 01:32:22] [INFO ] Deduced a trap composed of 23 places in 388 ms
[2020-06-05 01:32:23] [INFO ] Deduced a trap composed of 26 places in 393 ms
[2020-06-05 01:32:23] [INFO ] Deduced a trap composed of 31 places in 401 ms
[2020-06-05 01:32:24] [INFO ] Deduced a trap composed of 26 places in 325 ms
[2020-06-05 01:32:24] [INFO ] Deduced a trap composed of 40 places in 356 ms
[2020-06-05 01:32:24] [INFO ] Deduced a trap composed of 36 places in 304 ms
[2020-06-05 01:32:25] [INFO ] Deduced a trap composed of 34 places in 299 ms
[2020-06-05 01:32:25] [INFO ] Deduced a trap composed of 21 places in 338 ms
[2020-06-05 01:32:25] [INFO ] Deduced a trap composed of 27 places in 362 ms
[2020-06-05 01:32:26] [INFO ] Deduced a trap composed of 22 places in 285 ms
[2020-06-05 01:32:26] [INFO ] Deduced a trap composed of 31 places in 278 ms
[2020-06-05 01:32:26] [INFO ] Deduced a trap composed of 43 places in 295 ms
[2020-06-05 01:32:27] [INFO ] Deduced a trap composed of 32 places in 283 ms
[2020-06-05 01:32:27] [INFO ] Deduced a trap composed of 39 places in 289 ms
[2020-06-05 01:32:27] [INFO ] Deduced a trap composed of 34 places in 309 ms
[2020-06-05 01:32:28] [INFO ] Deduced a trap composed of 37 places in 375 ms
[2020-06-05 01:32:28] [INFO ] Deduced a trap composed of 29 places in 286 ms
[2020-06-05 01:32:29] [INFO ] Deduced a trap composed of 30 places in 370 ms
[2020-06-05 01:32:29] [INFO ] Deduced a trap composed of 34 places in 333 ms
[2020-06-05 01:32:29] [INFO ] Deduced a trap composed of 36 places in 305 ms
[2020-06-05 01:32:30] [INFO ] Deduced a trap composed of 37 places in 287 ms
[2020-06-05 01:32:30] [INFO ] Deduced a trap composed of 38 places in 227 ms
[2020-06-05 01:32:30] [INFO ] Deduced a trap composed of 35 places in 237 ms
[2020-06-05 01:32:31] [INFO ] Deduced a trap composed of 36 places in 314 ms
[2020-06-05 01:32:31] [INFO ] Deduced a trap composed of 34 places in 307 ms
[2020-06-05 01:32:31] [INFO ] Deduced a trap composed of 36 places in 264 ms
[2020-06-05 01:32:32] [INFO ] Deduced a trap composed of 33 places in 243 ms
[2020-06-05 01:32:32] [INFO ] Deduced a trap composed of 30 places in 192 ms
[2020-06-05 01:32:32] [INFO ] Deduced a trap composed of 32 places in 256 ms
[2020-06-05 01:32:32] [INFO ] Deduced a trap composed of 34 places in 183 ms
[2020-06-05 01:32:32] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 15486 ms
[2020-06-05 01:32:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:32:33] [INFO ] [Nat]Absence check using 221 positive place invariants in 199 ms returned sat
[2020-06-05 01:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:32:37] [INFO ] [Nat]Absence check using state equation in 3704 ms returned sat
[2020-06-05 01:32:37] [INFO ] Deduced a trap composed of 25 places in 657 ms
[2020-06-05 01:32:38] [INFO ] Deduced a trap composed of 19 places in 504 ms
[2020-06-05 01:32:38] [INFO ] Deduced a trap composed of 20 places in 417 ms
[2020-06-05 01:32:39] [INFO ] Deduced a trap composed of 28 places in 456 ms
[2020-06-05 01:32:39] [INFO ] Deduced a trap composed of 24 places in 519 ms
[2020-06-05 01:32:40] [INFO ] Deduced a trap composed of 19 places in 375 ms
[2020-06-05 01:32:40] [INFO ] Deduced a trap composed of 28 places in 395 ms
[2020-06-05 01:32:41] [INFO ] Deduced a trap composed of 18 places in 361 ms
[2020-06-05 01:32:41] [INFO ] Deduced a trap composed of 22 places in 360 ms
[2020-06-05 01:32:41] [INFO ] Deduced a trap composed of 25 places in 358 ms
[2020-06-05 01:32:42] [INFO ] Deduced a trap composed of 24 places in 354 ms
[2020-06-05 01:32:42] [INFO ] Deduced a trap composed of 33 places in 342 ms
[2020-06-05 01:32:43] [INFO ] Deduced a trap composed of 21 places in 449 ms
[2020-06-05 01:32:43] [INFO ] Deduced a trap composed of 24 places in 322 ms
[2020-06-05 01:32:43] [INFO ] Deduced a trap composed of 27 places in 388 ms
[2020-06-05 01:32:44] [INFO ] Deduced a trap composed of 35 places in 329 ms
[2020-06-05 01:32:44] [INFO ] Deduced a trap composed of 28 places in 309 ms
[2020-06-05 01:32:44] [INFO ] Deduced a trap composed of 29 places in 305 ms
[2020-06-05 01:32:45] [INFO ] Deduced a trap composed of 35 places in 322 ms
[2020-06-05 01:32:45] [INFO ] Deduced a trap composed of 33 places in 304 ms
[2020-06-05 01:32:45] [INFO ] Deduced a trap composed of 28 places in 292 ms
[2020-06-05 01:32:46] [INFO ] Deduced a trap composed of 30 places in 317 ms
[2020-06-05 01:32:46] [INFO ] Deduced a trap composed of 28 places in 330 ms
[2020-06-05 01:32:47] [INFO ] Deduced a trap composed of 26 places in 304 ms
[2020-06-05 01:32:47] [INFO ] Deduced a trap composed of 32 places in 284 ms
[2020-06-05 01:32:47] [INFO ] Deduced a trap composed of 30 places in 292 ms
[2020-06-05 01:32:48] [INFO ] Deduced a trap composed of 34 places in 260 ms
[2020-06-05 01:32:48] [INFO ] Deduced a trap composed of 34 places in 282 ms
[2020-06-05 01:32:48] [INFO ] Deduced a trap composed of 45 places in 264 ms
[2020-06-05 01:32:48] [INFO ] Deduced a trap composed of 36 places in 255 ms
[2020-06-05 01:32:49] [INFO ] Deduced a trap composed of 36 places in 255 ms
[2020-06-05 01:32:49] [INFO ] Deduced a trap composed of 37 places in 224 ms
[2020-06-05 01:32:49] [INFO ] Deduced a trap composed of 30 places in 222 ms
[2020-06-05 01:32:50] [INFO ] Deduced a trap composed of 36 places in 214 ms
[2020-06-05 01:32:50] [INFO ] Deduced a trap composed of 34 places in 206 ms
[2020-06-05 01:32:50] [INFO ] Deduced a trap composed of 34 places in 269 ms
[2020-06-05 01:32:50] [INFO ] Deduced a trap composed of 33 places in 194 ms
[2020-06-05 01:32:51] [INFO ] Deduced a trap composed of 26 places in 165 ms
[2020-06-05 01:32:51] [INFO ] Deduced a trap composed of 39 places in 158 ms
[2020-06-05 01:32:51] [INFO ] Deduced a trap composed of 36 places in 149 ms
[2020-06-05 01:32:51] [INFO ] Deduced a trap composed of 37 places in 137 ms
[2020-06-05 01:32:51] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 14626 ms
[2020-06-05 01:32:51] [INFO ] Computed and/alt/rep : 1422/2123/1422 causal constraints in 78 ms.
[2020-06-05 01:32:52] [INFO ] Added : 90 causal constraints over 18 iterations in 1335 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 01:32:53] [INFO ] [Real]Absence check using 221 positive place invariants in 229 ms returned sat
[2020-06-05 01:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:32:57] [INFO ] [Real]Absence check using state equation in 3723 ms returned sat
[2020-06-05 01:32:57] [INFO ] Deduced a trap composed of 24 places in 551 ms
[2020-06-05 01:32:58] [INFO ] Deduced a trap composed of 19 places in 529 ms
[2020-06-05 01:32:58] [INFO ] Deduced a trap composed of 21 places in 504 ms
[2020-06-05 01:32:59] [INFO ] Deduced a trap composed of 28 places in 508 ms
[2020-06-05 01:32:59] [INFO ] Deduced a trap composed of 33 places in 497 ms
[2020-06-05 01:33:00] [INFO ] Deduced a trap composed of 29 places in 537 ms
[2020-06-05 01:33:01] [INFO ] Deduced a trap composed of 29 places in 460 ms
[2020-06-05 01:33:01] [INFO ] Deduced a trap composed of 24 places in 480 ms
[2020-06-05 01:33:02] [INFO ] Deduced a trap composed of 27 places in 435 ms
[2020-06-05 01:33:02] [INFO ] Deduced a trap composed of 37 places in 487 ms
[2020-06-05 01:33:03] [INFO ] Deduced a trap composed of 25 places in 490 ms
[2020-06-05 01:33:03] [INFO ] Deduced a trap composed of 32 places in 485 ms
[2020-06-05 01:33:04] [INFO ] Deduced a trap composed of 27 places in 442 ms
[2020-06-05 01:33:04] [INFO ] Deduced a trap composed of 26 places in 445 ms
[2020-06-05 01:33:05] [INFO ] Deduced a trap composed of 26 places in 414 ms
[2020-06-05 01:33:05] [INFO ] Deduced a trap composed of 22 places in 402 ms
[2020-06-05 01:33:05] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 8380 ms
[2020-06-05 01:33:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:33:05] [INFO ] [Nat]Absence check using 221 positive place invariants in 182 ms returned sat
[2020-06-05 01:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:33:09] [INFO ] [Nat]Absence check using state equation in 3549 ms returned sat
[2020-06-05 01:33:10] [INFO ] Deduced a trap composed of 25 places in 580 ms
[2020-06-05 01:33:10] [INFO ] Deduced a trap composed of 15 places in 585 ms
[2020-06-05 01:33:11] [INFO ] Deduced a trap composed of 30 places in 579 ms
[2020-06-05 01:33:11] [INFO ] Deduced a trap composed of 23 places in 580 ms
[2020-06-05 01:33:12] [INFO ] Deduced a trap composed of 21 places in 700 ms
[2020-06-05 01:33:13] [INFO ] Deduced a trap composed of 21 places in 604 ms
[2020-06-05 01:33:14] [INFO ] Deduced a trap composed of 22 places in 740 ms
[2020-06-05 01:33:14] [INFO ] Deduced a trap composed of 17 places in 544 ms
[2020-06-05 01:33:15] [INFO ] Deduced a trap composed of 28 places in 538 ms
[2020-06-05 01:33:15] [INFO ] Deduced a trap composed of 25 places in 537 ms
[2020-06-05 01:33:16] [INFO ] Deduced a trap composed of 24 places in 517 ms
[2020-06-05 01:33:16] [INFO ] Deduced a trap composed of 21 places in 511 ms
[2020-06-05 01:33:17] [INFO ] Deduced a trap composed of 38 places in 526 ms
[2020-06-05 01:33:18] [INFO ] Deduced a trap composed of 31 places in 527 ms
[2020-06-05 01:33:18] [INFO ] Deduced a trap composed of 27 places in 552 ms
[2020-06-05 01:33:19] [INFO ] Deduced a trap composed of 21 places in 573 ms
[2020-06-05 01:33:19] [INFO ] Deduced a trap composed of 29 places in 594 ms
[2020-06-05 01:33:20] [INFO ] Deduced a trap composed of 27 places in 575 ms
[2020-06-05 01:33:21] [INFO ] Deduced a trap composed of 34 places in 628 ms
[2020-06-05 01:33:21] [INFO ] Deduced a trap composed of 26 places in 537 ms
[2020-06-05 01:33:22] [INFO ] Deduced a trap composed of 25 places in 491 ms
[2020-06-05 01:33:22] [INFO ] Deduced a trap composed of 23 places in 435 ms
[2020-06-05 01:33:23] [INFO ] Deduced a trap composed of 28 places in 392 ms
[2020-06-05 01:33:23] [INFO ] Deduced a trap composed of 23 places in 440 ms
[2020-06-05 01:33:24] [INFO ] Deduced a trap composed of 32 places in 440 ms
[2020-06-05 01:33:24] [INFO ] Deduced a trap composed of 30 places in 476 ms
[2020-06-05 01:33:25] [INFO ] Deduced a trap composed of 29 places in 471 ms
[2020-06-05 01:33:25] [INFO ] Deduced a trap composed of 31 places in 447 ms
[2020-06-05 01:33: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 s8 s9 s10 s716 s717 s718 s719 s720 s721 s722 s723 s727 s729 s730 s749 s750 s751 s752 s753 s754 s755 s756 s757) 0)") while checking expression at index 3
[2020-06-05 01:33:26] [INFO ] [Real]Absence check using 221 positive place invariants in 183 ms returned sat
[2020-06-05 01:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:33:29] [INFO ] [Real]Absence check using state equation in 3887 ms returned sat
[2020-06-05 01:33:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:33:30] [INFO ] [Nat]Absence check using 221 positive place invariants in 221 ms returned sat
[2020-06-05 01:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:33:34] [INFO ] [Nat]Absence check using state equation in 3796 ms returned sat
[2020-06-05 01:33:34] [INFO ] Deduced a trap composed of 21 places in 559 ms
[2020-06-05 01:33:35] [INFO ] Deduced a trap composed of 29 places in 575 ms
[2020-06-05 01:33:35] [INFO ] Deduced a trap composed of 24 places in 457 ms
[2020-06-05 01:33:36] [INFO ] Deduced a trap composed of 28 places in 561 ms
[2020-06-05 01:33:37] [INFO ] Deduced a trap composed of 20 places in 521 ms
[2020-06-05 01:33:37] [INFO ] Deduced a trap composed of 20 places in 402 ms
[2020-06-05 01:33:37] [INFO ] Deduced a trap composed of 25 places in 394 ms
[2020-06-05 01:33:38] [INFO ] Deduced a trap composed of 15 places in 363 ms
[2020-06-05 01:33:38] [INFO ] Deduced a trap composed of 19 places in 347 ms
[2020-06-05 01:33:39] [INFO ] Deduced a trap composed of 25 places in 451 ms
[2020-06-05 01:33:39] [INFO ] Deduced a trap composed of 38 places in 442 ms
[2020-06-05 01:33:40] [INFO ] Deduced a trap composed of 26 places in 485 ms
[2020-06-05 01:33:40] [INFO ] Deduced a trap composed of 26 places in 461 ms
[2020-06-05 01:33:41] [INFO ] Deduced a trap composed of 28 places in 394 ms
[2020-06-05 01:33:41] [INFO ] Deduced a trap composed of 23 places in 335 ms
[2020-06-05 01:33:41] [INFO ] Deduced a trap composed of 29 places in 402 ms
[2020-06-05 01:33:42] [INFO ] Deduced a trap composed of 25 places in 346 ms
[2020-06-05 01:33:42] [INFO ] Deduced a trap composed of 21 places in 399 ms
[2020-06-05 01:33:43] [INFO ] Deduced a trap composed of 22 places in 324 ms
[2020-06-05 01:33:43] [INFO ] Deduced a trap composed of 23 places in 399 ms
[2020-06-05 01:33:44] [INFO ] Deduced a trap composed of 20 places in 361 ms
[2020-06-05 01:33:44] [INFO ] Deduced a trap composed of 34 places in 268 ms
[2020-06-05 01:33:44] [INFO ] Deduced a trap composed of 38 places in 251 ms
[2020-06-05 01:33:44] [INFO ] Deduced a trap composed of 32 places in 277 ms
[2020-06-05 01:33:45] [INFO ] Deduced a trap composed of 32 places in 257 ms
[2020-06-05 01:33:45] [INFO ] Deduced a trap composed of 34 places in 219 ms
[2020-06-05 01:33:45] [INFO ] Deduced a trap composed of 32 places in 216 ms
[2020-06-05 01:33:46] [INFO ] Deduced a trap composed of 27 places in 253 ms
[2020-06-05 01:33:46] [INFO ] Deduced a trap composed of 33 places in 296 ms
[2020-06-05 01:33:46] [INFO ] Deduced a trap composed of 34 places in 212 ms
[2020-06-05 01:33:46] [INFO ] Deduced a trap composed of 36 places in 265 ms
[2020-06-05 01:33:47] [INFO ] Deduced a trap composed of 30 places in 197 ms
[2020-06-05 01:33:47] [INFO ] Deduced a trap composed of 33 places in 221 ms
[2020-06-05 01:33:47] [INFO ] Deduced a trap composed of 23 places in 204 ms
[2020-06-05 01:33:47] [INFO ] Deduced a trap composed of 29 places in 193 ms
[2020-06-05 01:33:48] [INFO ] Deduced a trap composed of 29 places in 217 ms
[2020-06-05 01:33:48] [INFO ] Deduced a trap composed of 33 places in 165 ms
[2020-06-05 01:33:48] [INFO ] Deduced a trap composed of 26 places in 163 ms
[2020-06-05 01:33:48] [INFO ] Deduced a trap composed of 24 places in 225 ms
[2020-06-05 01:33:49] [INFO ] Deduced a trap composed of 37 places in 219 ms
[2020-06-05 01:33:49] [INFO ] Deduced a trap composed of 36 places in 150 ms
[2020-06-05 01:33:49] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 15235 ms
[2020-06-05 01:33:49] [INFO ] Computed and/alt/rep : 1422/2123/1422 causal constraints in 58 ms.
[2020-06-05 01:33:49] [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 (=> (> t59 0) (and (and (> t1249 0) (< o1249 o59)) (and (> t1244 0) (< o1244 o59))))") while checking expression at index 4
[2020-06-05 01:33:50] [INFO ] [Real]Absence check using 221 positive place invariants in 237 ms returned sat
[2020-06-05 01:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:33:54] [INFO ] [Real]Absence check using state equation in 4147 ms returned sat
[2020-06-05 01:33:55] [INFO ] Deduced a trap composed of 23 places in 599 ms
[2020-06-05 01:33:55] [INFO ] Deduced a trap composed of 20 places in 506 ms
[2020-06-05 01:33:56] [INFO ] Deduced a trap composed of 23 places in 446 ms
[2020-06-05 01:33:56] [INFO ] Deduced a trap composed of 16 places in 528 ms
[2020-06-05 01:33:57] [INFO ] Deduced a trap composed of 23 places in 516 ms
[2020-06-05 01:33:57] [INFO ] Deduced a trap composed of 29 places in 449 ms
[2020-06-05 01:33:58] [INFO ] Deduced a trap composed of 25 places in 442 ms
[2020-06-05 01:33:58] [INFO ] Deduced a trap composed of 21 places in 475 ms
[2020-06-05 01:33:59] [INFO ] Deduced a trap composed of 19 places in 532 ms
[2020-06-05 01:33:59] [INFO ] Deduced a trap composed of 27 places in 407 ms
[2020-06-05 01:34:00] [INFO ] Deduced a trap composed of 30 places in 538 ms
[2020-06-05 01:34:01] [INFO ] Deduced a trap composed of 46 places in 533 ms
[2020-06-05 01:34:01] [INFO ] Deduced a trap composed of 25 places in 473 ms
[2020-06-05 01:34:02] [INFO ] Deduced a trap composed of 19 places in 440 ms
[2020-06-05 01:34:02] [INFO ] Deduced a trap composed of 23 places in 358 ms
[2020-06-05 01:34:03] [INFO ] Deduced a trap composed of 38 places in 409 ms
[2020-06-05 01:34:03] [INFO ] Deduced a trap composed of 29 places in 376 ms
[2020-06-05 01:34:03] [INFO ] Deduced a trap composed of 32 places in 420 ms
[2020-06-05 01:34:04] [INFO ] Deduced a trap composed of 35 places in 386 ms
[2020-06-05 01:34:04] [INFO ] Deduced a trap composed of 29 places in 333 ms
[2020-06-05 01:34:05] [INFO ] Deduced a trap composed of 25 places in 399 ms
[2020-06-05 01:34:05] [INFO ] Deduced a trap composed of 34 places in 479 ms
[2020-06-05 01:34:06] [INFO ] Deduced a trap composed of 25 places in 383 ms
[2020-06-05 01:34:06] [INFO ] Deduced a trap composed of 29 places in 342 ms
[2020-06-05 01:34:06] [INFO ] Deduced a trap composed of 29 places in 382 ms
[2020-06-05 01:34:07] [INFO ] Deduced a trap composed of 26 places in 268 ms
[2020-06-05 01:34:07] [INFO ] Deduced a trap composed of 31 places in 277 ms
[2020-06-05 01:34:07] [INFO ] Deduced a trap composed of 30 places in 338 ms
[2020-06-05 01:34:08] [INFO ] Deduced a trap composed of 33 places in 357 ms
[2020-06-05 01:34:08] [INFO ] Deduced a trap composed of 32 places in 256 ms
[2020-06-05 01:34:09] [INFO ] Deduced a trap composed of 36 places in 303 ms
[2020-06-05 01:34:09] [INFO ] Deduced a trap composed of 36 places in 292 ms
[2020-06-05 01:34:09] [INFO ] Deduced a trap composed of 35 places in 310 ms
[2020-06-05 01:34:10] [INFO ] Deduced a trap composed of 33 places in 328 ms
[2020-06-05 01:34:10] [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 s8 s9 s10 s11 s12 s13 s14 s15 s16 s254 s255 s256 s257 s258 s259 s260 s261 s265 s299 s300 s301 s302 s303 s304 s305) 0)") while checking expression at index 5
[2020-06-05 01:34:10] [INFO ] [Real]Absence check using 221 positive place invariants in 236 ms returned sat
[2020-06-05 01:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:14] [INFO ] [Real]Absence check using state equation in 4159 ms returned sat
[2020-06-05 01:34:15] [INFO ] Deduced a trap composed of 19 places in 527 ms
[2020-06-05 01:34:15] [INFO ] Deduced a trap composed of 20 places in 399 ms
[2020-06-05 01:34:16] [INFO ] Deduced a trap composed of 31 places in 462 ms
[2020-06-05 01:34:16] [INFO ] Deduced a trap composed of 19 places in 419 ms
[2020-06-05 01:34:17] [INFO ] Deduced a trap composed of 21 places in 481 ms
[2020-06-05 01:34:17] [INFO ] Deduced a trap composed of 34 places in 492 ms
[2020-06-05 01:34:18] [INFO ] Deduced a trap composed of 23 places in 376 ms
[2020-06-05 01:34:18] [INFO ] Deduced a trap composed of 25 places in 412 ms
[2020-06-05 01:34:19] [INFO ] Deduced a trap composed of 23 places in 414 ms
[2020-06-05 01:34:19] [INFO ] Deduced a trap composed of 16 places in 427 ms
[2020-06-05 01:34:20] [INFO ] Deduced a trap composed of 29 places in 503 ms
[2020-06-05 01:34:20] [INFO ] Deduced a trap composed of 25 places in 528 ms
[2020-06-05 01:34:21] [INFO ] Deduced a trap composed of 33 places in 484 ms
[2020-06-05 01:34:21] [INFO ] Deduced a trap composed of 25 places in 423 ms
[2020-06-05 01:34:22] [INFO ] Deduced a trap composed of 25 places in 457 ms
[2020-06-05 01:34:22] [INFO ] Deduced a trap composed of 34 places in 439 ms
[2020-06-05 01:34:23] [INFO ] Deduced a trap composed of 30 places in 445 ms
[2020-06-05 01:34:23] [INFO ] Deduced a trap composed of 34 places in 426 ms
[2020-06-05 01:34:24] [INFO ] Deduced a trap composed of 38 places in 429 ms
[2020-06-05 01:34:24] [INFO ] Deduced a trap composed of 29 places in 427 ms
[2020-06-05 01:34:25] [INFO ] Deduced a trap composed of 36 places in 356 ms
[2020-06-05 01:34:25] [INFO ] Deduced a trap composed of 33 places in 355 ms
[2020-06-05 01:34:25] [INFO ] Deduced a trap composed of 31 places in 278 ms
[2020-06-05 01:34:26] [INFO ] Deduced a trap composed of 38 places in 321 ms
[2020-06-05 01:34:26] [INFO ] Deduced a trap composed of 32 places in 322 ms
[2020-06-05 01:34:27] [INFO ] Deduced a trap composed of 31 places in 310 ms
[2020-06-05 01:34:27] [INFO ] Deduced a trap composed of 32 places in 319 ms
[2020-06-05 01:34:27] [INFO ] Deduced a trap composed of 34 places in 297 ms
[2020-06-05 01:34:28] [INFO ] Deduced a trap composed of 33 places in 305 ms
[2020-06-05 01:34:28] [INFO ] Deduced a trap composed of 33 places in 213 ms
[2020-06-05 01:34:28] [INFO ] Deduced a trap composed of 32 places in 204 ms
[2020-06-05 01:34:28] [INFO ] Deduced a trap composed of 31 places in 215 ms
[2020-06-05 01:34:29] [INFO ] Deduced a trap composed of 27 places in 226 ms
[2020-06-05 01:34:29] [INFO ] Deduced a trap composed of 29 places in 253 ms
[2020-06-05 01:34:29] [INFO ] Deduced a trap composed of 33 places in 216 ms
[2020-06-05 01:34:29] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 15002 ms
[2020-06-05 01:34:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:34:30] [INFO ] [Nat]Absence check using 221 positive place invariants in 288 ms returned sat
[2020-06-05 01:34:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:34] [INFO ] [Nat]Absence check using state equation in 3866 ms returned sat
[2020-06-05 01:34:34] [INFO ] Deduced a trap composed of 23 places in 610 ms
[2020-06-05 01:34:35] [INFO ] Deduced a trap composed of 24 places in 519 ms
[2020-06-05 01:34:35] [INFO ] Deduced a trap composed of 19 places in 507 ms
[2020-06-05 01:34:36] [INFO ] Deduced a trap composed of 28 places in 423 ms
[2020-06-05 01:34:37] [INFO ] Deduced a trap composed of 25 places in 565 ms
[2020-06-05 01:34:37] [INFO ] Deduced a trap composed of 25 places in 566 ms
[2020-06-05 01:34:38] [INFO ] Deduced a trap composed of 21 places in 438 ms
[2020-06-05 01:34:38] [INFO ] Deduced a trap composed of 22 places in 426 ms
[2020-06-05 01:34:39] [INFO ] Deduced a trap composed of 30 places in 422 ms
[2020-06-05 01:34:39] [INFO ] Deduced a trap composed of 15 places in 503 ms
[2020-06-05 01:34:40] [INFO ] Deduced a trap composed of 28 places in 560 ms
[2020-06-05 01:34:40] [INFO ] Deduced a trap composed of 30 places in 535 ms
[2020-06-05 01:34:41] [INFO ] Deduced a trap composed of 25 places in 493 ms
[2020-06-05 01:34:41] [INFO ] Deduced a trap composed of 22 places in 374 ms
[2020-06-05 01:34:42] [INFO ] Deduced a trap composed of 36 places in 396 ms
[2020-06-05 01:34:42] [INFO ] Deduced a trap composed of 31 places in 541 ms
[2020-06-05 01:34:43] [INFO ] Deduced a trap composed of 28 places in 513 ms
[2020-06-05 01:34:43] [INFO ] Deduced a trap composed of 22 places in 528 ms
[2020-06-05 01:34:44] [INFO ] Deduced a trap composed of 33 places in 513 ms
[2020-06-05 01:34:45] [INFO ] Deduced a trap composed of 43 places in 503 ms
[2020-06-05 01:34:45] [INFO ] Deduced a trap composed of 27 places in 478 ms
[2020-06-05 01:34:46] [INFO ] Deduced a trap composed of 34 places in 479 ms
[2020-06-05 01:34:46] [INFO ] Deduced a trap composed of 29 places in 443 ms
[2020-06-05 01:34:46] [INFO ] Deduced a trap composed of 29 places in 321 ms
[2020-06-05 01:34:47] [INFO ] Deduced a trap composed of 27 places in 364 ms
[2020-06-05 01:34:47] [INFO ] Deduced a trap composed of 33 places in 303 ms
[2020-06-05 01:34:48] [INFO ] Deduced a trap composed of 33 places in 359 ms
[2020-06-05 01:34:48] [INFO ] Deduced a trap composed of 33 places in 396 ms
[2020-06-05 01:34:48] [INFO ] Deduced a trap composed of 27 places in 347 ms
[2020-06-05 01:34:49] [INFO ] Deduced a trap composed of 30 places in 314 ms
[2020-06-05 01:34:49] [INFO ] Deduced a trap composed of 25 places in 349 ms
[2020-06-05 01:34:50] [INFO ] Deduced a trap composed of 29 places in 337 ms
[2020-06-05 01:34:50] [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 s881 s882 s883 s884 s885 s904 s905 s906 s907 s908 s909 s910 s911 s947 s948 s949 s950 s951 s952 s953 s965) 0)") while checking expression at index 6
[2020-06-05 01:34:50] [INFO ] [Real]Absence check using 221 positive place invariants in 168 ms returned sat
[2020-06-05 01:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:34:54] [INFO ] [Real]Absence check using state equation in 3791 ms returned sat
[2020-06-05 01:34:54] [INFO ] Deduced a trap composed of 21 places in 494 ms
[2020-06-05 01:34:55] [INFO ] Deduced a trap composed of 29 places in 593 ms
[2020-06-05 01:34:56] [INFO ] Deduced a trap composed of 19 places in 555 ms
[2020-06-05 01:34:56] [INFO ] Deduced a trap composed of 23 places in 514 ms
[2020-06-05 01:34:57] [INFO ] Deduced a trap composed of 23 places in 579 ms
[2020-06-05 01:34:57] [INFO ] Deduced a trap composed of 24 places in 444 ms
[2020-06-05 01:34:58] [INFO ] Deduced a trap composed of 23 places in 438 ms
[2020-06-05 01:34:58] [INFO ] Deduced a trap composed of 26 places in 406 ms
[2020-06-05 01:34:59] [INFO ] Deduced a trap composed of 21 places in 531 ms
[2020-06-05 01:34:59] [INFO ] Deduced a trap composed of 29 places in 486 ms
[2020-06-05 01:35:00] [INFO ] Deduced a trap composed of 24 places in 494 ms
[2020-06-05 01:35:00] [INFO ] Deduced a trap composed of 24 places in 426 ms
[2020-06-05 01:35:01] [INFO ] Deduced a trap composed of 21 places in 390 ms
[2020-06-05 01:35:01] [INFO ] Deduced a trap composed of 35 places in 355 ms
[2020-06-05 01:35:02] [INFO ] Deduced a trap composed of 33 places in 470 ms
[2020-06-05 01:35:02] [INFO ] Deduced a trap composed of 29 places in 468 ms
[2020-06-05 01:35:03] [INFO ] Deduced a trap composed of 34 places in 415 ms
[2020-06-05 01:35:03] [INFO ] Deduced a trap composed of 26 places in 355 ms
[2020-06-05 01:35:03] [INFO ] Deduced a trap composed of 25 places in 396 ms
[2020-06-05 01:35:04] [INFO ] Deduced a trap composed of 32 places in 387 ms
[2020-06-05 01:35:04] [INFO ] Deduced a trap composed of 35 places in 412 ms
[2020-06-05 01:35:05] [INFO ] Deduced a trap composed of 27 places in 394 ms
[2020-06-05 01:35:05] [INFO ] Deduced a trap composed of 34 places in 353 ms
[2020-06-05 01:35:06] [INFO ] Deduced a trap composed of 29 places in 352 ms
[2020-06-05 01:35:06] [INFO ] Deduced a trap composed of 26 places in 376 ms
[2020-06-05 01:35:06] [INFO ] Deduced a trap composed of 37 places in 361 ms
[2020-06-05 01:35:07] [INFO ] Deduced a trap composed of 38 places in 248 ms
[2020-06-05 01:35:07] [INFO ] Deduced a trap composed of 36 places in 222 ms
[2020-06-05 01:35:07] [INFO ] Deduced a trap composed of 33 places in 286 ms
[2020-06-05 01:35:08] [INFO ] Deduced a trap composed of 36 places in 238 ms
[2020-06-05 01:35:08] [INFO ] Deduced a trap composed of 39 places in 274 ms
[2020-06-05 01:35:08] [INFO ] Deduced a trap composed of 36 places in 285 ms
[2020-06-05 01:35:09] [INFO ] Deduced a trap composed of 40 places in 267 ms
[2020-06-05 01:35:09] [INFO ] Deduced a trap composed of 35 places in 258 ms
[2020-06-05 01:35:09] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 15242 ms
[2020-06-05 01:35:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:35:10] [INFO ] [Nat]Absence check using 221 positive place invariants in 285 ms returned sat
[2020-06-05 01:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:13] [INFO ] [Nat]Absence check using state equation in 3627 ms returned sat
[2020-06-05 01:35:14] [INFO ] Deduced a trap composed of 21 places in 547 ms
[2020-06-05 01:35:14] [INFO ] Deduced a trap composed of 25 places in 546 ms
[2020-06-05 01:35:15] [INFO ] Deduced a trap composed of 16 places in 404 ms
[2020-06-05 01:35:15] [INFO ] Deduced a trap composed of 22 places in 486 ms
[2020-06-05 01:35:16] [INFO ] Deduced a trap composed of 21 places in 415 ms
[2020-06-05 01:35:16] [INFO ] Deduced a trap composed of 25 places in 383 ms
[2020-06-05 01:35:17] [INFO ] Deduced a trap composed of 25 places in 451 ms
[2020-06-05 01:35:17] [INFO ] Deduced a trap composed of 34 places in 496 ms
[2020-06-05 01:35:18] [INFO ] Deduced a trap composed of 26 places in 354 ms
[2020-06-05 01:35:18] [INFO ] Deduced a trap composed of 25 places in 350 ms
[2020-06-05 01:35:19] [INFO ] Deduced a trap composed of 30 places in 458 ms
[2020-06-05 01:35:19] [INFO ] Deduced a trap composed of 24 places in 331 ms
[2020-06-05 01:35:19] [INFO ] Deduced a trap composed of 29 places in 402 ms
[2020-06-05 01:35:20] [INFO ] Deduced a trap composed of 23 places in 312 ms
[2020-06-05 01:35:20] [INFO ] Deduced a trap composed of 29 places in 297 ms
[2020-06-05 01:35:20] [INFO ] Deduced a trap composed of 20 places in 285 ms
[2020-06-05 01:35:21] [INFO ] Deduced a trap composed of 37 places in 393 ms
[2020-06-05 01:35:21] [INFO ] Deduced a trap composed of 25 places in 289 ms
[2020-06-05 01:35:21] [INFO ] Deduced a trap composed of 32 places in 292 ms
[2020-06-05 01:35:22] [INFO ] Deduced a trap composed of 20 places in 353 ms
[2020-06-05 01:35:22] [INFO ] Deduced a trap composed of 34 places in 299 ms
[2020-06-05 01:35:23] [INFO ] Deduced a trap composed of 32 places in 336 ms
[2020-06-05 01:35:23] [INFO ] Deduced a trap composed of 22 places in 288 ms
[2020-06-05 01:35:23] [INFO ] Deduced a trap composed of 23 places in 244 ms
[2020-06-05 01:35:24] [INFO ] Deduced a trap composed of 36 places in 292 ms
[2020-06-05 01:35:24] [INFO ] Deduced a trap composed of 40 places in 270 ms
[2020-06-05 01:35:24] [INFO ] Deduced a trap composed of 27 places in 200 ms
[2020-06-05 01:35:24] [INFO ] Deduced a trap composed of 34 places in 242 ms
[2020-06-05 01:35:25] [INFO ] Deduced a trap composed of 33 places in 181 ms
[2020-06-05 01:35:25] [INFO ] Deduced a trap composed of 33 places in 207 ms
[2020-06-05 01:35:25] [INFO ] Deduced a trap composed of 35 places in 219 ms
[2020-06-05 01:35:25] [INFO ] Deduced a trap composed of 39 places in 166 ms
[2020-06-05 01:35:26] [INFO ] Deduced a trap composed of 30 places in 187 ms
[2020-06-05 01:35:26] [INFO ] Deduced a trap composed of 34 places in 151 ms
[2020-06-05 01:35:26] [INFO ] Deduced a trap composed of 36 places in 142 ms
[2020-06-05 01:35:26] [INFO ] Deduced a trap composed of 36 places in 149 ms
[2020-06-05 01:35:26] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 12928 ms
[2020-06-05 01:35:26] [INFO ] Computed and/alt/rep : 1422/2123/1422 causal constraints in 58 ms.
[2020-06-05 01:35:29] [INFO ] Added : 180 causal constraints over 36 iterations in 2967 ms. Result :(error "Failed to check-sat")
[2020-06-05 01:35:29] [INFO ] [Real]Absence check using 221 positive place invariants in 203 ms returned sat
[2020-06-05 01:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:33] [INFO ] [Real]Absence check using state equation in 3774 ms returned sat
[2020-06-05 01:35:34] [INFO ] Deduced a trap composed of 23 places in 426 ms
[2020-06-05 01:35:34] [INFO ] Deduced a trap composed of 24 places in 416 ms
[2020-06-05 01:35:35] [INFO ] Deduced a trap composed of 28 places in 379 ms
[2020-06-05 01:35:35] [INFO ] Deduced a trap composed of 21 places in 383 ms
[2020-06-05 01:35:36] [INFO ] Deduced a trap composed of 27 places in 459 ms
[2020-06-05 01:35:36] [INFO ] Deduced a trap composed of 31 places in 407 ms
[2020-06-05 01:35:36] [INFO ] Deduced a trap composed of 33 places in 387 ms
[2020-06-05 01:35:37] [INFO ] Deduced a trap composed of 32 places in 401 ms
[2020-06-05 01:35:37] [INFO ] Deduced a trap composed of 32 places in 386 ms
[2020-06-05 01:35:38] [INFO ] Deduced a trap composed of 25 places in 364 ms
[2020-06-05 01:35:38] [INFO ] Deduced a trap composed of 34 places in 362 ms
[2020-06-05 01:35:39] [INFO ] Deduced a trap composed of 30 places in 344 ms
[2020-06-05 01:35:39] [INFO ] Deduced a trap composed of 28 places in 471 ms
[2020-06-05 01:35:40] [INFO ] Deduced a trap composed of 26 places in 444 ms
[2020-06-05 01:35:40] [INFO ] Deduced a trap composed of 27 places in 382 ms
[2020-06-05 01:35:40] [INFO ] Deduced a trap composed of 22 places in 383 ms
[2020-06-05 01:35:41] [INFO ] Deduced a trap composed of 31 places in 289 ms
[2020-06-05 01:35:41] [INFO ] Deduced a trap composed of 29 places in 328 ms
[2020-06-05 01:35:41] [INFO ] Deduced a trap composed of 25 places in 275 ms
[2020-06-05 01:35:42] [INFO ] Deduced a trap composed of 35 places in 271 ms
[2020-06-05 01:35:42] [INFO ] Deduced a trap composed of 35 places in 305 ms
[2020-06-05 01:35:42] [INFO ] Deduced a trap composed of 34 places in 271 ms
[2020-06-05 01:35:43] [INFO ] Deduced a trap composed of 32 places in 253 ms
[2020-06-05 01:35:43] [INFO ] Deduced a trap composed of 36 places in 287 ms
[2020-06-05 01:35:43] [INFO ] Deduced a trap composed of 33 places in 236 ms
[2020-06-05 01:35:44] [INFO ] Deduced a trap composed of 34 places in 238 ms
[2020-06-05 01:35:44] [INFO ] Deduced a trap composed of 36 places in 226 ms
[2020-06-05 01:35:44] [INFO ] Deduced a trap composed of 23 places in 215 ms
[2020-06-05 01:35:44] [INFO ] Deduced a trap composed of 33 places in 233 ms
[2020-06-05 01:35:45] [INFO ] Deduced a trap composed of 43 places in 201 ms
[2020-06-05 01:35:45] [INFO ] Deduced a trap composed of 36 places in 196 ms
[2020-06-05 01:35:45] [INFO ] Deduced a trap composed of 33 places in 182 ms
[2020-06-05 01:35:45] [INFO ] Deduced a trap composed of 36 places in 203 ms
[2020-06-05 01:35:45] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 12046 ms
[2020-06-05 01:35:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:35:46] [INFO ] [Nat]Absence check using 221 positive place invariants in 263 ms returned sat
[2020-06-05 01:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:35:49] [INFO ] [Nat]Absence check using state equation in 3546 ms returned sat
[2020-06-05 01:35:50] [INFO ] Deduced a trap composed of 18 places in 601 ms
[2020-06-05 01:35:51] [INFO ] Deduced a trap composed of 29 places in 444 ms
[2020-06-05 01:35:51] [INFO ] Deduced a trap composed of 33 places in 494 ms
[2020-06-05 01:35:52] [INFO ] Deduced a trap composed of 25 places in 432 ms
[2020-06-05 01:35:52] [INFO ] Deduced a trap composed of 19 places in 430 ms
[2020-06-05 01:35:52] [INFO ] Deduced a trap composed of 20 places in 417 ms
[2020-06-05 01:35:53] [INFO ] Deduced a trap composed of 25 places in 451 ms
[2020-06-05 01:35:53] [INFO ] Deduced a trap composed of 20 places in 475 ms
[2020-06-05 01:35:54] [INFO ] Deduced a trap composed of 27 places in 385 ms
[2020-06-05 01:35:54] [INFO ] Deduced a trap composed of 27 places in 390 ms
[2020-06-05 01:35:55] [INFO ] Deduced a trap composed of 35 places in 511 ms
[2020-06-05 01:35:55] [INFO ] Deduced a trap composed of 24 places in 508 ms
[2020-06-05 01:35:56] [INFO ] Deduced a trap composed of 25 places in 414 ms
[2020-06-05 01:35:56] [INFO ] Deduced a trap composed of 22 places in 523 ms
[2020-06-05 01:35:57] [INFO ] Deduced a trap composed of 38 places in 383 ms
[2020-06-05 01:35:57] [INFO ] Deduced a trap composed of 22 places in 465 ms
[2020-06-05 01:35:58] [INFO ] Deduced a trap composed of 26 places in 493 ms
[2020-06-05 01:35:58] [INFO ] Deduced a trap composed of 30 places in 478 ms
[2020-06-05 01:35:59] [INFO ] Deduced a trap composed of 30 places in 390 ms
[2020-06-05 01:35:59] [INFO ] Deduced a trap composed of 35 places in 351 ms
[2020-06-05 01:36:00] [INFO ] Deduced a trap composed of 34 places in 346 ms
[2020-06-05 01:36:00] [INFO ] Deduced a trap composed of 28 places in 429 ms
[2020-06-05 01:36:01] [INFO ] Deduced a trap composed of 31 places in 408 ms
[2020-06-05 01:36:01] [INFO ] Deduced a trap composed of 38 places in 327 ms
[2020-06-05 01:36:01] [INFO ] Deduced a trap composed of 36 places in 392 ms
[2020-06-05 01:36:02] [INFO ] Deduced a trap composed of 26 places in 315 ms
[2020-06-05 01:36:02] [INFO ] Deduced a trap composed of 35 places in 336 ms
[2020-06-05 01:36:03] [INFO ] Deduced a trap composed of 32 places in 345 ms
[2020-06-05 01:36:03] [INFO ] Deduced a trap composed of 25 places in 260 ms
[2020-06-05 01:36:03] [INFO ] Deduced a trap composed of 29 places in 356 ms
[2020-06-05 01:36:04] [INFO ] Deduced a trap composed of 36 places in 307 ms
[2020-06-05 01:36:04] [INFO ] Deduced a trap composed of 36 places in 314 ms
[2020-06-05 01:36:04] [INFO ] Deduced a trap composed of 35 places in 238 ms
[2020-06-05 01:36:05] [INFO ] Deduced a trap composed of 27 places in 231 ms
[2020-06-05 01:36:05] [INFO ] Deduced a trap composed of 33 places in 220 ms
[2020-06-05 01:36:05] [INFO ] Deduced a trap composed of 36 places in 292 ms
[2020-06-05 01:36:05] [INFO ] Deduced a trap composed of 33 places in 248 ms
[2020-06-05 01:36:05] [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 s8 s9 s10 s11 s12 s13 s14 s15 s16 s254 s255 s256 s257 s258 s259 s260 s261 s265 s299 s300 s301 s302 s303 s304 s305) 0)") while checking expression at index 8
[2020-06-05 01:36:06] [INFO ] Flatten gal took : 162 ms
[2020-06-05 01:36:06] [INFO ] Flatten gal took : 50 ms
[2020-06-05 01:36:06] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2020-06-05 01:36:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldPPPt-PT-020B @ 3570 seconds

FORMULA ShieldPPPt-PT-020B-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLFireability-05 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: 12713528 kB
After kill :
MemTotal: 16427456 kB
MemFree: 15913480 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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="CTLFireability"
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 ShieldPPPt-PT-020B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477800676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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