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

About the Execution of ITS-LoLa for ShieldRVt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.260 3600000.00 3660179.00 16162.50 ??FFFFFFFFFFFFFF 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.r211-tajo-159033478301026.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 ShieldRVt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478301026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 3.5K May 14 02:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 02:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 20:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 20:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:05 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:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 09:34 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 239K 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 ShieldRVt-PT-020B-00
FORMULA_NAME ShieldRVt-PT-020B-01
FORMULA_NAME ShieldRVt-PT-020B-02
FORMULA_NAME ShieldRVt-PT-020B-03
FORMULA_NAME ShieldRVt-PT-020B-04
FORMULA_NAME ShieldRVt-PT-020B-05
FORMULA_NAME ShieldRVt-PT-020B-06
FORMULA_NAME ShieldRVt-PT-020B-07
FORMULA_NAME ShieldRVt-PT-020B-08
FORMULA_NAME ShieldRVt-PT-020B-09
FORMULA_NAME ShieldRVt-PT-020B-10
FORMULA_NAME ShieldRVt-PT-020B-11
FORMULA_NAME ShieldRVt-PT-020B-12
FORMULA_NAME ShieldRVt-PT-020B-13
FORMULA_NAME ShieldRVt-PT-020B-14
FORMULA_NAME ShieldRVt-PT-020B-15

=== Now, execution of the tool begins

