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.r210-tajo-159033475500308.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 itstools
Input is ShieldIIPt-PT-010B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475500308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 3.5K May 14 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 08:03 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 167K 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 ShieldIIPt-PT-010B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590580763131

[2020-05-27 11:59:25] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 11:59:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 11:59:25] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2020-05-27 11:59:25] [INFO ] Transformed 703 places.
[2020-05-27 11:59:25] [INFO ] Transformed 653 transitions.
[2020-05-27 11:59:25] [INFO ] Found NUPN structural information;
[2020-05-27 11:59:25] [INFO ] Parsed PT model containing 703 places and 653 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 42 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 327 ms. (steps per millisecond=305 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 653 rows 703 cols
[2020-05-27 11:59:25] [INFO ] Computed 91 place invariants in 15 ms
[2020-05-27 11:59:26] [INFO ] [Real]Absence check using 91 positive place invariants in 100 ms returned sat
[2020-05-27 11:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 11:59:27] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2020-05-27 11:59:27] [INFO ] Deduced a trap composed of 25 places in 324 ms
[2020-05-27 11:59:28] [INFO ] Deduced a trap composed of 17 places in 294 ms
[2020-05-27 11:59:28] [INFO ] Deduced a trap composed of 18 places in 246 ms
[2020-05-27 11:59:28] [INFO ] Deduced a trap composed of 21 places in 255 ms
[2020-05-27 11:59:29] [INFO ] Deduced a trap composed of 28 places in 230 ms
[2020-05-27 11:59:29] [INFO ] Deduced a trap composed of 21 places in 175 ms
[2020-05-27 11:59:29] [INFO ] Deduced a trap composed of 20 places in 341 ms
[2020-05-27 11:59:30] [INFO ] Deduced a trap composed of 31 places in 327 ms
[2020-05-27 11:59:30] [INFO ] Deduced a trap composed of 22 places in 285 ms
[2020-05-27 11:59:30] [INFO ] Deduced a trap composed of 19 places in 297 ms
[2020-05-27 11:59:30] [INFO ] Deduced a trap composed of 15 places in 226 ms
[2020-05-27 11:59:31] [INFO ] Deduced a trap composed of 21 places in 184 ms
[2020-05-27 11:59:31] [INFO ] Deduced a trap composed of 26 places in 344 ms
[2020-05-27 11:59:31] [INFO ] Deduced a trap composed of 24 places in 167 ms
[2020-05-27 11:59:31] [INFO ] Deduced a trap composed of 27 places in 265 ms
[2020-05-27 11:59:32] [INFO ] Deduced a trap composed of 21 places in 169 ms
[2020-05-27 11:59:32] [INFO ] Deduced a trap composed of 19 places in 173 ms
[2020-05-27 11:59:32] [INFO ] Deduced a trap composed of 21 places in 212 ms
[2020-05-27 11:59:35] [INFO ] Deduced a trap composed of 24 places in 3037 ms
[2020-05-27 11:59:36] [INFO ] Deduced a trap composed of 20 places in 888 ms
[2020-05-27 11:59:36] [INFO ] Deduced a trap composed of 23 places in 211 ms
[2020-05-27 11:59:37] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-05-27 11:59:38] [INFO ] Deduced a trap composed of 34 places in 1929 ms
[2020-05-27 11:59:39] [INFO ] Deduced a trap composed of 46 places in 165 ms
[2020-05-27 11:59:39] [INFO ] Deduced a trap composed of 29 places in 155 ms
[2020-05-27 11:59:39] [INFO ] Deduced a trap composed of 23 places in 137 ms
[2020-05-27 11:59:39] [INFO ] Deduced a trap composed of 28 places in 131 ms
[2020-05-27 11:59:39] [INFO ] Deduced a trap composed of 30 places in 126 ms
[2020-05-27 11:59:39] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 12417 ms
[2020-05-27 11:59:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 11:59:40] [INFO ] [Nat]Absence check using 91 positive place invariants in 96 ms returned sat
[2020-05-27 11:59:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 11:59:41] [INFO ] [Nat]Absence check using state equation in 922 ms returned sat
[2020-05-27 11:59:41] [INFO ] Deduced a trap composed of 19 places in 266 ms
[2020-05-27 11:59:41] [INFO ] Deduced a trap composed of 31 places in 219 ms
[2020-05-27 11:59:41] [INFO ] Deduced a trap composed of 24 places in 356 ms
[2020-05-27 11:59:42] [INFO ] Deduced a trap composed of 23 places in 205 ms
[2020-05-27 11:59:42] [INFO ] Deduced a trap composed of 24 places in 247 ms
[2020-05-27 11:59:42] [INFO ] Deduced a trap composed of 21 places in 192 ms
[2020-05-27 11:59:42] [INFO ] Deduced a trap composed of 25 places in 197 ms
[2020-05-27 11:59:43] [INFO ] Deduced a trap composed of 20 places in 225 ms
[2020-05-27 11:59:43] [INFO ] Deduced a trap composed of 15 places in 286 ms
[2020-05-27 11:59:43] [INFO ] Deduced a trap composed of 20 places in 185 ms
[2020-05-27 11:59:44] [INFO ] Deduced a trap composed of 19 places in 320 ms
[2020-05-27 11:59:44] [INFO ] Deduced a trap composed of 34 places in 218 ms
[2020-05-27 11:59:45] [INFO ] Deduced a trap composed of 23 places in 1344 ms
[2020-05-27 11:59:45] [INFO ] Deduced a trap composed of 22 places in 239 ms
[2020-05-27 11:59:46] [INFO ] Deduced a trap composed of 17 places in 223 ms
[2020-05-27 11:59:46] [INFO ] Deduced a trap composed of 19 places in 162 ms
[2020-05-27 11:59:46] [INFO ] Deduced a trap composed of 23 places in 127 ms
[2020-05-27 11:59:46] [INFO ] Deduced a trap composed of 21 places in 132 ms
[2020-05-27 11:59:46] [INFO ] Deduced a trap composed of 23 places in 131 ms
[2020-05-27 11:59:47] [INFO ] Deduced a trap composed of 28 places in 112 ms
[2020-05-27 11:59:47] [INFO ] Deduced a trap composed of 20 places in 134 ms
[2020-05-27 11:59:47] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6194 ms
[2020-05-27 11:59:47] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 67 ms.
[2020-05-27 11:59:56] [INFO ] Added : 635 causal constraints over 127 iterations in 9201 ms. Result :sat
[2020-05-27 11:59:56] [INFO ] [Real]Absence check using 91 positive place invariants in 157 ms returned sat
[2020-05-27 11:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 11:59:59] [INFO ] [Real]Absence check using state equation in 2101 ms returned sat
[2020-05-27 11:59:59] [INFO ] Deduced a trap composed of 21 places in 257 ms
[2020-05-27 11:59:59] [INFO ] Deduced a trap composed of 22 places in 331 ms
[2020-05-27 11:59:59] [INFO ] Deduced a trap composed of 19 places in 183 ms
[2020-05-27 12:00:00] [INFO ] Deduced a trap composed of 25 places in 174 ms
[2020-05-27 12:00:00] [INFO ] Deduced a trap composed of 21 places in 170 ms
[2020-05-27 12:00:00] [INFO ] Deduced a trap composed of 22 places in 197 ms
[2020-05-27 12:00:00] [INFO ] Deduced a trap composed of 31 places in 227 ms
[2020-05-27 12:00:01] [INFO ] Deduced a trap composed of 29 places in 211 ms
[2020-05-27 12:00:01] [INFO ] Deduced a trap composed of 17 places in 239 ms
[2020-05-27 12:00:01] [INFO ] Deduced a trap composed of 27 places in 242 ms
[2020-05-27 12:00:01] [INFO ] Deduced a trap composed of 37 places in 182 ms
[2020-05-27 12:00:02] [INFO ] Deduced a trap composed of 32 places in 186 ms
[2020-05-27 12:00:02] [INFO ] Deduced a trap composed of 24 places in 210 ms
[2020-05-27 12:00:02] [INFO ] Deduced a trap composed of 20 places in 179 ms
[2020-05-27 12:00:02] [INFO ] Deduced a trap composed of 15 places in 156 ms
[2020-05-27 12:00:02] [INFO ] Deduced a trap composed of 18 places in 170 ms
[2020-05-27 12:00:03] [INFO ] Deduced a trap composed of 19 places in 653 ms
[2020-05-27 12:00:03] [INFO ] Deduced a trap composed of 27 places in 155 ms
[2020-05-27 12:00:03] [INFO ] Deduced a trap composed of 25 places in 116 ms
[2020-05-27 12:00:04] [INFO ] Deduced a trap composed of 37 places in 674 ms
[2020-05-27 12:00:04] [INFO ] Deduced a trap composed of 26 places in 115 ms
[2020-05-27 12:00:04] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5772 ms
[2020-05-27 12:00:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:00:05] [INFO ] [Nat]Absence check using 91 positive place invariants in 562 ms returned sat
[2020-05-27 12:00:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:00:06] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2020-05-27 12:00:07] [INFO ] Deduced a trap composed of 26 places in 497 ms
[2020-05-27 12:00:07] [INFO ] Deduced a trap composed of 22 places in 260 ms
[2020-05-27 12:00:07] [INFO ] Deduced a trap composed of 19 places in 248 ms
[2020-05-27 12:00:08] [INFO ] Deduced a trap composed of 17 places in 241 ms
[2020-05-27 12:00:08] [INFO ] Deduced a trap composed of 19 places in 217 ms
[2020-05-27 12:00:08] [INFO ] Deduced a trap composed of 22 places in 251 ms
[2020-05-27 12:00:08] [INFO ] Deduced a trap composed of 23 places in 245 ms
[2020-05-27 12:00:09] [INFO ] Deduced a trap composed of 23 places in 210 ms
[2020-05-27 12:00:09] [INFO ] Deduced a trap composed of 23 places in 180 ms
[2020-05-27 12:00:09] [INFO ] Deduced a trap composed of 15 places in 190 ms
[2020-05-27 12:00:09] [INFO ] Deduced a trap composed of 30 places in 288 ms
[2020-05-27 12:00:10] [INFO ] Deduced a trap composed of 25 places in 220 ms
[2020-05-27 12:00:10] [INFO ] Deduced a trap composed of 19 places in 206 ms
[2020-05-27 12:00:10] [INFO ] Deduced a trap composed of 32 places in 178 ms
[2020-05-27 12:00:10] [INFO ] Deduced a trap composed of 24 places in 186 ms
[2020-05-27 12:00:10] [INFO ] Deduced a trap composed of 21 places in 183 ms
[2020-05-27 12:00:11] [INFO ] Deduced a trap composed of 30 places in 650 ms
[2020-05-27 12:00:11] [INFO ] Deduced a trap composed of 24 places in 228 ms
[2020-05-27 12:00:12] [INFO ] Deduced a trap composed of 21 places in 213 ms
[2020-05-27 12:00:12] [INFO ] Deduced a trap composed of 24 places in 450 ms
[2020-05-27 12:00:13] [INFO ] Deduced a trap composed of 18 places in 697 ms
[2020-05-27 12:00:13] [INFO ] Deduced a trap composed of 23 places in 242 ms
[2020-05-27 12:00:13] [INFO ] Deduced a trap composed of 26 places in 269 ms
[2020-05-27 12:00:14] [INFO ] Deduced a trap composed of 28 places in 191 ms
[2020-05-27 12:00:14] [INFO ] Deduced a trap composed of 34 places in 190 ms
[2020-05-27 12:00:14] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 7765 ms
[2020-05-27 12:00:14] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 41 ms.
[2020-05-27 12:00:21] [INFO ] Added : 644 causal constraints over 129 iterations in 7474 ms. Result :sat
[2020-05-27 12:00:22] [INFO ] [Real]Absence check using 91 positive place invariants in 564 ms returned sat
[2020-05-27 12:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:00:24] [INFO ] [Real]Absence check using state equation in 1525 ms returned sat
[2020-05-27 12:00:24] [INFO ] Deduced a trap composed of 31 places in 303 ms
[2020-05-27 12:00:24] [INFO ] Deduced a trap composed of 29 places in 295 ms
[2020-05-27 12:00:25] [INFO ] Deduced a trap composed of 25 places in 294 ms
[2020-05-27 12:00:25] [INFO ] Deduced a trap composed of 19 places in 261 ms
[2020-05-27 12:00:25] [INFO ] Deduced a trap composed of 17 places in 339 ms
[2020-05-27 12:00:26] [INFO ] Deduced a trap composed of 18 places in 309 ms
[2020-05-27 12:00:26] [INFO ] Deduced a trap composed of 15 places in 309 ms
[2020-05-27 12:00:26] [INFO ] Deduced a trap composed of 35 places in 273 ms
[2020-05-27 12:00:27] [INFO ] Deduced a trap composed of 19 places in 280 ms
[2020-05-27 12:00:27] [INFO ] Deduced a trap composed of 23 places in 669 ms
[2020-05-27 12:00:28] [INFO ] Deduced a trap composed of 17 places in 220 ms
[2020-05-27 12:00:29] [INFO ] Deduced a trap composed of 23 places in 854 ms
[2020-05-27 12:00:29] [INFO ] Deduced a trap composed of 36 places in 144 ms
[2020-05-27 12:00:29] [INFO ] Deduced a trap composed of 24 places in 458 ms
[2020-05-27 12:00:29] [INFO ] Deduced a trap composed of 20 places in 150 ms
[2020-05-27 12:00:30] [INFO ] Deduced a trap composed of 20 places in 179 ms
[2020-05-27 12:00:30] [INFO ] Deduced a trap composed of 25 places in 240 ms
[2020-05-27 12:00:30] [INFO ] Deduced a trap composed of 29 places in 230 ms
[2020-05-27 12:00:30] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-05-27 12:00:31] [INFO ] Deduced a trap composed of 22 places in 136 ms
[2020-05-27 12:00:31] [INFO ] Deduced a trap composed of 26 places in 207 ms
[2020-05-27 12:00:31] [INFO ] Deduced a trap composed of 33 places in 163 ms
[2020-05-27 12:00:31] [INFO ] Deduced a trap composed of 26 places in 134 ms
[2020-05-27 12:00:31] [INFO ] Deduced a trap composed of 20 places in 114 ms
[2020-05-27 12:00:31] [INFO ] Deduced a trap composed of 29 places in 96 ms
[2020-05-27 12:00:32] [INFO ] Deduced a trap composed of 37 places in 153 ms
[2020-05-27 12:00:32] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7812 ms
[2020-05-27 12:00:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:00:32] [INFO ] [Nat]Absence check using 91 positive place invariants in 87 ms returned sat
[2020-05-27 12:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:00:33] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2020-05-27 12:00:34] [INFO ] Deduced a trap composed of 23 places in 907 ms
[2020-05-27 12:00:34] [INFO ] Deduced a trap composed of 21 places in 164 ms
[2020-05-27 12:00:34] [INFO ] Deduced a trap composed of 19 places in 166 ms
[2020-05-27 12:00:34] [INFO ] Deduced a trap composed of 15 places in 157 ms
[2020-05-27 12:00:35] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2020-05-27 12:00:35] [INFO ] Deduced a trap composed of 31 places in 149 ms
[2020-05-27 12:00:35] [INFO ] Deduced a trap composed of 33 places in 303 ms
[2020-05-27 12:00:35] [INFO ] Deduced a trap composed of 23 places in 269 ms
[2020-05-27 12:00:36] [INFO ] Deduced a trap composed of 36 places in 208 ms
[2020-05-27 12:00:36] [INFO ] Deduced a trap composed of 25 places in 266 ms
[2020-05-27 12:00:36] [INFO ] Deduced a trap composed of 20 places in 219 ms
[2020-05-27 12:00:36] [INFO ] Deduced a trap composed of 35 places in 197 ms
[2020-05-27 12:00:37] [INFO ] Deduced a trap composed of 20 places in 260 ms
[2020-05-27 12:00:37] [INFO ] Deduced a trap composed of 22 places in 246 ms
[2020-05-27 12:00:37] [INFO ] Deduced a trap composed of 26 places in 239 ms
[2020-05-27 12:00:37] [INFO ] Deduced a trap composed of 21 places in 220 ms
[2020-05-27 12:00:38] [INFO ] Deduced a trap composed of 17 places in 206 ms
[2020-05-27 12:00:38] [INFO ] Deduced a trap composed of 18 places in 236 ms
[2020-05-27 12:00:38] [INFO ] Deduced a trap composed of 25 places in 222 ms
[2020-05-27 12:00:38] [INFO ] Deduced a trap composed of 23 places in 215 ms
[2020-05-27 12:00:39] [INFO ] Deduced a trap composed of 40 places in 194 ms
[2020-05-27 12:00:39] [INFO ] Deduced a trap composed of 34 places in 146 ms
[2020-05-27 12:00:39] [INFO ] Deduced a trap composed of 45 places in 147 ms
[2020-05-27 12:00:39] [INFO ] Deduced a trap composed of 33 places in 200 ms
[2020-05-27 12:00:39] [INFO ] Deduced a trap composed of 26 places in 179 ms
[2020-05-27 12:00:39] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6581 ms
[2020-05-27 12:00:39] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 35 ms.
[2020-05-27 12:00:49] [INFO ] Added : 644 causal constraints over 129 iterations in 9375 ms. Result :sat
[2020-05-27 12:00:49] [INFO ] Flatten gal took : 188 ms
[2020-05-27 12:00:49] [INFO ] Flatten gal took : 79 ms
[2020-05-27 12:00:50] [INFO ] Applying decomposition
[2020-05-27 12:00:50] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph4239653610226116310.txt, -o, /tmp/graph4239653610226116310.bin, -w, /tmp/graph4239653610226116310.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4239653610226116310.bin, -l, -1, -v, -w, /tmp/graph4239653610226116310.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 12:00:50] [INFO ] Decomposing Gal with order
[2020-05-27 12:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:00:50] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-27 12:00:50] [INFO ] Flatten gal took : 143 ms
[2020-05-27 12:00:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-27 12:00:50] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 23 ms
[2020-05-27 12:00:50] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 41 ordering constraints for composite.
built 6 ordering constraints for composite.
built 29 ordering constraints for composite.
built 10 ordering constraints for composite.
built 21 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 25 ordering constraints for composite.
built 26 ordering constraints for composite.
built 10 ordering constraints for composite.
built 32 ordering constraints for composite.
built 10 ordering constraints for composite.
built 35 ordering constraints for composite.
built 10 ordering constraints for composite.
built 32 ordering constraints for composite.
built 10 ordering constraints for composite.
built 32 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 32 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 25 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 12:21:21] [INFO ] Applying decomposition
[2020-05-27 12:21:21] [INFO ] Flatten gal took : 301 ms
[2020-05-27 12:21:22] [INFO ] Decomposing Gal with order
[2020-05-27 12:21:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:21:23] [INFO ] Flatten gal took : 762 ms
[2020-05-27 12:21:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2020-05-27 12:21:23] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 58 ms
[2020-05-27 12:21:23] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 2 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 12:41:54] [INFO ] Flatten gal took : 1160 ms
[2020-05-27 12:41:55] [INFO ] Input system was already deterministic with 653 transitions.
[2020-05-27 12:41:55] [INFO ] Transformed 703 places.
[2020-05-27 12:41:55] [INFO ] Transformed 653 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-27 12:41:55] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2020-05-27 12:41:55] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ShieldIIPt-PT-010B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPt-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 r210-tajo-159033475500308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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