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

About the Execution of ITS-LoLa for ShieldPPPs-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.950 3600000.00 4144202.00 1086.30 F?F??FT??FF?T?FT 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-159033477500484.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 ShieldPPPs-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-159033477500484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 3.7K May 14 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K 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 13:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:38 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 172K 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 ShieldPPPs-PT-010B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591309000509

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 22:16:41] [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 22:16:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 22:16:42] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-06-04 22:16:42] [INFO ] Transformed 683 places.
[2020-06-04 22:16:42] [INFO ] Transformed 633 transitions.
[2020-06-04 22:16:42] [INFO ] Found NUPN structural information;
[2020-06-04 22:16:42] [INFO ] Parsed PT model containing 683 places and 633 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Incomplete random walk after 100000 steps, including 61 resets, run finished after 366 ms. (steps per millisecond=273 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 633 rows 683 cols
[2020-06-04 22:16:42] [INFO ] Computed 111 place invariants in 19 ms
[2020-06-04 22:16:42] [INFO ] [Real]Absence check using 111 positive place invariants in 66 ms returned sat
[2020-06-04 22:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:16:43] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2020-06-04 22:16:44] [INFO ] Deduced a trap composed of 21 places in 258 ms
[2020-06-04 22:16:44] [INFO ] Deduced a trap composed of 19 places in 275 ms
[2020-06-04 22:16:44] [INFO ] Deduced a trap composed of 21 places in 234 ms
[2020-06-04 22:16:44] [INFO ] Deduced a trap composed of 18 places in 222 ms
[2020-06-04 22:16:45] [INFO ] Deduced a trap composed of 19 places in 227 ms
[2020-06-04 22:16:45] [INFO ] Deduced a trap composed of 19 places in 223 ms
[2020-06-04 22:16:45] [INFO ] Deduced a trap composed of 34 places in 222 ms
[2020-06-04 22:16:45] [INFO ] Deduced a trap composed of 28 places in 231 ms
[2020-06-04 22:16:46] [INFO ] Deduced a trap composed of 22 places in 217 ms
[2020-06-04 22:16:46] [INFO ] Deduced a trap composed of 24 places in 212 ms
[2020-06-04 22:16:46] [INFO ] Deduced a trap composed of 22 places in 200 ms
[2020-06-04 22:16:46] [INFO ] Deduced a trap composed of 22 places in 192 ms
[2020-06-04 22:16:47] [INFO ] Deduced a trap composed of 22 places in 195 ms
[2020-06-04 22:16:47] [INFO ] Deduced a trap composed of 27 places in 167 ms
[2020-06-04 22:16:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3541 ms
[2020-06-04 22:16:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:16:47] [INFO ] [Nat]Absence check using 111 positive place invariants in 188 ms returned sat
[2020-06-04 22:16:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:16:48] [INFO ] [Nat]Absence check using state equation in 789 ms returned sat
[2020-06-04 22:16:48] [INFO ] Deduced a trap composed of 10 places in 241 ms
[2020-06-04 22:16:48] [INFO ] Deduced a trap composed of 20 places in 215 ms
[2020-06-04 22:16:49] [INFO ] Deduced a trap composed of 24 places in 215 ms
[2020-06-04 22:16:49] [INFO ] Deduced a trap composed of 25 places in 238 ms
[2020-06-04 22:16:49] [INFO ] Deduced a trap composed of 22 places in 205 ms
[2020-06-04 22:16:49] [INFO ] Deduced a trap composed of 22 places in 214 ms
[2020-06-04 22:16:50] [INFO ] Deduced a trap composed of 18 places in 180 ms
[2020-06-04 22:16:50] [INFO ] Deduced a trap composed of 20 places in 150 ms
[2020-06-04 22:16:50] [INFO ] Deduced a trap composed of 22 places in 159 ms
[2020-06-04 22:16:50] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-06-04 22:16:50] [INFO ] Deduced a trap composed of 22 places in 151 ms
[2020-06-04 22:16:51] [INFO ] Deduced a trap composed of 21 places in 173 ms
[2020-06-04 22:16:51] [INFO ] Deduced a trap composed of 38 places in 155 ms
[2020-06-04 22:16:51] [INFO ] Deduced a trap composed of 22 places in 161 ms
[2020-06-04 22:16:51] [INFO ] Deduced a trap composed of 25 places in 150 ms
[2020-06-04 22:16:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3252 ms
[2020-06-04 22:16:51] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 55 ms.
[2020-06-04 22:16:57] [INFO ] Added : 613 causal constraints over 125 iterations in 5589 ms. Result :sat
[2020-06-04 22:16:57] [INFO ] [Real]Absence check using 111 positive place invariants in 48 ms returned unsat
[2020-06-04 22:16:57] [INFO ] [Real]Absence check using 111 positive place invariants in 76 ms returned sat
[2020-06-04 22:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:16:58] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2020-06-04 22:16:58] [INFO ] Deduced a trap composed of 22 places in 264 ms
[2020-06-04 22:16:59] [INFO ] Deduced a trap composed of 26 places in 226 ms
[2020-06-04 22:16:59] [INFO ] Deduced a trap composed of 20 places in 215 ms
[2020-06-04 22:16:59] [INFO ] Deduced a trap composed of 23 places in 203 ms
[2020-06-04 22:16:59] [INFO ] Deduced a trap composed of 27 places in 196 ms
[2020-06-04 22:17:00] [INFO ] Deduced a trap composed of 25 places in 192 ms
[2020-06-04 22:17:00] [INFO ] Deduced a trap composed of 16 places in 231 ms
[2020-06-04 22:17:00] [INFO ] Deduced a trap composed of 25 places in 228 ms
[2020-06-04 22:17:00] [INFO ] Deduced a trap composed of 27 places in 225 ms
[2020-06-04 22:17:01] [INFO ] Deduced a trap composed of 27 places in 216 ms
[2020-06-04 22:17:01] [INFO ] Deduced a trap composed of 25 places in 205 ms
[2020-06-04 22:17:01] [INFO ] Deduced a trap composed of 21 places in 202 ms
[2020-06-04 22:17:01] [INFO ] Deduced a trap composed of 26 places in 175 ms
[2020-06-04 22:17:02] [INFO ] Deduced a trap composed of 27 places in 175 ms
[2020-06-04 22:17:02] [INFO ] Deduced a trap composed of 18 places in 189 ms
[2020-06-04 22:17:02] [INFO ] Deduced a trap composed of 18 places in 180 ms
[2020-06-04 22:17:02] [INFO ] Deduced a trap composed of 25 places in 174 ms
[2020-06-04 22:17:02] [INFO ] Deduced a trap composed of 29 places in 169 ms
[2020-06-04 22:17:03] [INFO ] Deduced a trap composed of 34 places in 163 ms
[2020-06-04 22:17:03] [INFO ] Deduced a trap composed of 26 places in 154 ms
[2020-06-04 22:17:03] [INFO ] Deduced a trap composed of 29 places in 160 ms
[2020-06-04 22:17:03] [INFO ] Deduced a trap composed of 20 places in 177 ms
[2020-06-04 22:17:03] [INFO ] Deduced a trap composed of 24 places in 197 ms
[2020-06-04 22:17:04] [INFO ] Deduced a trap composed of 31 places in 151 ms
[2020-06-04 22:17:04] [INFO ] Deduced a trap composed of 27 places in 127 ms
[2020-06-04 22:17:04] [INFO ] Deduced a trap composed of 23 places in 124 ms
[2020-06-04 22:17:04] [INFO ] Deduced a trap composed of 39 places in 134 ms
[2020-06-04 22:17:04] [INFO ] Deduced a trap composed of 24 places in 127 ms
[2020-06-04 22:17:04] [INFO ] Deduced a trap composed of 28 places in 152 ms
[2020-06-04 22:17:04] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6162 ms
[2020-06-04 22:17:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:17:05] [INFO ] [Nat]Absence check using 111 positive place invariants in 127 ms returned sat
[2020-06-04 22:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:17:05] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2020-06-04 22:17:06] [INFO ] Deduced a trap composed of 17 places in 267 ms
[2020-06-04 22:17:06] [INFO ] Deduced a trap composed of 18 places in 247 ms
[2020-06-04 22:17:06] [INFO ] Deduced a trap composed of 23 places in 227 ms
[2020-06-04 22:17:06] [INFO ] Deduced a trap composed of 33 places in 213 ms
[2020-06-04 22:17:07] [INFO ] Deduced a trap composed of 30 places in 219 ms
[2020-06-04 22:17:07] [INFO ] Deduced a trap composed of 28 places in 206 ms
[2020-06-04 22:17:07] [INFO ] Deduced a trap composed of 22 places in 197 ms
[2020-06-04 22:17:07] [INFO ] Deduced a trap composed of 17 places in 155 ms
[2020-06-04 22:17:07] [INFO ] Deduced a trap composed of 22 places in 157 ms
[2020-06-04 22:17:08] [INFO ] Deduced a trap composed of 24 places in 143 ms
[2020-06-04 22:17:08] [INFO ] Deduced a trap composed of 27 places in 141 ms
[2020-06-04 22:17:08] [INFO ] Deduced a trap composed of 38 places in 139 ms
[2020-06-04 22:17:08] [INFO ] Deduced a trap composed of 17 places in 139 ms
[2020-06-04 22:17:08] [INFO ] Deduced a trap composed of 30 places in 128 ms
[2020-06-04 22:17:08] [INFO ] Deduced a trap composed of 29 places in 129 ms
[2020-06-04 22:17:09] [INFO ] Deduced a trap composed of 23 places in 131 ms
[2020-06-04 22:17:09] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-06-04 22:17:09] [INFO ] Deduced a trap composed of 27 places in 121 ms
[2020-06-04 22:17:09] [INFO ] Deduced a trap composed of 29 places in 117 ms
[2020-06-04 22:17:09] [INFO ] Deduced a trap composed of 24 places in 110 ms
[2020-06-04 22:17:09] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2020-06-04 22:17:09] [INFO ] Deduced a trap composed of 22 places in 108 ms
[2020-06-04 22:17:09] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4027 ms
[2020-06-04 22:17:09] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 38 ms.
[2020-06-04 22:17:14] [INFO ] Added : 618 causal constraints over 125 iterations in 4676 ms. Result :sat
[2020-06-04 22:17:14] [INFO ] [Real]Absence check using 111 positive place invariants in 56 ms returned sat
[2020-06-04 22:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:17:15] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2020-06-04 22:17:15] [INFO ] Deduced a trap composed of 18 places in 247 ms
[2020-06-04 22:17:16] [INFO ] Deduced a trap composed of 34 places in 216 ms
[2020-06-04 22:17:16] [INFO ] Deduced a trap composed of 35 places in 216 ms
[2020-06-04 22:17:16] [INFO ] Deduced a trap composed of 17 places in 213 ms
[2020-06-04 22:17:16] [INFO ] Deduced a trap composed of 21 places in 199 ms
[2020-06-04 22:17:17] [INFO ] Deduced a trap composed of 17 places in 222 ms
[2020-06-04 22:17:17] [INFO ] Deduced a trap composed of 35 places in 182 ms
[2020-06-04 22:17:17] [INFO ] Deduced a trap composed of 22 places in 181 ms
[2020-06-04 22:17:17] [INFO ] Deduced a trap composed of 25 places in 204 ms
[2020-06-04 22:17:17] [INFO ] Deduced a trap composed of 17 places in 242 ms
[2020-06-04 22:17:18] [INFO ] Deduced a trap composed of 33 places in 244 ms
[2020-06-04 22:17:18] [INFO ] Deduced a trap composed of 23 places in 230 ms
[2020-06-04 22:17:18] [INFO ] Deduced a trap composed of 19 places in 230 ms
[2020-06-04 22:17:18] [INFO ] Deduced a trap composed of 19 places in 200 ms
[2020-06-04 22:17:19] [INFO ] Deduced a trap composed of 50 places in 155 ms
[2020-06-04 22:17:19] [INFO ] Deduced a trap composed of 25 places in 187 ms
[2020-06-04 22:17:19] [INFO ] Deduced a trap composed of 22 places in 148 ms
[2020-06-04 22:17:19] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-04 22:17:19] [INFO ] Deduced a trap composed of 21 places in 140 ms
[2020-06-04 22:17:20] [INFO ] Deduced a trap composed of 26 places in 182 ms
[2020-06-04 22:17:20] [INFO ] Deduced a trap composed of 24 places in 117 ms
[2020-06-04 22:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 21 trap constraints in 4568 ms
[2020-06-04 22:17:20] [INFO ] [Real]Absence check using 111 positive place invariants in 53 ms returned sat
[2020-06-04 22:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:17:21] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2020-06-04 22:17:21] [INFO ] Deduced a trap composed of 29 places in 284 ms
[2020-06-04 22:17:21] [INFO ] Deduced a trap composed of 22 places in 215 ms
[2020-06-04 22:17:21] [INFO ] Deduced a trap composed of 17 places in 265 ms
[2020-06-04 22:17:22] [INFO ] Deduced a trap composed of 22 places in 233 ms
[2020-06-04 22:17:22] [INFO ] Deduced a trap composed of 19 places in 246 ms
[2020-06-04 22:17:22] [INFO ] Deduced a trap composed of 23 places in 242 ms
[2020-06-04 22:17:22] [INFO ] Deduced a trap composed of 24 places in 226 ms
[2020-06-04 22:17:23] [INFO ] Deduced a trap composed of 30 places in 221 ms
[2020-06-04 22:17:23] [INFO ] Deduced a trap composed of 22 places in 243 ms
[2020-06-04 22:17:23] [INFO ] Deduced a trap composed of 23 places in 224 ms
[2020-06-04 22:17:24] [INFO ] Deduced a trap composed of 24 places in 244 ms
[2020-06-04 22:17:24] [INFO ] Deduced a trap composed of 19 places in 218 ms
[2020-06-04 22:17:24] [INFO ] Deduced a trap composed of 33 places in 185 ms
[2020-06-04 22:17:24] [INFO ] Deduced a trap composed of 32 places in 142 ms
[2020-06-04 22:17:24] [INFO ] Deduced a trap composed of 29 places in 218 ms
[2020-06-04 22:17:25] [INFO ] Deduced a trap composed of 36 places in 203 ms
[2020-06-04 22:17:25] [INFO ] Deduced a trap composed of 41 places in 165 ms
[2020-06-04 22:17:25] [INFO ] Deduced a trap composed of 94 places in 173 ms
[2020-06-04 22:17:25] [INFO ] Deduced a trap composed of 50 places in 196 ms
[2020-06-04 22:17:25] [INFO ] Deduced a trap composed of 25 places in 188 ms
[2020-06-04 22:17:26] [INFO ] Deduced a trap composed of 44 places in 187 ms
[2020-06-04 22:17:26] [INFO ] Deduced a trap composed of 41 places in 175 ms
[2020-06-04 22:17:26] [INFO ] Deduced a trap composed of 25 places in 99 ms
[2020-06-04 22:17:26] [INFO ] Deduced a trap composed of 40 places in 87 ms
[2020-06-04 22:17:26] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5521 ms
[2020-06-04 22:17:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:17:26] [INFO ] [Nat]Absence check using 111 positive place invariants in 113 ms returned sat
[2020-06-04 22:17:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:17:27] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2020-06-04 22:17:27] [INFO ] Deduced a trap composed of 22 places in 169 ms
[2020-06-04 22:17:28] [INFO ] Deduced a trap composed of 27 places in 236 ms
[2020-06-04 22:17:28] [INFO ] Deduced a trap composed of 10 places in 161 ms
[2020-06-04 22:17:28] [INFO ] Deduced a trap composed of 27 places in 168 ms
[2020-06-04 22:17:28] [INFO ] Deduced a trap composed of 18 places in 223 ms
[2020-06-04 22:17:28] [INFO ] Deduced a trap composed of 24 places in 197 ms
[2020-06-04 22:17:29] [INFO ] Deduced a trap composed of 23 places in 230 ms
[2020-06-04 22:17:29] [INFO ] Deduced a trap composed of 21 places in 230 ms
[2020-06-04 22:17:29] [INFO ] Deduced a trap composed of 33 places in 223 ms
[2020-06-04 22:17:29] [INFO ] Deduced a trap composed of 23 places in 172 ms
[2020-06-04 22:17:30] [INFO ] Deduced a trap composed of 23 places in 164 ms
[2020-06-04 22:17:30] [INFO ] Deduced a trap composed of 18 places in 229 ms
[2020-06-04 22:17:30] [INFO ] Deduced a trap composed of 17 places in 179 ms
[2020-06-04 22:17:30] [INFO ] Deduced a trap composed of 19 places in 173 ms
[2020-06-04 22:17:31] [INFO ] Deduced a trap composed of 27 places in 241 ms
[2020-06-04 22:17:31] [INFO ] Deduced a trap composed of 35 places in 230 ms
[2020-06-04 22:17:31] [INFO ] Deduced a trap composed of 29 places in 222 ms
[2020-06-04 22:17:31] [INFO ] Deduced a trap composed of 39 places in 224 ms
[2020-06-04 22:17:32] [INFO ] Deduced a trap composed of 24 places in 243 ms
[2020-06-04 22:17:32] [INFO ] Deduced a trap composed of 22 places in 218 ms
[2020-06-04 22:17:32] [INFO ] Deduced a trap composed of 25 places in 246 ms
[2020-06-04 22:17:32] [INFO ] Deduced a trap composed of 30 places in 242 ms
[2020-06-04 22:17:33] [INFO ] Deduced a trap composed of 41 places in 232 ms
[2020-06-04 22:17:33] [INFO ] Deduced a trap composed of 28 places in 219 ms
[2020-06-04 22:17:33] [INFO ] Deduced a trap composed of 42 places in 220 ms
[2020-06-04 22:17:33] [INFO ] Deduced a trap composed of 34 places in 220 ms
[2020-06-04 22:17:34] [INFO ] Deduced a trap composed of 46 places in 212 ms
[2020-06-04 22:17:34] [INFO ] Deduced a trap composed of 28 places in 209 ms
[2020-06-04 22:17:34] [INFO ] Deduced a trap composed of 26 places in 230 ms
[2020-06-04 22:17:34] [INFO ] Deduced a trap composed of 25 places in 234 ms
[2020-06-04 22:17:35] [INFO ] Deduced a trap composed of 46 places in 178 ms
[2020-06-04 22:17:35] [INFO ] Deduced a trap composed of 44 places in 189 ms
[2020-06-04 22:17:35] [INFO ] Deduced a trap composed of 45 places in 184 ms
[2020-06-04 22:17:35] [INFO ] Deduced a trap composed of 21 places in 198 ms
[2020-06-04 22:17:35] [INFO ] Deduced a trap composed of 55 places in 189 ms
[2020-06-04 22:17:36] [INFO ] Deduced a trap composed of 28 places in 199 ms
[2020-06-04 22:17:36] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8442 ms
[2020-06-04 22:17:36] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 42 ms.
[2020-06-04 22:17:42] [INFO ] Added : 618 causal constraints over 125 iterations in 5990 ms. Result :sat
[2020-06-04 22:17:42] [INFO ] [Real]Absence check using 111 positive place invariants in 74 ms returned sat
[2020-06-04 22:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:17:43] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2020-06-04 22:17:43] [INFO ] Deduced a trap composed of 23 places in 224 ms
[2020-06-04 22:17:43] [INFO ] Deduced a trap composed of 21 places in 205 ms
[2020-06-04 22:17:43] [INFO ] Deduced a trap composed of 16 places in 188 ms
[2020-06-04 22:17:44] [INFO ] Deduced a trap composed of 17 places in 264 ms
[2020-06-04 22:17:44] [INFO ] Deduced a trap composed of 19 places in 198 ms
[2020-06-04 22:17:44] [INFO ] Deduced a trap composed of 23 places in 182 ms
[2020-06-04 22:17:44] [INFO ] Deduced a trap composed of 30 places in 185 ms
[2020-06-04 22:17:45] [INFO ] Deduced a trap composed of 29 places in 184 ms
[2020-06-04 22:17:45] [INFO ] Deduced a trap composed of 34 places in 188 ms
[2020-06-04 22:17:45] [INFO ] Deduced a trap composed of 29 places in 180 ms
[2020-06-04 22:17:45] [INFO ] Deduced a trap composed of 34 places in 178 ms
[2020-06-04 22:17:45] [INFO ] Deduced a trap composed of 33 places in 174 ms
[2020-06-04 22:17:46] [INFO ] Deduced a trap composed of 30 places in 208 ms
[2020-06-04 22:17:46] [INFO ] Deduced a trap composed of 26 places in 222 ms
[2020-06-04 22:17:46] [INFO ] Deduced a trap composed of 22 places in 214 ms
[2020-06-04 22:17:47] [INFO ] Deduced a trap composed of 31 places in 313 ms
[2020-06-04 22:17:47] [INFO ] Deduced a trap composed of 24 places in 212 ms
[2020-06-04 22:17:47] [INFO ] Deduced a trap composed of 17 places in 247 ms
[2020-06-04 22:17:47] [INFO ] Deduced a trap composed of 32 places in 214 ms
[2020-06-04 22:17:48] [INFO ] Deduced a trap composed of 32 places in 212 ms
[2020-06-04 22:17:48] [INFO ] Deduced a trap composed of 28 places in 236 ms
[2020-06-04 22:17:48] [INFO ] Deduced a trap composed of 21 places in 206 ms
[2020-06-04 22:17:48] [INFO ] Deduced a trap composed of 22 places in 203 ms
[2020-06-04 22:17:49] [INFO ] Deduced a trap composed of 39 places in 232 ms
[2020-06-04 22:17:49] [INFO ] Deduced a trap composed of 26 places in 227 ms
[2020-06-04 22:17:49] [INFO ] Deduced a trap composed of 36 places in 201 ms
[2020-06-04 22:17:49] [INFO ] Deduced a trap composed of 57 places in 183 ms
[2020-06-04 22:17:49] [INFO ] Deduced a trap composed of 26 places in 136 ms
[2020-06-04 22:17:50] [INFO ] Deduced a trap composed of 39 places in 127 ms
[2020-06-04 22:17:50] [INFO ] Deduced a trap composed of 25 places in 127 ms
[2020-06-04 22:17:50] [INFO ] Deduced a trap composed of 24 places in 146 ms
[2020-06-04 22:17:50] [INFO ] Deduced a trap composed of 40 places in 145 ms
[2020-06-04 22:17:50] [INFO ] Deduced a trap composed of 32 places in 117 ms
[2020-06-04 22:17:50] [INFO ] Deduced a trap composed of 31 places in 149 ms
[2020-06-04 22:17:51] [INFO ] Deduced a trap composed of 38 places in 133 ms
[2020-06-04 22:17:51] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7800 ms
[2020-06-04 22:17:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:17:51] [INFO ] [Nat]Absence check using 111 positive place invariants in 139 ms returned sat
[2020-06-04 22:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:17:52] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2020-06-04 22:17:52] [INFO ] Deduced a trap composed of 30 places in 257 ms
[2020-06-04 22:17:52] [INFO ] Deduced a trap composed of 21 places in 235 ms
[2020-06-04 22:17:52] [INFO ] Deduced a trap composed of 28 places in 211 ms
[2020-06-04 22:17:53] [INFO ] Deduced a trap composed of 17 places in 225 ms
[2020-06-04 22:17:53] [INFO ] Deduced a trap composed of 19 places in 225 ms
[2020-06-04 22:17:53] [INFO ] Deduced a trap composed of 23 places in 225 ms
[2020-06-04 22:17:53] [INFO ] Deduced a trap composed of 56 places in 226 ms
[2020-06-04 22:17:54] [INFO ] Deduced a trap composed of 28 places in 212 ms
[2020-06-04 22:17:54] [INFO ] Deduced a trap composed of 17 places in 198 ms
[2020-06-04 22:17:54] [INFO ] Deduced a trap composed of 19 places in 197 ms
[2020-06-04 22:17:54] [INFO ] Deduced a trap composed of 29 places in 193 ms
[2020-06-04 22:17:55] [INFO ] Deduced a trap composed of 36 places in 195 ms
[2020-06-04 22:17:55] [INFO ] Deduced a trap composed of 27 places in 180 ms
[2020-06-04 22:17:55] [INFO ] Deduced a trap composed of 29 places in 178 ms
[2020-06-04 22:17:55] [INFO ] Deduced a trap composed of 10 places in 198 ms
[2020-06-04 22:17:55] [INFO ] Deduced a trap composed of 17 places in 230 ms
[2020-06-04 22:17:56] [INFO ] Deduced a trap composed of 23 places in 224 ms
[2020-06-04 22:17:56] [INFO ] Deduced a trap composed of 26 places in 208 ms
[2020-06-04 22:17:56] [INFO ] Deduced a trap composed of 25 places in 197 ms
[2020-06-04 22:17:56] [INFO ] Deduced a trap composed of 30 places in 196 ms
[2020-06-04 22:17:57] [INFO ] Deduced a trap composed of 30 places in 183 ms
[2020-06-04 22:17:57] [INFO ] Deduced a trap composed of 24 places in 146 ms
[2020-06-04 22:17:57] [INFO ] Deduced a trap composed of 32 places in 174 ms
[2020-06-04 22:17:57] [INFO ] Deduced a trap composed of 25 places in 224 ms
[2020-06-04 22:17:57] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2020-06-04 22:17:58] [INFO ] Deduced a trap composed of 33 places in 189 ms
[2020-06-04 22:17:58] [INFO ] Deduced a trap composed of 22 places in 188 ms
[2020-06-04 22:17:58] [INFO ] Deduced a trap composed of 24 places in 168 ms
[2020-06-04 22:17:58] [INFO ] Deduced a trap composed of 25 places in 207 ms
[2020-06-04 22:17:58] [INFO ] Deduced a trap composed of 23 places in 191 ms
[2020-06-04 22:17:59] [INFO ] Deduced a trap composed of 34 places in 161 ms
[2020-06-04 22:17:59] [INFO ] Deduced a trap composed of 36 places in 151 ms
[2020-06-04 22:17:59] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-06-04 22:17:59] [INFO ] Deduced a trap composed of 19 places in 200 ms
[2020-06-04 22:17:59] [INFO ] Deduced a trap composed of 28 places in 157 ms
[2020-06-04 22:17:59] [INFO ] Deduced a trap composed of 22 places in 144 ms
[2020-06-04 22:18:00] [INFO ] Deduced a trap composed of 35 places in 136 ms
[2020-06-04 22:18:00] [INFO ] Deduced a trap composed of 29 places in 200 ms
[2020-06-04 22:18:00] [INFO ] Deduced a trap composed of 21 places in 145 ms
[2020-06-04 22:18:00] [INFO ] Deduced a trap composed of 28 places in 103 ms
[2020-06-04 22:18:00] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2020-06-04 22:18:00] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 8582 ms
[2020-06-04 22:18:00] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 61 ms.
[2020-06-04 22:18:06] [INFO ] Added : 622 causal constraints over 129 iterations in 6013 ms. Result :sat
[2020-06-04 22:18:06] [INFO ] Deduced a trap composed of 32 places in 113 ms
[2020-06-04 22:18:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 22:18:07] [INFO ] Flatten gal took : 98 ms
[2020-06-04 22:18:07] [INFO ] Flatten gal took : 41 ms
[2020-06-04 22:18:07] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-04 22:18:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldPPPs-PT-010B @ 3570 seconds

FORMULA ShieldPPPs-PT-010B-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-CTLFireability-10 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: 9207584 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16137692 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="ShieldPPPs-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 ShieldPPPs-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-159033477500484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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