About the Execution of ITS-LoLa for ShieldRVs-PT-020B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15739.880 | 3600000.00 | 3647631.00 | 1289.50 | FFF??FFFFF?F??T? | 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-159033478000850.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 ShieldRVs-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-159033478000850
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 3.6K May 14 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 19:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:04 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:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 13 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 13 09:07 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 244K 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 ShieldRVs-PT-020B-00
FORMULA_NAME ShieldRVs-PT-020B-01
FORMULA_NAME ShieldRVs-PT-020B-02
FORMULA_NAME ShieldRVs-PT-020B-03
FORMULA_NAME ShieldRVs-PT-020B-04
FORMULA_NAME ShieldRVs-PT-020B-05
FORMULA_NAME ShieldRVs-PT-020B-06
FORMULA_NAME ShieldRVs-PT-020B-07
FORMULA_NAME ShieldRVs-PT-020B-08
FORMULA_NAME ShieldRVs-PT-020B-09
FORMULA_NAME ShieldRVs-PT-020B-10
FORMULA_NAME ShieldRVs-PT-020B-11
FORMULA_NAME ShieldRVs-PT-020B-12
FORMULA_NAME ShieldRVs-PT-020B-13
FORMULA_NAME ShieldRVs-PT-020B-14
FORMULA_NAME ShieldRVs-PT-020B-15
=== Now, execution of the tool begins
BK_START 1591329754919
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 04:02:36] [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 04:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 04:02:36] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2020-06-05 04:02:36] [INFO ] Transformed 803 places.
[2020-06-05 04:02:36] [INFO ] Transformed 903 transitions.
[2020-06-05 04:02:36] [INFO ] Found NUPN structural information;
[2020-06-05 04:02:36] [INFO ] Parsed PT model containing 803 places and 903 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 115 resets, run finished after 332 ms. (steps per millisecond=301 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 903 rows 803 cols
[2020-06-05 04:02:37] [INFO ] Computed 81 place invariants in 35 ms
[2020-06-05 04:02:37] [INFO ] [Real]Absence check using 81 positive place invariants in 84 ms returned sat
[2020-06-05 04:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:02:38] [INFO ] [Real]Absence check using state equation in 1328 ms returned sat
[2020-06-05 04:02:39] [INFO ] Deduced a trap composed of 26 places in 450 ms
[2020-06-05 04:02:39] [INFO ] Deduced a trap composed of 20 places in 296 ms
[2020-06-05 04:02:40] [INFO ] Deduced a trap composed of 27 places in 362 ms
[2020-06-05 04:02:40] [INFO ] Deduced a trap composed of 27 places in 273 ms
[2020-06-05 04:02:40] [INFO ] Deduced a trap composed of 33 places in 289 ms
[2020-06-05 04:02:41] [INFO ] Deduced a trap composed of 29 places in 343 ms
[2020-06-05 04:02:41] [INFO ] Deduced a trap composed of 25 places in 358 ms
[2020-06-05 04:02:42] [INFO ] Deduced a trap composed of 35 places in 360 ms
[2020-06-05 04:02:42] [INFO ] Deduced a trap composed of 40 places in 337 ms
[2020-06-05 04:02:42] [INFO ] Deduced a trap composed of 21 places in 365 ms
[2020-06-05 04:02:43] [INFO ] Deduced a trap composed of 19 places in 307 ms
[2020-06-05 04:02:43] [INFO ] Deduced a trap composed of 40 places in 260 ms
[2020-06-05 04:02:43] [INFO ] Deduced a trap composed of 41 places in 263 ms
[2020-06-05 04:02:44] [INFO ] Deduced a trap composed of 35 places in 239 ms
[2020-06-05 04:02:44] [INFO ] Deduced a trap composed of 41 places in 233 ms
[2020-06-05 04:02:44] [INFO ] Deduced a trap composed of 22 places in 295 ms
[2020-06-05 04:02:44] [INFO ] Deduced a trap composed of 24 places in 241 ms
[2020-06-05 04:02:45] [INFO ] Deduced a trap composed of 46 places in 272 ms
[2020-06-05 04:02:45] [INFO ] Deduced a trap composed of 35 places in 274 ms
[2020-06-05 04:02:45] [INFO ] Deduced a trap composed of 21 places in 282 ms
[2020-06-05 04:02:46] [INFO ] Deduced a trap composed of 26 places in 230 ms
[2020-06-05 04:02:46] [INFO ] Deduced a trap composed of 45 places in 246 ms
[2020-06-05 04:02:46] [INFO ] Deduced a trap composed of 28 places in 307 ms
[2020-06-05 04:02:47] [INFO ] Deduced a trap composed of 63 places in 246 ms
[2020-06-05 04:02:47] [INFO ] Deduced a trap composed of 25 places in 252 ms
[2020-06-05 04:02:47] [INFO ] Deduced a trap composed of 42 places in 338 ms
[2020-06-05 04:02:48] [INFO ] Deduced a trap composed of 39 places in 222 ms
[2020-06-05 04:02:48] [INFO ] Deduced a trap composed of 36 places in 268 ms
[2020-06-05 04:02:48] [INFO ] Deduced a trap composed of 31 places in 337 ms
[2020-06-05 04:02:49] [INFO ] Deduced a trap composed of 43 places in 227 ms
[2020-06-05 04:02:49] [INFO ] Deduced a trap composed of 36 places in 216 ms
[2020-06-05 04:02:49] [INFO ] Deduced a trap composed of 29 places in 197 ms
[2020-06-05 04:02:49] [INFO ] Deduced a trap composed of 18 places in 301 ms
[2020-06-05 04:02:50] [INFO ] Deduced a trap composed of 54 places in 296 ms
[2020-06-05 04:02:50] [INFO ] Deduced a trap composed of 39 places in 265 ms
[2020-06-05 04:02:50] [INFO ] Deduced a trap composed of 28 places in 259 ms
[2020-06-05 04:02:50] [INFO ] Deduced a trap composed of 42 places in 193 ms
[2020-06-05 04:02:51] [INFO ] Deduced a trap composed of 42 places in 186 ms
[2020-06-05 04:02:51] [INFO ] Deduced a trap composed of 42 places in 162 ms
[2020-06-05 04:02:51] [INFO ] Deduced a trap composed of 31 places in 192 ms
[2020-06-05 04:02:51] [INFO ] Deduced a trap composed of 34 places in 228 ms
[2020-06-05 04:02:52] [INFO ] Deduced a trap composed of 39 places in 215 ms
[2020-06-05 04:02:52] [INFO ] Deduced a trap composed of 46 places in 218 ms
[2020-06-05 04:02:52] [INFO ] Deduced a trap composed of 46 places in 169 ms
[2020-06-05 04:02:52] [INFO ] Deduced a trap composed of 36 places in 173 ms
[2020-06-05 04:02:52] [INFO ] Deduced a trap composed of 33 places in 169 ms
[2020-06-05 04:02:53] [INFO ] Deduced a trap composed of 39 places in 154 ms
[2020-06-05 04:02:53] [INFO ] Deduced a trap composed of 39 places in 139 ms
[2020-06-05 04:02:53] [INFO ] Deduced a trap composed of 40 places in 136 ms
[2020-06-05 04:02:53] [INFO ] Deduced a trap composed of 39 places in 158 ms
[2020-06-05 04:02:53] [INFO ] Deduced a trap composed of 39 places in 185 ms
[2020-06-05 04:02:54] [INFO ] Deduced a trap composed of 39 places in 151 ms
[2020-06-05 04:02:54] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 15083 ms
[2020-06-05 04:02:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:02:54] [INFO ] [Nat]Absence check using 81 positive place invariants in 254 ms returned sat
[2020-06-05 04:02:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:02:55] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2020-06-05 04:02:56] [INFO ] Deduced a trap composed of 28 places in 372 ms
[2020-06-05 04:02:56] [INFO ] Deduced a trap composed of 20 places in 371 ms
[2020-06-05 04:02:57] [INFO ] Deduced a trap composed of 30 places in 366 ms
[2020-06-05 04:02:57] [INFO ] Deduced a trap composed of 29 places in 335 ms
[2020-06-05 04:02:57] [INFO ] Deduced a trap composed of 30 places in 315 ms
[2020-06-05 04:02:58] [INFO ] Deduced a trap composed of 28 places in 276 ms
[2020-06-05 04:02:58] [INFO ] Deduced a trap composed of 34 places in 256 ms
[2020-06-05 04:02:58] [INFO ] Deduced a trap composed of 37 places in 330 ms
[2020-06-05 04:02:59] [INFO ] Deduced a trap composed of 22 places in 284 ms
[2020-06-05 04:02:59] [INFO ] Deduced a trap composed of 36 places in 292 ms
[2020-06-05 04:02:59] [INFO ] Deduced a trap composed of 37 places in 252 ms
[2020-06-05 04:02:59] [INFO ] Deduced a trap composed of 40 places in 247 ms
[2020-06-05 04:03:00] [INFO ] Deduced a trap composed of 32 places in 265 ms
[2020-06-05 04:03:00] [INFO ] Deduced a trap composed of 33 places in 279 ms
[2020-06-05 04:03:00] [INFO ] Deduced a trap composed of 31 places in 243 ms
[2020-06-05 04:03:01] [INFO ] Deduced a trap composed of 29 places in 242 ms
[2020-06-05 04:03:01] [INFO ] Deduced a trap composed of 27 places in 259 ms
[2020-06-05 04:03:01] [INFO ] Deduced a trap composed of 36 places in 312 ms
[2020-06-05 04:03:02] [INFO ] Deduced a trap composed of 31 places in 281 ms
[2020-06-05 04:03:02] [INFO ] Deduced a trap composed of 31 places in 286 ms
[2020-06-05 04:03:02] [INFO ] Deduced a trap composed of 47 places in 254 ms
[2020-06-05 04:03:03] [INFO ] Deduced a trap composed of 40 places in 302 ms
[2020-06-05 04:03:03] [INFO ] Deduced a trap composed of 30 places in 278 ms
[2020-06-05 04:03:03] [INFO ] Deduced a trap composed of 44 places in 270 ms
[2020-06-05 04:03:03] [INFO ] Deduced a trap composed of 39 places in 268 ms
[2020-06-05 04:03:04] [INFO ] Deduced a trap composed of 33 places in 285 ms
[2020-06-05 04:03:04] [INFO ] Deduced a trap composed of 45 places in 279 ms
[2020-06-05 04:03:04] [INFO ] Deduced a trap composed of 32 places in 244 ms
[2020-06-05 04:03:05] [INFO ] Deduced a trap composed of 30 places in 311 ms
[2020-06-05 04:03:05] [INFO ] Deduced a trap composed of 30 places in 310 ms
[2020-06-05 04:03:05] [INFO ] Deduced a trap composed of 31 places in 302 ms
[2020-06-05 04:03:06] [INFO ] Deduced a trap composed of 41 places in 314 ms
[2020-06-05 04:03:06] [INFO ] Deduced a trap composed of 31 places in 320 ms
[2020-06-05 04:03:06] [INFO ] Deduced a trap composed of 47 places in 334 ms
[2020-06-05 04:03:07] [INFO ] Deduced a trap composed of 38 places in 311 ms
[2020-06-05 04:03:07] [INFO ] Deduced a trap composed of 34 places in 301 ms
[2020-06-05 04:03:07] [INFO ] Deduced a trap composed of 32 places in 300 ms
[2020-06-05 04:03:08] [INFO ] Deduced a trap composed of 34 places in 305 ms
[2020-06-05 04:03:08] [INFO ] Deduced a trap composed of 34 places in 354 ms
[2020-06-05 04:03:09] [INFO ] Deduced a trap composed of 37 places in 288 ms
[2020-06-05 04:03:09] [INFO ] Deduced a trap composed of 34 places in 310 ms
[2020-06-05 04:03:09] [INFO ] Deduced a trap composed of 40 places in 269 ms
[2020-06-05 04:03:09] [INFO ] Deduced a trap composed of 39 places in 245 ms
[2020-06-05 04:03:10] [INFO ] Deduced a trap composed of 51 places in 273 ms
[2020-06-05 04:03:10] [INFO ] Deduced a trap composed of 70 places in 254 ms
[2020-06-05 04:03:10] [INFO ] Deduced a trap composed of 64 places in 261 ms
[2020-06-05 04:03:11] [INFO ] Deduced a trap composed of 34 places in 274 ms
[2020-06-05 04:03:11] [INFO ] Deduced a trap composed of 43 places in 297 ms
[2020-06-05 04:03:11] [INFO ] Deduced a trap composed of 26 places in 276 ms
[2020-06-05 04:03:12] [INFO ] Deduced a trap composed of 32 places in 274 ms
[2020-06-05 04:03:12] [INFO ] Deduced a trap composed of 35 places in 286 ms
[2020-06-05 04:03:12] [INFO ] Deduced a trap composed of 35 places in 269 ms
[2020-06-05 04:03:12] [INFO ] Deduced a trap composed of 31 places in 251 ms
[2020-06-05 04:03:13] [INFO ] Deduced a trap composed of 27 places in 254 ms
[2020-06-05 04:03:13] [INFO ] Deduced a trap composed of 34 places in 275 ms
[2020-06-05 04:03:13] [INFO ] Deduced a trap composed of 35 places in 278 ms
[2020-06-05 04:03:14] [INFO ] Deduced a trap composed of 27 places in 245 ms
[2020-06-05 04:03:14] [INFO ] Deduced a trap composed of 18 places in 478 ms
[2020-06-05 04:03:14] [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 s686 s687 s688 s689 s691 s692 s693 s694 s695 s696 s697 s698 s700 s702 s703) 0)") while checking expression at index 0
[2020-06-05 04:03:14] [INFO ] [Real]Absence check using 81 positive place invariants in 58 ms returned sat
[2020-06-05 04:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:03:16] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2020-06-05 04:03:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:03:16] [INFO ] [Nat]Absence check using 81 positive place invariants in 247 ms returned sat
[2020-06-05 04:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:03:17] [INFO ] [Nat]Absence check using state equation in 1329 ms returned sat
[2020-06-05 04:03:18] [INFO ] Deduced a trap composed of 19 places in 310 ms
[2020-06-05 04:03:18] [INFO ] Deduced a trap composed of 25 places in 324 ms
[2020-06-05 04:03:18] [INFO ] Deduced a trap composed of 21 places in 284 ms
[2020-06-05 04:03:19] [INFO ] Deduced a trap composed of 35 places in 265 ms
[2020-06-05 04:03:19] [INFO ] Deduced a trap composed of 27 places in 258 ms
[2020-06-05 04:03:19] [INFO ] Deduced a trap composed of 25 places in 282 ms
[2020-06-05 04:03:20] [INFO ] Deduced a trap composed of 31 places in 299 ms
[2020-06-05 04:03:20] [INFO ] Deduced a trap composed of 38 places in 279 ms
[2020-06-05 04:03:20] [INFO ] Deduced a trap composed of 36 places in 239 ms
[2020-06-05 04:03:20] [INFO ] Deduced a trap composed of 37 places in 237 ms
[2020-06-05 04:03:21] [INFO ] Deduced a trap composed of 38 places in 249 ms
[2020-06-05 04:03:21] [INFO ] Deduced a trap composed of 37 places in 233 ms
[2020-06-05 04:03:21] [INFO ] Deduced a trap composed of 28 places in 233 ms
[2020-06-05 04:03:21] [INFO ] Deduced a trap composed of 22 places in 261 ms
[2020-06-05 04:03:22] [INFO ] Deduced a trap composed of 38 places in 225 ms
[2020-06-05 04:03:22] [INFO ] Deduced a trap composed of 30 places in 229 ms
[2020-06-05 04:03:22] [INFO ] Deduced a trap composed of 28 places in 265 ms
[2020-06-05 04:03:23] [INFO ] Deduced a trap composed of 34 places in 251 ms
[2020-06-05 04:03:23] [INFO ] Deduced a trap composed of 34 places in 242 ms
[2020-06-05 04:03:23] [INFO ] Deduced a trap composed of 35 places in 220 ms
[2020-06-05 04:03:23] [INFO ] Deduced a trap composed of 41 places in 224 ms
[2020-06-05 04:03:24] [INFO ] Deduced a trap composed of 35 places in 217 ms
[2020-06-05 04:03:24] [INFO ] Deduced a trap composed of 47 places in 203 ms
[2020-06-05 04:03:24] [INFO ] Deduced a trap composed of 39 places in 200 ms
[2020-06-05 04:03:24] [INFO ] Deduced a trap composed of 46 places in 206 ms
[2020-06-05 04:03:25] [INFO ] Deduced a trap composed of 41 places in 195 ms
[2020-06-05 04:03:25] [INFO ] Deduced a trap composed of 51 places in 196 ms
[2020-06-05 04:03:25] [INFO ] Deduced a trap composed of 34 places in 196 ms
[2020-06-05 04:03:25] [INFO ] Deduced a trap composed of 39 places in 220 ms
[2020-06-05 04:03:26] [INFO ] Deduced a trap composed of 36 places in 196 ms
[2020-06-05 04:03:26] [INFO ] Deduced a trap composed of 42 places in 219 ms
[2020-06-05 04:03:26] [INFO ] Deduced a trap composed of 21 places in 195 ms
[2020-06-05 04:03:26] [INFO ] Deduced a trap composed of 46 places in 226 ms
[2020-06-05 04:03:27] [INFO ] Deduced a trap composed of 56 places in 223 ms
[2020-06-05 04:03:27] [INFO ] Deduced a trap composed of 44 places in 192 ms
[2020-06-05 04:03:27] [INFO ] Deduced a trap composed of 32 places in 185 ms
[2020-06-05 04:03:27] [INFO ] Deduced a trap composed of 49 places in 180 ms
[2020-06-05 04:03:27] [INFO ] Deduced a trap composed of 50 places in 185 ms
[2020-06-05 04:03:28] [INFO ] Deduced a trap composed of 44 places in 186 ms
[2020-06-05 04:03:28] [INFO ] Deduced a trap composed of 40 places in 178 ms
[2020-06-05 04:03:28] [INFO ] Deduced a trap composed of 38 places in 183 ms
[2020-06-05 04:03:28] [INFO ] Deduced a trap composed of 39 places in 207 ms
[2020-06-05 04:03:29] [INFO ] Deduced a trap composed of 44 places in 219 ms
[2020-06-05 04:03:29] [INFO ] Deduced a trap composed of 34 places in 197 ms
[2020-06-05 04:03:29] [INFO ] Deduced a trap composed of 56 places in 196 ms
[2020-06-05 04:03:29] [INFO ] Deduced a trap composed of 44 places in 216 ms
[2020-06-05 04:03:30] [INFO ] Deduced a trap composed of 49 places in 237 ms
[2020-06-05 04:03:30] [INFO ] Deduced a trap composed of 50 places in 207 ms
[2020-06-05 04:03:30] [INFO ] Deduced a trap composed of 42 places in 203 ms
[2020-06-05 04:03:30] [INFO ] Deduced a trap composed of 49 places in 216 ms
[2020-06-05 04:03:30] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 12938 ms
[2020-06-05 04:03:30] [INFO ] Computed and/alt/rep : 902/2659/902 causal constraints in 93 ms.
[2020-06-05 04:03:36] [INFO ] Added : 440 causal constraints over 88 iterations in 5330 ms. Result :unknown
[2020-06-05 04:03:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-05 04:03:36] [INFO ] Flatten gal took : 131 ms
FORMULA ShieldRVs-PT-020B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 04:03:36] [INFO ] Applying decomposition
[2020-06-05 04:03:36] [INFO ] Flatten gal took : 66 ms
[2020-06-05 04:03:36] [INFO ] Decomposing Gal with order
[2020-06-05 04:03:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 04:03:36] [INFO ] Removed a total of 417 redundant transitions.
[2020-06-05 04:03:36] [INFO ] Flatten gal took : 123 ms
[2020-06-05 04:03:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 30 ms.
[2020-06-05 04:03:36] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-05 04:03:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVs-PT-020B @ 3570 seconds
FORMULA ShieldRVs-PT-020B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-020B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-020B-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-020B-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-020B-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-020B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-020B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-020B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427488 kB
MemFree: 12158472 kB
After kill :
MemTotal: 16427488 kB
MemFree: 16139584 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="ShieldRVs-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 ShieldRVs-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-159033478000850"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020B.tgz
mv ShieldRVs-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 '
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 ;