About the Execution of ITS-LoLa for ShieldIIPs-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15741.120 | 3600000.00 | 10060006.00 | 1022.10 | T??TFFFTFFFT??F? | 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-159033477000132.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 ShieldIIPs-PT-010B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477000132
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 3.7K May 14 00:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 00:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:40 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 164K 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 ShieldIIPs-PT-010B-CTLFireability-00
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-01
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-02
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-03
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-04
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-05
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-06
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-07
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-08
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-09
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-10
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-11
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-12
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-13
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-14
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591287893815
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:24:56] [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-04 16:24:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:24:56] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2020-06-04 16:24:56] [INFO ] Transformed 603 places.
[2020-06-04 16:24:56] [INFO ] Transformed 593 transitions.
[2020-06-04 16:24:56] [INFO ] Found NUPN structural information;
[2020-06-04 16:24:56] [INFO ] Parsed PT model containing 603 places and 593 transitions in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 76 ms.
Incomplete random walk after 100000 steps, including 77 resets, run finished after 456 ms. (steps per millisecond=219 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 593 rows 603 cols
[2020-06-04 16:24:57] [INFO ] Computed 91 place invariants in 50 ms
[2020-06-04 16:24:57] [INFO ] [Real]Absence check using 91 positive place invariants in 104 ms returned sat
[2020-06-04 16:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:24:58] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2020-06-04 16:24:59] [INFO ] Deduced a trap composed of 26 places in 565 ms
[2020-06-04 16:24:59] [INFO ] Deduced a trap composed of 23 places in 372 ms
[2020-06-04 16:25:01] [INFO ] Deduced a trap composed of 10 places in 2046 ms
[2020-06-04 16:25:03] [INFO ] Deduced a trap composed of 20 places in 1409 ms
[2020-06-04 16:25:05] [INFO ] Deduced a trap composed of 22 places in 2668 ms
[2020-06-04 16:25:06] [INFO ] Deduced a trap composed of 23 places in 436 ms
[2020-06-04 16:25:06] [INFO ] Deduced a trap composed of 19 places in 167 ms
[2020-06-04 16:25:06] [INFO ] Deduced a trap composed of 24 places in 229 ms
[2020-06-04 16:25:07] [INFO ] Deduced a trap composed of 25 places in 346 ms
[2020-06-04 16:25:07] [INFO ] Deduced a trap composed of 19 places in 272 ms
[2020-06-04 16:25:07] [INFO ] Deduced a trap composed of 22 places in 281 ms
[2020-06-04 16:25:08] [INFO ] Deduced a trap composed of 15 places in 294 ms
[2020-06-04 16:25:08] [INFO ] Deduced a trap composed of 22 places in 248 ms
[2020-06-04 16:25:08] [INFO ] Deduced a trap composed of 19 places in 238 ms
[2020-06-04 16:25:08] [INFO ] Deduced a trap composed of 26 places in 183 ms
[2020-06-04 16:25:09] [INFO ] Deduced a trap composed of 20 places in 183 ms
[2020-06-04 16:25:09] [INFO ] Deduced a trap composed of 21 places in 346 ms
[2020-06-04 16:25:09] [INFO ] Deduced a trap composed of 23 places in 304 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 26 places in 237 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 28 places in 188 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 16 places in 158 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 17 places in 156 ms
[2020-06-04 16:25:10] [INFO ] Deduced a trap composed of 34 places in 141 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 23 places in 167 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 21 places in 173 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 36 places in 148 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 33 places in 135 ms
[2020-06-04 16:25:11] [INFO ] Deduced a trap composed of 36 places in 136 ms
[2020-06-04 16:25:12] [INFO ] Deduced a trap composed of 31 places in 158 ms
[2020-06-04 16:25:12] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 13530 ms
[2020-06-04 16:25:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:25:12] [INFO ] [Nat]Absence check using 91 positive place invariants in 102 ms returned sat
[2020-06-04 16:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:25:13] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2020-06-04 16:25:13] [INFO ] Deduced a trap composed of 36 places in 245 ms
[2020-06-04 16:25:13] [INFO ] Deduced a trap composed of 22 places in 199 ms
[2020-06-04 16:25:13] [INFO ] Deduced a trap composed of 20 places in 213 ms
[2020-06-04 16:25:14] [INFO ] Deduced a trap composed of 20 places in 202 ms
[2020-06-04 16:25:14] [INFO ] Deduced a trap composed of 25 places in 242 ms
[2020-06-04 16:25:14] [INFO ] Deduced a trap composed of 19 places in 222 ms
[2020-06-04 16:25:14] [INFO ] Deduced a trap composed of 31 places in 250 ms
[2020-06-04 16:25:15] [INFO ] Deduced a trap composed of 36 places in 212 ms
[2020-06-04 16:25:15] [INFO ] Deduced a trap composed of 33 places in 237 ms
[2020-06-04 16:25:15] [INFO ] Deduced a trap composed of 25 places in 199 ms
[2020-06-04 16:25:15] [INFO ] Deduced a trap composed of 18 places in 217 ms
[2020-06-04 16:25:16] [INFO ] Deduced a trap composed of 21 places in 233 ms
[2020-06-04 16:25:16] [INFO ] Deduced a trap composed of 19 places in 203 ms
[2020-06-04 16:25:16] [INFO ] Deduced a trap composed of 23 places in 231 ms
[2020-06-04 16:25:16] [INFO ] Deduced a trap composed of 16 places in 207 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 23 places in 220 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 22 places in 238 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 13 places in 196 ms
[2020-06-04 16:25:17] [INFO ] Deduced a trap composed of 27 places in 311 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 19 places in 296 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 40 places in 179 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 32 places in 212 ms
[2020-06-04 16:25:18] [INFO ] Deduced a trap composed of 23 places in 194 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 27 places in 171 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 22 places in 162 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 32 places in 187 ms
[2020-06-04 16:25:19] [INFO ] Deduced a trap composed of 39 places in 164 ms
[2020-06-04 16:25:20] [INFO ] Deduced a trap composed of 26 places in 166 ms
[2020-06-04 16:25:20] [INFO ] Deduced a trap composed of 27 places in 157 ms
[2020-06-04 16:25:20] [INFO ] Deduced a trap composed of 21 places in 129 ms
[2020-06-04 16:25:20] [INFO ] Deduced a trap composed of 14 places in 143 ms
[2020-06-04 16:25:20] [INFO ] Deduced a trap composed of 31 places in 125 ms
[2020-06-04 16:25:20] [INFO ] Deduced a trap composed of 25 places in 124 ms
[2020-06-04 16:25:20] [INFO ] Deduced a trap composed of 13 places in 115 ms
[2020-06-04 16:25:21] [INFO ] Deduced a trap composed of 27 places in 111 ms
[2020-06-04 16:25:21] [INFO ] Deduced a trap composed of 10 places in 101 ms
[2020-06-04 16:25:21] [INFO ] Deduced a trap composed of 16 places in 131 ms
[2020-06-04 16:25:21] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 8260 ms
[2020-06-04 16:25:21] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints in 57 ms.
[2020-06-04 16:25:29] [INFO ] Added : 547 causal constraints over 116 iterations in 7836 ms. Result :sat
[2020-06-04 16:25:29] [INFO ] [Real]Absence check using 91 positive place invariants in 102 ms returned sat
[2020-06-04 16:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:25:30] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2020-06-04 16:25:30] [INFO ] Deduced a trap composed of 10 places in 280 ms
[2020-06-04 16:25:30] [INFO ] Deduced a trap composed of 24 places in 371 ms
[2020-06-04 16:25:31] [INFO ] Deduced a trap composed of 19 places in 334 ms
[2020-06-04 16:25:31] [INFO ] Deduced a trap composed of 20 places in 345 ms
[2020-06-04 16:25:32] [INFO ] Deduced a trap composed of 26 places in 920 ms
[2020-06-04 16:25:32] [INFO ] Deduced a trap composed of 23 places in 269 ms
[2020-06-04 16:25:33] [INFO ] Deduced a trap composed of 19 places in 238 ms
[2020-06-04 16:25:33] [INFO ] Deduced a trap composed of 23 places in 246 ms
[2020-06-04 16:25:33] [INFO ] Deduced a trap composed of 17 places in 188 ms
[2020-06-04 16:25:33] [INFO ] Deduced a trap composed of 20 places in 239 ms
[2020-06-04 16:25:34] [INFO ] Deduced a trap composed of 25 places in 236 ms
[2020-06-04 16:25:34] [INFO ] Deduced a trap composed of 31 places in 194 ms
[2020-06-04 16:25:34] [INFO ] Deduced a trap composed of 20 places in 194 ms
[2020-06-04 16:25:34] [INFO ] Deduced a trap composed of 27 places in 203 ms
[2020-06-04 16:25:35] [INFO ] Deduced a trap composed of 32 places in 167 ms
[2020-06-04 16:25:35] [INFO ] Deduced a trap composed of 26 places in 163 ms
[2020-06-04 16:25:35] [INFO ] Deduced a trap composed of 20 places in 156 ms
[2020-06-04 16:25:35] [INFO ] Deduced a trap composed of 32 places in 217 ms
[2020-06-04 16:25:35] [INFO ] Deduced a trap composed of 25 places in 133 ms
[2020-06-04 16:25:36] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-06-04 16:25:36] [INFO ] Deduced a trap composed of 38 places in 113 ms
[2020-06-04 16:25:36] [INFO ] Deduced a trap composed of 18 places in 130 ms
[2020-06-04 16:25:36] [INFO ] Deduced a trap composed of 30 places in 135 ms
[2020-06-04 16:25:36] [INFO ] Deduced a trap composed of 28 places in 118 ms
[2020-06-04 16:25:36] [INFO ] Deduced a trap composed of 26 places in 118 ms
[2020-06-04 16:25:37] [INFO ] Deduced a trap composed of 25 places in 206 ms
[2020-06-04 16:25:37] [INFO ] Deduced a trap composed of 23 places in 142 ms
[2020-06-04 16:25:37] [INFO ] Deduced a trap composed of 43 places in 105 ms
[2020-06-04 16:25:38] [INFO ] Deduced a trap composed of 22 places in 1052 ms
[2020-06-04 16:25:38] [INFO ] Deduced a trap composed of 26 places in 290 ms
[2020-06-04 16:25:39] [INFO ] Deduced a trap composed of 31 places in 202 ms
[2020-06-04 16:25:39] [INFO ] Deduced a trap composed of 21 places in 205 ms
[2020-06-04 16:25:39] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2020-06-04 16:25:40] [INFO ] Deduced a trap composed of 30 places in 1213 ms
[2020-06-04 16:25:40] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 10479 ms
[2020-06-04 16:25:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:25:40] [INFO ] [Nat]Absence check using 91 positive place invariants in 73 ms returned sat
[2020-06-04 16:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:25:41] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2020-06-04 16:25:42] [INFO ] Deduced a trap composed of 27 places in 557 ms
[2020-06-04 16:25:42] [INFO ] Deduced a trap composed of 16 places in 281 ms
[2020-06-04 16:25:43] [INFO ] Deduced a trap composed of 18 places in 743 ms
[2020-06-04 16:25:43] [INFO ] Deduced a trap composed of 30 places in 230 ms
[2020-06-04 16:25:43] [INFO ] Deduced a trap composed of 13 places in 261 ms
[2020-06-04 16:25:44] [INFO ] Deduced a trap composed of 27 places in 495 ms
[2020-06-04 16:25:44] [INFO ] Deduced a trap composed of 25 places in 335 ms
[2020-06-04 16:25:45] [INFO ] Deduced a trap composed of 26 places in 567 ms
[2020-06-04 16:25:46] [INFO ] Deduced a trap composed of 20 places in 623 ms
[2020-06-04 16:25:46] [INFO ] Deduced a trap composed of 22 places in 433 ms
[2020-06-04 16:25:46] [INFO ] Deduced a trap composed of 37 places in 231 ms
[2020-06-04 16:25:47] [INFO ] Deduced a trap composed of 25 places in 1037 ms
[2020-06-04 16:25:48] [INFO ] Deduced a trap composed of 30 places in 1020 ms
[2020-06-04 16:25:49] [INFO ] Deduced a trap composed of 15 places in 460 ms
[2020-06-04 16:25:49] [INFO ] Deduced a trap composed of 19 places in 336 ms
[2020-06-04 16:25:50] [INFO ] Deduced a trap composed of 16 places in 963 ms
[2020-06-04 16:25:51] [INFO ] Deduced a trap composed of 24 places in 558 ms
[2020-06-04 16:25:51] [INFO ] Deduced a trap composed of 28 places in 336 ms
[2020-06-04 16:25:52] [INFO ] Deduced a trap composed of 23 places in 359 ms
[2020-06-04 16:25:52] [INFO ] Deduced a trap composed of 39 places in 342 ms
[2020-06-04 16:25:52] [INFO ] Deduced a trap composed of 22 places in 326 ms
[2020-06-04 16:25:53] [INFO ] Deduced a trap composed of 24 places in 295 ms
[2020-06-04 16:25:53] [INFO ] Deduced a trap composed of 36 places in 295 ms
[2020-06-04 16:25:53] [INFO ] Deduced a trap composed of 21 places in 263 ms
[2020-06-04 16:25:53] [INFO ] Deduced a trap composed of 33 places in 246 ms
[2020-06-04 16:25:55] [INFO ] Deduced a trap composed of 26 places in 1745 ms
[2020-06-04 16:25:56] [INFO ] Deduced a trap composed of 23 places in 819 ms
[2020-06-04 16:25:57] [INFO ] Deduced a trap composed of 16 places in 506 ms
[2020-06-04 16:25:57] [INFO ] Deduced a trap composed of 28 places in 782 ms
[2020-06-04 16:25:58] [INFO ] Deduced a trap composed of 22 places in 179 ms
[2020-06-04 16:25:58] [INFO ] Deduced a trap composed of 24 places in 242 ms
[2020-06-04 16:25:58] [INFO ] Deduced a trap composed of 22 places in 315 ms
[2020-06-04 16:25:59] [INFO ] Deduced a trap composed of 24 places in 221 ms
[2020-06-04 16:25:59] [INFO ] Deduced a trap composed of 37 places in 229 ms
[2020-06-04 16:25:59] [INFO ] Deduced a trap composed of 25 places in 195 ms
[2020-06-04 16:25:59] [INFO ] Deduced a trap composed of 37 places in 238 ms
[2020-06-04 16:26:00] [INFO ] Deduced a trap composed of 36 places in 265 ms
[2020-06-04 16:26:00] [INFO ] Deduced a trap composed of 31 places in 339 ms
[2020-06-04 16:26:00] [INFO ] Deduced a trap composed of 23 places in 215 ms
[2020-06-04 16:26:01] [INFO ] Deduced a trap composed of 26 places in 373 ms
[2020-06-04 16:26:01] [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 s72 s73 s93 s94 s95 s97 s98 s99 s100 s101 s102 s103 s104 s120 s128 s129 s130) 0)") while checking expression at index 1
[2020-06-04 16:26:01] [INFO ] [Real]Absence check using 91 positive place invariants in 84 ms returned sat
[2020-06-04 16:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:26:02] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2020-06-04 16:26:02] [INFO ] Deduced a trap composed of 34 places in 242 ms
[2020-06-04 16:26:02] [INFO ] Deduced a trap composed of 18 places in 224 ms
[2020-06-04 16:26:03] [INFO ] Deduced a trap composed of 32 places in 232 ms
[2020-06-04 16:26:03] [INFO ] Deduced a trap composed of 25 places in 262 ms
[2020-06-04 16:26:03] [INFO ] Deduced a trap composed of 20 places in 241 ms
[2020-06-04 16:26:04] [INFO ] Deduced a trap composed of 32 places in 246 ms
[2020-06-04 16:26:04] [INFO ] Deduced a trap composed of 19 places in 243 ms
[2020-06-04 16:26:04] [INFO ] Deduced a trap composed of 36 places in 220 ms
[2020-06-04 16:26:04] [INFO ] Deduced a trap composed of 32 places in 190 ms
[2020-06-04 16:26:05] [INFO ] Deduced a trap composed of 23 places in 211 ms
[2020-06-04 16:26:05] [INFO ] Deduced a trap composed of 20 places in 210 ms
[2020-06-04 16:26:05] [INFO ] Deduced a trap composed of 21 places in 209 ms
[2020-06-04 16:26:05] [INFO ] Deduced a trap composed of 15 places in 223 ms
[2020-06-04 16:26:05] [INFO ] Deduced a trap composed of 25 places in 181 ms
[2020-06-04 16:26:06] [INFO ] Deduced a trap composed of 21 places in 293 ms
[2020-06-04 16:26:06] [INFO ] Deduced a trap composed of 24 places in 274 ms
[2020-06-04 16:26:06] [INFO ] Deduced a trap composed of 22 places in 265 ms
[2020-06-04 16:26:07] [INFO ] Deduced a trap composed of 24 places in 236 ms
[2020-06-04 16:26:07] [INFO ] Deduced a trap composed of 33 places in 259 ms
[2020-06-04 16:26:07] [INFO ] Deduced a trap composed of 26 places in 253 ms
[2020-06-04 16:26:07] [INFO ] Deduced a trap composed of 21 places in 224 ms
[2020-06-04 16:26:08] [INFO ] Deduced a trap composed of 19 places in 239 ms
[2020-06-04 16:26:08] [INFO ] Deduced a trap composed of 23 places in 172 ms
[2020-06-04 16:26:08] [INFO ] Deduced a trap composed of 26 places in 193 ms
[2020-06-04 16:26:08] [INFO ] Deduced a trap composed of 21 places in 187 ms
[2020-06-04 16:26:08] [INFO ] Deduced a trap composed of 21 places in 131 ms
[2020-06-04 16:26:09] [INFO ] Deduced a trap composed of 33 places in 141 ms
[2020-06-04 16:26:09] [INFO ] Deduced a trap composed of 23 places in 123 ms
[2020-06-04 16:26:09] [INFO ] Deduced a trap composed of 20 places in 139 ms
[2020-06-04 16:26:09] [INFO ] Deduced a trap composed of 32 places in 176 ms
[2020-06-04 16:26:09] [INFO ] Deduced a trap composed of 26 places in 158 ms
[2020-06-04 16:26:10] [INFO ] Deduced a trap composed of 20 places in 119 ms
[2020-06-04 16:26:10] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 7647 ms
[2020-06-04 16:26:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:26:10] [INFO ] [Nat]Absence check using 91 positive place invariants in 94 ms returned sat
[2020-06-04 16:26:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:26:11] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2020-06-04 16:26:11] [INFO ] Deduced a trap composed of 20 places in 413 ms
[2020-06-04 16:26:11] [INFO ] Deduced a trap composed of 17 places in 244 ms
[2020-06-04 16:26:12] [INFO ] Deduced a trap composed of 27 places in 227 ms
[2020-06-04 16:26:12] [INFO ] Deduced a trap composed of 26 places in 261 ms
[2020-06-04 16:26:12] [INFO ] Deduced a trap composed of 21 places in 397 ms
[2020-06-04 16:26:13] [INFO ] Deduced a trap composed of 29 places in 368 ms
[2020-06-04 16:26:13] [INFO ] Deduced a trap composed of 20 places in 211 ms
[2020-06-04 16:26:13] [INFO ] Deduced a trap composed of 21 places in 191 ms
[2020-06-04 16:26:13] [INFO ] Deduced a trap composed of 37 places in 204 ms
[2020-06-04 16:26:14] [INFO ] Deduced a trap composed of 21 places in 192 ms
[2020-06-04 16:26:14] [INFO ] Deduced a trap composed of 26 places in 328 ms
[2020-06-04 16:26:14] [INFO ] Deduced a trap composed of 20 places in 323 ms
[2020-06-04 16:26:15] [INFO ] Deduced a trap composed of 22 places in 318 ms
[2020-06-04 16:26:15] [INFO ] Deduced a trap composed of 25 places in 325 ms
[2020-06-04 16:26:15] [INFO ] Deduced a trap composed of 21 places in 305 ms
[2020-06-04 16:26:16] [INFO ] Deduced a trap composed of 22 places in 275 ms
[2020-06-04 16:26:16] [INFO ] Deduced a trap composed of 23 places in 275 ms
[2020-06-04 16:26:16] [INFO ] Deduced a trap composed of 29 places in 295 ms
[2020-06-04 16:26:17] [INFO ] Deduced a trap composed of 16 places in 344 ms
[2020-06-04 16:26:17] [INFO ] Deduced a trap composed of 17 places in 217 ms
[2020-06-04 16:26:17] [INFO ] Deduced a trap composed of 17 places in 181 ms
[2020-06-04 16:26:17] [INFO ] Deduced a trap composed of 13 places in 176 ms
[2020-06-04 16:26:18] [INFO ] Deduced a trap composed of 19 places in 293 ms
[2020-06-04 16:26:18] [INFO ] Deduced a trap composed of 32 places in 302 ms
[2020-06-04 16:26:18] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7298 ms
[2020-06-04 16:26:18] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints in 39 ms.
[2020-06-04 16:26:26] [INFO ] Added : 540 causal constraints over 113 iterations in 7983 ms. Result :unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 16:26:27] [INFO ] Flatten gal took : 227 ms
[2020-06-04 16:26:27] [INFO ] Flatten gal took : 58 ms
[2020-06-04 16:26:27] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 31 ms.
[2020-06-04 16:26:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldIIPs-PT-010B @ 3570 seconds
FORMULA ShieldIIPs-PT-010B-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-010B-CTLFireability-14 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: 10416896 kB
After kill :
MemTotal: 16427456 kB
MemFree: 14341372 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="ShieldIIPs-PT-010B"
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 ShieldIIPs-PT-010B, 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-159033477000132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010B.tgz
mv ShieldIIPs-PT-010B 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 '
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 ;