BK_START 1591338439110

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:27:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 06:27:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:27:20] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2020-06-05 06:27:20] [INFO ] Transformed 1003 places.
[2020-06-05 06:27:20] [INFO ] Transformed 1003 transitions.
[2020-06-05 06:27:20] [INFO ] Found NUPN structural information;
[2020-06-05 06:27:20] [INFO ] Parsed PT model containing 1003 places and 1003 transitions in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 317 ms. (steps per millisecond=315 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1003 rows 1003 cols
[2020-06-05 06:27:21] [INFO ] Computed 81 place invariants in 28 ms
[2020-06-05 06:27:21] [INFO ] [Real]Absence check using 81 positive place invariants in 70 ms returned sat
[2020-06-05 06:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:27:23] [INFO ] [Real]Absence check using state equation in 1637 ms returned sat
[2020-06-05 06:27:23] [INFO ] Deduced a trap composed of 29 places in 428 ms
[2020-06-05 06:27:24] [INFO ] Deduced a trap composed of 32 places in 465 ms
[2020-06-05 06:27:24] [INFO ] Deduced a trap composed of 33 places in 364 ms
[2020-06-05 06:27:25] [INFO ] Deduced a trap composed of 34 places in 351 ms
[2020-06-05 06:27:25] [INFO ] Deduced a trap composed of 39 places in 409 ms
[2020-06-05 06:27:26] [INFO ] Deduced a trap composed of 31 places in 353 ms
[2020-06-05 06:27:26] [INFO ] Deduced a trap composed of 35 places in 446 ms
[2020-06-05 06:27:26] [INFO ] Deduced a trap composed of 27 places in 405 ms
[2020-06-05 06:27:27] [INFO ] Deduced a trap composed of 40 places in 380 ms
[2020-06-05 06:27:27] [INFO ] Deduced a trap composed of 25 places in 336 ms
[2020-06-05 06:27:28] [INFO ] Deduced a trap composed of 47 places in 349 ms
[2020-06-05 06:27:28] [INFO ] Deduced a trap composed of 25 places in 359 ms
[2020-06-05 06:27:28] [INFO ] Deduced a trap composed of 60 places in 261 ms
[2020-06-05 06:27:29] [INFO ] Deduced a trap composed of 37 places in 267 ms
[2020-06-05 06:27:29] [INFO ] Deduced a trap composed of 38 places in 263 ms
[2020-06-05 06:27:29] [INFO ] Deduced a trap composed of 45 places in 356 ms
[2020-06-05 06:27:30] [INFO ] Deduced a trap composed of 38 places in 340 ms
[2020-06-05 06:27:30] [INFO ] Deduced a trap composed of 34 places in 316 ms
[2020-06-05 06:27:30] [INFO ] Deduced a trap composed of 30 places in 294 ms
[2020-06-05 06:27:31] [INFO ] Deduced a trap composed of 43 places in 241 ms
[2020-06-05 06:27:31] [INFO ] Deduced a trap composed of 35 places in 220 ms
[2020-06-05 06:27:31] [INFO ] Deduced a trap composed of 32 places in 273 ms
[2020-06-05 06:27:32] [INFO ] Deduced a trap composed of 38 places in 258 ms
[2020-06-05 06:27:32] [INFO ] Deduced a trap composed of 38 places in 324 ms
[2020-06-05 06:27:32] [INFO ] Deduced a trap composed of 35 places in 309 ms
[2020-06-05 06:27:33] [INFO ] Deduced a trap composed of 45 places in 309 ms
[2020-06-05 06:27:33] [INFO ] Deduced a trap composed of 39 places in 317 ms
[2020-06-05 06:27:33] [INFO ] Deduced a trap composed of 38 places in 305 ms
[2020-06-05 06:27:34] [INFO ] Deduced a trap composed of 40 places in 248 ms
[2020-06-05 06:27:34] [INFO ] Deduced a trap composed of 38 places in 239 ms
[2020-06-05 06:27:34] [INFO ] Deduced a trap composed of 49 places in 301 ms
[2020-06-05 06:27:35] [INFO ] Deduced a trap composed of 30 places in 271 ms
[2020-06-05 06:27:35] [INFO ] Deduced a trap composed of 38 places in 260 ms
[2020-06-05 06:27:35] [INFO ] Deduced a trap composed of 42 places in 292 ms
[2020-06-05 06:27:35] [INFO ] Deduced a trap composed of 36 places in 235 ms
[2020-06-05 06:27:36] [INFO ] Deduced a trap composed of 31 places in 231 ms
[2020-06-05 06:27:36] [INFO ] Deduced a trap composed of 37 places in 257 ms
[2020-06-05 06:27:36] [INFO ] Deduced a trap composed of 42 places in 226 ms
[2020-06-05 06:27:37] [INFO ] Deduced a trap composed of 36 places in 244 ms
[2020-06-05 06:27:37] [INFO ] Deduced a trap composed of 40 places in 239 ms
[2020-06-05 06:27:37] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14047 ms
[2020-06-05 06:27:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:27:37] [INFO ] [Nat]Absence check using 81 positive place invariants in 276 ms returned sat
[2020-06-05 06:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:27:39] [INFO ] [Nat]Absence check using state equation in 1746 ms returned sat
[2020-06-05 06:27:40] [INFO ] Deduced a trap composed of 25 places in 450 ms
[2020-06-05 06:27:40] [INFO ] Deduced a trap composed of 38 places in 380 ms
[2020-06-05 06:27:41] [INFO ] Deduced a trap composed of 42 places in 358 ms
[2020-06-05 06:27:41] [INFO ] Deduced a trap composed of 30 places in 457 ms
[2020-06-05 06:27:42] [INFO ] Deduced a trap composed of 69 places in 729 ms
[2020-06-05 06:27:42] [INFO ] Deduced a trap composed of 26 places in 321 ms
[2020-06-05 06:27:42] [INFO ] Deduced a trap composed of 37 places in 309 ms
[2020-06-05 06:27:43] [INFO ] Deduced a trap composed of 36 places in 286 ms
[2020-06-05 06:27:43] [INFO ] Deduced a trap composed of 39 places in 392 ms
[2020-06-05 06:27:44] [INFO ] Deduced a trap composed of 46 places in 283 ms
[2020-06-05 06:27:44] [INFO ] Deduced a trap composed of 43 places in 275 ms
[2020-06-05 06:27:44] [INFO ] Deduced a trap composed of 44 places in 271 ms
[2020-06-05 06:27:44] [INFO ] Deduced a trap composed of 39 places in 259 ms
[2020-06-05 06:27:45] [INFO ] Deduced a trap composed of 38 places in 300 ms
[2020-06-05 06:27:45] [INFO ] Deduced a trap composed of 52 places in 353 ms
[2020-06-05 06:27:46] [INFO ] Deduced a trap composed of 45 places in 326 ms
[2020-06-05 06:27:46] [INFO ] Deduced a trap composed of 36 places in 326 ms
[2020-06-05 06:27:46] [INFO ] Deduced a trap composed of 48 places in 328 ms
[2020-06-05 06:27:47] [INFO ] Deduced a trap composed of 41 places in 857 ms
[2020-06-05 06:27:48] [INFO ] Deduced a trap composed of 37 places in 371 ms
[2020-06-05 06:27:48] [INFO ] Deduced a trap composed of 37 places in 297 ms
[2020-06-05 06:27:48] [INFO ] Deduced a trap composed of 47 places in 246 ms
[2020-06-05 06:27:49] [INFO ] Deduced a trap composed of 35 places in 223 ms
[2020-06-05 06:27:49] [INFO ] Deduced a trap composed of 30 places in 216 ms
[2020-06-05 06:27:49] [INFO ] Deduced a trap composed of 28 places in 225 ms
[2020-06-05 06:27:49] [INFO ] Deduced a trap composed of 35 places in 236 ms
[2020-06-05 06:27:50] [INFO ] Deduced a trap composed of 35 places in 224 ms
[2020-06-05 06:27:50] [INFO ] Deduced a trap composed of 33 places in 238 ms
[2020-06-05 06:27:50] [INFO ] Deduced a trap composed of 31 places in 249 ms
[2020-06-05 06:27:51] [INFO ] Deduced a trap composed of 30 places in 455 ms
[2020-06-05 06:27:51] [INFO ] Deduced a trap composed of 44 places in 257 ms
[2020-06-05 06:27:51] [INFO ] Deduced a trap composed of 48 places in 298 ms
[2020-06-05 06:27:52] [INFO ] Deduced a trap composed of 43 places in 271 ms
[2020-06-05 06:27:52] [INFO ] Deduced a trap composed of 26 places in 277 ms
[2020-06-05 06:27:52] [INFO ] Deduced a trap composed of 36 places in 281 ms
[2020-06-05 06:27:52] [INFO ] Deduced a trap composed of 39 places in 172 ms
[2020-06-05 06:27:53] [INFO ] Deduced a trap composed of 33 places in 237 ms
[2020-06-05 06:27:53] [INFO ] Deduced a trap composed of 31 places in 252 ms
[2020-06-05 06:27:53] [INFO ] Deduced a trap composed of 37 places in 247 ms
[2020-06-05 06:27:53] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 14152 ms
[2020-06-05 06:27:53] [INFO ] Computed and/alt/rep : 1002/1483/1002 causal constraints in 53 ms.
[2020-06-05 06:27:57] [INFO ] Added : 355 causal constraints over 71 iterations in 3665 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 06:27:57] [INFO ] [Real]Absence check using 81 positive place invariants in 66 ms returned sat
[2020-06-05 06:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:27:59] [INFO ] [Real]Absence check using state equation in 1725 ms returned sat
[2020-06-05 06:27:59] [INFO ] Deduced a trap composed of 28 places in 469 ms
[2020-06-05 06:28:00] [INFO ] Deduced a trap composed of 35 places in 461 ms
[2020-06-05 06:28:00] [INFO ] Deduced a trap composed of 35 places in 427 ms
[2020-06-05 06:28:01] [INFO ] Deduced a trap composed of 32 places in 461 ms
[2020-06-05 06:28:01] [INFO ] Deduced a trap composed of 29 places in 451 ms
[2020-06-05 06:28:02] [INFO ] Deduced a trap composed of 25 places in 452 ms
[2020-06-05 06:28:02] [INFO ] Deduced a trap composed of 29 places in 423 ms
[2020-06-05 06:28:03] [INFO ] Deduced a trap composed of 34 places in 420 ms
[2020-06-05 06:28:03] [INFO ] Deduced a trap composed of 37 places in 370 ms
[2020-06-05 06:28:04] [INFO ] Deduced a trap composed of 37 places in 336 ms
[2020-06-05 06:28:04] [INFO ] Deduced a trap composed of 60 places in 277 ms
[2020-06-05 06:28:04] [INFO ] Deduced a trap composed of 33 places in 268 ms
[2020-06-05 06:28:05] [INFO ] Deduced a trap composed of 28 places in 282 ms
[2020-06-05 06:28:05] [INFO ] Deduced a trap composed of 23 places in 281 ms
[2020-06-05 06:28:05] [INFO ] Deduced a trap composed of 31 places in 318 ms
[2020-06-05 06:28:06] [INFO ] Deduced a trap composed of 42 places in 292 ms
[2020-06-05 06:28:06] [INFO ] Deduced a trap composed of 56 places in 256 ms
[2020-06-05 06:28:06] [INFO ] Deduced a trap composed of 55 places in 288 ms
[2020-06-05 06:28:07] [INFO ] Deduced a trap composed of 38 places in 298 ms
[2020-06-05 06:28:07] [INFO ] Deduced a trap composed of 44 places in 278 ms
[2020-06-05 06:28:07] [INFO ] Deduced a trap composed of 36 places in 287 ms
[2020-06-05 06:28:08] [INFO ] Deduced a trap composed of 36 places in 271 ms
[2020-06-05 06:28:08] [INFO ] Deduced a trap composed of 48 places in 297 ms
[2020-06-05 06:28:08] [INFO ] Deduced a trap composed of 37 places in 265 ms
[2020-06-05 06:28:08] [INFO ] Deduced a trap composed of 34 places in 258 ms
[2020-06-05 06:28:09] [INFO ] Deduced a trap composed of 55 places in 285 ms
[2020-06-05 06:28:09] [INFO ] Deduced a trap composed of 43 places in 308 ms
[2020-06-05 06:28:09] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 10230 ms
[2020-06-05 06:28:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:28:10] [INFO ] [Nat]Absence check using 81 positive place invariants in 275 ms returned sat
[2020-06-05 06:28:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:28:11] [INFO ] [Nat]Absence check using state equation in 1686 ms returned sat
[2020-06-05 06:28:12] [INFO ] Deduced a trap composed of 34 places in 449 ms
[2020-06-05 06:28:12] [INFO ] Deduced a trap composed of 32 places in 416 ms
[2020-06-05 06:28:13] [INFO ] Deduced a trap composed of 40 places in 417 ms
[2020-06-05 06:28:13] [INFO ] Deduced a trap composed of 38 places in 367 ms
[2020-06-05 06:28:13] [INFO ] Deduced a trap composed of 37 places in 311 ms
[2020-06-05 06:28:14] [INFO ] Deduced a trap composed of 32 places in 327 ms
[2020-06-05 06:28:14] [INFO ] Deduced a trap composed of 36 places in 279 ms
[2020-06-05 06:28:14] [INFO ] Deduced a trap composed of 35 places in 270 ms
[2020-06-05 06:28:15] [INFO ] Deduced a trap composed of 43 places in 278 ms
[2020-06-05 06:28:15] [INFO ] Deduced a trap composed of 38 places in 279 ms
[2020-06-05 06:28:15] [INFO ] Deduced a trap composed of 25 places in 265 ms
[2020-06-05 06:28:16] [INFO ] Deduced a trap composed of 29 places in 266 ms
[2020-06-05 06:28:16] [INFO ] Deduced a trap composed of 35 places in 260 ms
[2020-06-05 06:28:16] [INFO ] Deduced a trap composed of 43 places in 237 ms
[2020-06-05 06:28:17] [INFO ] Deduced a trap composed of 36 places in 265 ms
[2020-06-05 06:28:17] [INFO ] Deduced a trap composed of 55 places in 218 ms
[2020-06-05 06:28:17] [INFO ] Deduced a trap composed of 33 places in 220 ms
[2020-06-05 06:28:17] [INFO ] Deduced a trap composed of 50 places in 233 ms
[2020-06-05 06:28:18] [INFO ] Deduced a trap composed of 42 places in 262 ms
[2020-06-05 06:28:18] [INFO ] Deduced a trap composed of 53 places in 224 ms
[2020-06-05 06:28:18] [INFO ] Deduced a trap composed of 45 places in 275 ms
[2020-06-05 06:28:19] [INFO ] Deduced a trap composed of 52 places in 226 ms
[2020-06-05 06:28:19] [INFO ] Deduced a trap composed of 58 places in 244 ms
[2020-06-05 06:28:19] [INFO ] Deduced a trap composed of 40 places in 205 ms
[2020-06-05 06:28:19] [INFO ] Deduced a trap composed of 38 places in 240 ms
[2020-06-05 06:28:20] [INFO ] Deduced a trap composed of 44 places in 228 ms
[2020-06-05 06:28:20] [INFO ] Deduced a trap composed of 32 places in 214 ms
[2020-06-05 06:28:20] [INFO ] Deduced a trap composed of 37 places in 238 ms
[2020-06-05 06:28:20] [INFO ] Deduced a trap composed of 34 places in 219 ms
[2020-06-05 06:28:21] [INFO ] Deduced a trap composed of 34 places in 200 ms
[2020-06-05 06:28:21] [INFO ] Deduced a trap composed of 35 places in 210 ms
[2020-06-05 06:28:21] [INFO ] Deduced a trap composed of 33 places in 192 ms
[2020-06-05 06:28:21] [INFO ] Deduced a trap composed of 41 places in 215 ms
[2020-06-05 06:28:22] [INFO ] Deduced a trap composed of 56 places in 200 ms
[2020-06-05 06:28:22] [INFO ] Deduced a trap composed of 37 places in 176 ms
[2020-06-05 06:28:22] [INFO ] Deduced a trap composed of 39 places in 170 ms
[2020-06-05 06:28:22] [INFO ] Deduced a trap composed of 36 places in 222 ms
[2020-06-05 06:28:23] [INFO ] Deduced a trap composed of 33 places in 190 ms
[2020-06-05 06:28:23] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 11334 ms
[2020-06-05 06:28:23] [INFO ] Computed and/alt/rep : 1002/1483/1002 causal constraints in 102 ms.
[2020-06-05 06:28:29] [INFO ] Added : 585 causal constraints over 117 iterations in 6560 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 06:28:29] [INFO ] [Real]Absence check using 81 positive place invariants in 83 ms returned sat
[2020-06-05 06:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:28:31] [INFO ] [Real]Absence check using state equation in 1798 ms returned sat
[2020-06-05 06:28:32] [INFO ] Deduced a trap composed of 31 places in 487 ms
[2020-06-05 06:28:32] [INFO ] Deduced a trap composed of 32 places in 457 ms
[2020-06-05 06:28:33] [INFO ] Deduced a trap composed of 52 places in 414 ms
[2020-06-05 06:28:33] [INFO ] Deduced a trap composed of 19 places in 365 ms
[2020-06-05 06:28:34] [INFO ] Deduced a trap composed of 28 places in 318 ms
[2020-06-05 06:28:34] [INFO ] Deduced a trap composed of 38 places in 359 ms
[2020-06-05 06:28:34] [INFO ] Deduced a trap composed of 43 places in 295 ms
[2020-06-05 06:28:35] [INFO ] Deduced a trap composed of 64 places in 313 ms
[2020-06-05 06:28:35] [INFO ] Deduced a trap composed of 49 places in 331 ms
[2020-06-05 06:28:35] [INFO ] Deduced a trap composed of 45 places in 296 ms
[2020-06-05 06:28:36] [INFO ] Deduced a trap composed of 36 places in 350 ms
[2020-06-05 06:28:36] [INFO ] Deduced a trap composed of 63 places in 267 ms
[2020-06-05 06:28:36] [INFO ] Deduced a trap composed of 46 places in 252 ms
[2020-06-05 06:28:37] [INFO ] Deduced a trap composed of 27 places in 282 ms
[2020-06-05 06:28:37] [INFO ] Deduced a trap composed of 34 places in 253 ms
[2020-06-05 06:28:37] [INFO ] Deduced a trap composed of 45 places in 290 ms
[2020-06-05 06:28:38] [INFO ] Deduced a trap composed of 31 places in 243 ms
[2020-06-05 06:28:38] [INFO ] Deduced a trap composed of 32 places in 329 ms
[2020-06-05 06:28:38] [INFO ] Deduced a trap composed of 31 places in 253 ms
[2020-06-05 06:28:39] [INFO ] Deduced a trap composed of 30 places in 251 ms
[2020-06-05 06:28:39] [INFO ] Deduced a trap composed of 44 places in 242 ms
[2020-06-05 06:28:39] [INFO ] Deduced a trap composed of 37 places in 253 ms
[2020-06-05 06:28:39] [INFO ] Deduced a trap composed of 38 places in 242 ms
[2020-06-05 06:28:40] [INFO ] Deduced a trap composed of 33 places in 220 ms
[2020-06-05 06:28:40] [INFO ] Deduced a trap composed of 44 places in 224 ms
[2020-06-05 06:28:40] [INFO ] Deduced a trap composed of 42 places in 215 ms
[2020-06-05 06:28:40] [INFO ] Deduced a trap composed of 41 places in 195 ms
[2020-06-05 06:28:41] [INFO ] Deduced a trap composed of 33 places in 169 ms
[2020-06-05 06:28:41] [INFO ] Deduced a trap composed of 31 places in 193 ms
[2020-06-05 06:28:41] [INFO ] Deduced a trap composed of 41 places in 204 ms
[2020-06-05 06:28:41] [INFO ] Deduced a trap composed of 33 places in 176 ms
[2020-06-05 06:28:42] [INFO ] Deduced a trap composed of 30 places in 194 ms
[2020-06-05 06:28:42] [INFO ] Deduced a trap composed of 32 places in 249 ms
[2020-06-05 06:28:42] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 10601 ms
[2020-06-05 06:28:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:28:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 268 ms returned sat
[2020-06-05 06:28:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:28:44] [INFO ] [Nat]Absence check using state equation in 1961 ms returned sat
[2020-06-05 06:28:45] [INFO ] Deduced a trap composed of 49 places in 476 ms
[2020-06-05 06:28:45] [INFO ] Deduced a trap composed of 38 places in 455 ms
[2020-06-05 06:28:46] [INFO ] Deduced a trap composed of 48 places in 359 ms
[2020-06-05 06:28:46] [INFO ] Deduced a trap composed of 29 places in 364 ms
[2020-06-05 06:28:46] [INFO ] Deduced a trap composed of 51 places in 348 ms
[2020-06-05 06:28:47] [INFO ] Deduced a trap composed of 31 places in 341 ms
[2020-06-05 06:28:47] [INFO ] Deduced a trap composed of 29 places in 313 ms
[2020-06-05 06:28:48] [INFO ] Deduced a trap composed of 37 places in 267 ms
[2020-06-05 06:28:48] [INFO ] Deduced a trap composed of 29 places in 397 ms
[2020-06-05 06:28:48] [INFO ] Deduced a trap composed of 25 places in 348 ms
[2020-06-05 06:28:49] [INFO ] Deduced a trap composed of 41 places in 336 ms
[2020-06-05 06:28:49] [INFO ] Deduced a trap composed of 43 places in 340 ms
[2020-06-05 06:28:49] [INFO ] Deduced a trap composed of 39 places in 304 ms
[2020-06-05 06:28:50] [INFO ] Deduced a trap composed of 36 places in 313 ms
[2020-06-05 06:28:50] [INFO ] Deduced a trap composed of 20 places in 349 ms
[2020-06-05 06:28:51] [INFO ] Deduced a trap composed of 30 places in 294 ms
[2020-06-05 06:28:51] [INFO ] Deduced a trap composed of 37 places in 287 ms
[2020-06-05 06:28:51] [INFO ] Deduced a trap composed of 27 places in 518 ms
[2020-06-05 06:28:56] [INFO ] Deduced a trap composed of 45 places in 5028 ms
[2020-06-05 06:28:57] [INFO ] Deduced a trap composed of 56 places in 258 ms
[2020-06-05 06:28:58] [INFO ] Deduced a trap composed of 39 places in 878 ms
[2020-06-05 06:29:00] [INFO ] Deduced a trap composed of 52 places in 1826 ms
[2020-06-05 06:29:00] [INFO ] Deduced a trap composed of 49 places in 244 ms
[2020-06-05 06:29:00] [INFO ] Deduced a trap composed of 49 places in 217 ms
[2020-06-05 06:29:00] [INFO ] Deduced a trap composed of 37 places in 239 ms
[2020-06-05 06:29:01] [INFO ] Deduced a trap composed of 32 places in 211 ms
[2020-06-05 06:29:01] [INFO ] Deduced a trap composed of 38 places in 192 ms
[2020-06-05 06:29:01] [INFO ] Deduced a trap composed of 46 places in 192 ms
[2020-06-05 06:29:01] [INFO ] Deduced a trap composed of 40 places in 184 ms
[2020-06-05 06:29:02] [INFO ] Deduced a trap composed of 48 places in 210 ms
[2020-06-05 06:29:02] [INFO ] Deduced a trap composed of 47 places in 176 ms
[2020-06-05 06:29:02] [INFO ] Deduced a trap composed of 33 places in 186 ms
[2020-06-05 06:29:02] [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 s469 s470 s471 s472 s473 s474 s475 s476 s477 s513 s514 s551 s560 s561 s589 s590 s591 s592 s593 s594 s595 s596 s597) 0)") while checking expression at index 2
[2020-06-05 06:29:02] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-05 06:29:02] [INFO ] Flatten gal took : 88 ms
FORMULA ShieldRVt-PT-020B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:29:02] [INFO ] Applying decomposition
[2020-06-05 06:29:02] [INFO ] Flatten gal took : 39 ms
[2020-06-05 06:29:02] [INFO ] Decomposing Gal with order
[2020-06-05 06:29:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 06:29:02] [INFO ] Flatten gal took : 71 ms
[2020-06-05 06:29:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-06-05 06:29:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-05 06:29:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVt-PT-020B @ 3570 seconds

FORMULA ShieldRVt-PT-020B-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020B-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-020B-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-020B-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-020B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-020B-06 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: 6031720 kB
After kill :
MemTotal: 16427456 kB
MemFree: 6043804 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="ShieldRVt-PT-020B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldRVt-PT-020B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033478301026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;