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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.980 3600000.00 3485558.00 156374.30 [undef] Time out reached

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-159033475800484.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 ShieldPPPs-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-159033475800484
=====================================================================

--------------------
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 1590595320902

[2020-05-27 16:02:02] [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 16:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 16:02:02] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2020-05-27 16:02:02] [INFO ] Transformed 683 places.
[2020-05-27 16:02:02] [INFO ] Transformed 633 transitions.
[2020-05-27 16:02:02] [INFO ] Found NUPN structural information;
[2020-05-27 16:02:02] [INFO ] Parsed PT model containing 683 places and 633 transitions in 132 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Incomplete random walk after 100000 steps, including 60 resets, run finished after 403 ms. (steps per millisecond=248 ) 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-05-27 16:02:03] [INFO ] Computed 111 place invariants in 28 ms
[2020-05-27 16:02:03] [INFO ] [Real]Absence check using 111 positive place invariants in 69 ms returned sat
[2020-05-27 16:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:02:04] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2020-05-27 16:02:04] [INFO ] Deduced a trap composed of 21 places in 285 ms
[2020-05-27 16:02:05] [INFO ] Deduced a trap composed of 19 places in 219 ms
[2020-05-27 16:02:05] [INFO ] Deduced a trap composed of 21 places in 195 ms
[2020-05-27 16:02:05] [INFO ] Deduced a trap composed of 18 places in 192 ms
[2020-05-27 16:02:05] [INFO ] Deduced a trap composed of 19 places in 191 ms
[2020-05-27 16:02:05] [INFO ] Deduced a trap composed of 19 places in 227 ms
[2020-05-27 16:02:06] [INFO ] Deduced a trap composed of 34 places in 287 ms
[2020-05-27 16:02:06] [INFO ] Deduced a trap composed of 28 places in 220 ms
[2020-05-27 16:02:06] [INFO ] Deduced a trap composed of 22 places in 261 ms
[2020-05-27 16:02:07] [INFO ] Deduced a trap composed of 24 places in 256 ms
[2020-05-27 16:02:07] [INFO ] Deduced a trap composed of 22 places in 222 ms
[2020-05-27 16:02:07] [INFO ] Deduced a trap composed of 22 places in 196 ms
[2020-05-27 16:02:07] [INFO ] Deduced a trap composed of 22 places in 181 ms
[2020-05-27 16:02:07] [INFO ] Deduced a trap composed of 27 places in 169 ms
[2020-05-27 16:02:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3515 ms
[2020-05-27 16:02:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:02:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 247 ms returned sat
[2020-05-27 16:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:02:09] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2020-05-27 16:02:09] [INFO ] Deduced a trap composed of 10 places in 241 ms
[2020-05-27 16:02:09] [INFO ] Deduced a trap composed of 20 places in 250 ms
[2020-05-27 16:02:10] [INFO ] Deduced a trap composed of 24 places in 243 ms
[2020-05-27 16:02:10] [INFO ] Deduced a trap composed of 25 places in 273 ms
[2020-05-27 16:02:11] [INFO ] Deduced a trap composed of 22 places in 630 ms
[2020-05-27 16:02:11] [INFO ] Deduced a trap composed of 22 places in 190 ms
[2020-05-27 16:02:11] [INFO ] Deduced a trap composed of 18 places in 189 ms
[2020-05-27 16:02:11] [INFO ] Deduced a trap composed of 20 places in 190 ms
[2020-05-27 16:02:12] [INFO ] Deduced a trap composed of 22 places in 180 ms
[2020-05-27 16:02:12] [INFO ] Deduced a trap composed of 18 places in 157 ms
[2020-05-27 16:02:12] [INFO ] Deduced a trap composed of 22 places in 189 ms
[2020-05-27 16:02:12] [INFO ] Deduced a trap composed of 21 places in 488 ms
[2020-05-27 16:02:13] [INFO ] Deduced a trap composed of 38 places in 157 ms
[2020-05-27 16:02:13] [INFO ] Deduced a trap composed of 22 places in 138 ms
[2020-05-27 16:02:13] [INFO ] Deduced a trap composed of 25 places in 147 ms
[2020-05-27 16:02:13] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4172 ms
[2020-05-27 16:02:13] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 41 ms.
[2020-05-27 16:02:20] [INFO ] Added : 613 causal constraints over 125 iterations in 7057 ms. Result :sat
[2020-05-27 16:02:20] [INFO ] [Real]Absence check using 111 positive place invariants in 49 ms returned unsat
[2020-05-27 16:02:21] [INFO ] [Real]Absence check using 111 positive place invariants in 76 ms returned sat
[2020-05-27 16:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:02:22] [INFO ] [Real]Absence check using state equation in 1342 ms returned sat
[2020-05-27 16:02:25] [INFO ] Deduced a trap composed of 22 places in 2986 ms
[2020-05-27 16:02:29] [INFO ] Deduced a trap composed of 26 places in 4375 ms
[2020-05-27 16:02:31] [INFO ] Deduced a trap composed of 20 places in 1961 ms
[2020-05-27 16:02:34] [INFO ] Deduced a trap composed of 23 places in 2304 ms
[2020-05-27 16:02:34] [INFO ] Deduced a trap composed of 27 places in 248 ms
[2020-05-27 16:02:34] [INFO ] Deduced a trap composed of 25 places in 193 ms
[2020-05-27 16:02:34] [INFO ] Deduced a trap composed of 16 places in 188 ms
[2020-05-27 16:02:35] [INFO ] Deduced a trap composed of 25 places in 209 ms
[2020-05-27 16:02:35] [INFO ] Deduced a trap composed of 27 places in 190 ms
[2020-05-27 16:02:35] [INFO ] Deduced a trap composed of 27 places in 151 ms
[2020-05-27 16:02:35] [INFO ] Deduced a trap composed of 25 places in 209 ms
[2020-05-27 16:02:35] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-05-27 16:02:36] [INFO ] Deduced a trap composed of 26 places in 142 ms
[2020-05-27 16:02:36] [INFO ] Deduced a trap composed of 27 places in 207 ms
[2020-05-27 16:02:36] [INFO ] Deduced a trap composed of 18 places in 168 ms
[2020-05-27 16:02:36] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2020-05-27 16:02:36] [INFO ] Deduced a trap composed of 25 places in 177 ms
[2020-05-27 16:02:37] [INFO ] Deduced a trap composed of 29 places in 263 ms
[2020-05-27 16:02:37] [INFO ] Deduced a trap composed of 34 places in 179 ms
[2020-05-27 16:02:37] [INFO ] Deduced a trap composed of 26 places in 152 ms
[2020-05-27 16:02:37] [INFO ] Deduced a trap composed of 29 places in 162 ms
[2020-05-27 16:02:37] [INFO ] Deduced a trap composed of 20 places in 161 ms
[2020-05-27 16:02:38] [INFO ] Deduced a trap composed of 24 places in 162 ms
[2020-05-27 16:02:38] [INFO ] Deduced a trap composed of 31 places in 150 ms
[2020-05-27 16:02:38] [INFO ] Deduced a trap composed of 27 places in 136 ms
[2020-05-27 16:02:38] [INFO ] Deduced a trap composed of 23 places in 126 ms
[2020-05-27 16:02:38] [INFO ] Deduced a trap composed of 39 places in 131 ms
[2020-05-27 16:02:38] [INFO ] Deduced a trap composed of 24 places in 124 ms
[2020-05-27 16:02:39] [INFO ] Deduced a trap composed of 28 places in 108 ms
[2020-05-27 16:02:39] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 16716 ms
[2020-05-27 16:02:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:02:39] [INFO ] [Nat]Absence check using 111 positive place invariants in 146 ms returned sat
[2020-05-27 16:02:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:02:40] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2020-05-27 16:02:40] [INFO ] Deduced a trap composed of 17 places in 207 ms
[2020-05-27 16:02:40] [INFO ] Deduced a trap composed of 18 places in 211 ms
[2020-05-27 16:02:40] [INFO ] Deduced a trap composed of 23 places in 223 ms
[2020-05-27 16:02:41] [INFO ] Deduced a trap composed of 33 places in 203 ms
[2020-05-27 16:02:41] [INFO ] Deduced a trap composed of 30 places in 197 ms
[2020-05-27 16:02:41] [INFO ] Deduced a trap composed of 28 places in 188 ms
[2020-05-27 16:02:42] [INFO ] Deduced a trap composed of 22 places in 468 ms
[2020-05-27 16:02:42] [INFO ] Deduced a trap composed of 17 places in 204 ms
[2020-05-27 16:02:42] [INFO ] Deduced a trap composed of 22 places in 193 ms
[2020-05-27 16:02:42] [INFO ] Deduced a trap composed of 24 places in 172 ms
[2020-05-27 16:02:42] [INFO ] Deduced a trap composed of 27 places in 184 ms
[2020-05-27 16:02:43] [INFO ] Deduced a trap composed of 38 places in 151 ms
[2020-05-27 16:02:43] [INFO ] Deduced a trap composed of 17 places in 152 ms
[2020-05-27 16:02:43] [INFO ] Deduced a trap composed of 30 places in 149 ms
[2020-05-27 16:02:43] [INFO ] Deduced a trap composed of 29 places in 187 ms
[2020-05-27 16:02:43] [INFO ] Deduced a trap composed of 23 places in 147 ms
[2020-05-27 16:02:43] [INFO ] Deduced a trap composed of 22 places in 144 ms
[2020-05-27 16:02:44] [INFO ] Deduced a trap composed of 27 places in 129 ms
[2020-05-27 16:02:44] [INFO ] Deduced a trap composed of 29 places in 222 ms
[2020-05-27 16:02:44] [INFO ] Deduced a trap composed of 24 places in 539 ms
[2020-05-27 16:02:45] [INFO ] Deduced a trap composed of 30 places in 213 ms
[2020-05-27 16:02:45] [INFO ] Deduced a trap composed of 22 places in 156 ms
[2020-05-27 16:02:45] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5177 ms
[2020-05-27 16:02:45] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 40 ms.
[2020-05-27 16:02:51] [INFO ] Added : 618 causal constraints over 125 iterations in 5933 ms. Result :sat
[2020-05-27 16:02:51] [INFO ] [Real]Absence check using 111 positive place invariants in 57 ms returned sat
[2020-05-27 16:02:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:02:52] [INFO ] [Real]Absence check using state equation in 1092 ms returned sat
[2020-05-27 16:02:52] [INFO ] Deduced a trap composed of 18 places in 235 ms
[2020-05-27 16:02:53] [INFO ] Deduced a trap composed of 34 places in 219 ms
[2020-05-27 16:02:53] [INFO ] Deduced a trap composed of 35 places in 220 ms
[2020-05-27 16:02:53] [INFO ] Deduced a trap composed of 17 places in 207 ms
[2020-05-27 16:02:53] [INFO ] Deduced a trap composed of 21 places in 203 ms
[2020-05-27 16:02:54] [INFO ] Deduced a trap composed of 17 places in 186 ms
[2020-05-27 16:02:54] [INFO ] Deduced a trap composed of 35 places in 187 ms
[2020-05-27 16:02:54] [INFO ] Deduced a trap composed of 22 places in 186 ms
[2020-05-27 16:02:54] [INFO ] Deduced a trap composed of 25 places in 186 ms
[2020-05-27 16:02:54] [INFO ] Deduced a trap composed of 17 places in 263 ms
[2020-05-27 16:02:55] [INFO ] Deduced a trap composed of 33 places in 274 ms
[2020-05-27 16:02:55] [INFO ] Deduced a trap composed of 23 places in 278 ms
[2020-05-27 16:02:55] [INFO ] Deduced a trap composed of 19 places in 208 ms
[2020-05-27 16:02:56] [INFO ] Deduced a trap composed of 19 places in 222 ms
[2020-05-27 16:02:56] [INFO ] Deduced a trap composed of 50 places in 179 ms
[2020-05-27 16:02:56] [INFO ] Deduced a trap composed of 25 places in 180 ms
[2020-05-27 16:02:56] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2020-05-27 16:02:56] [INFO ] Deduced a trap composed of 22 places in 220 ms
[2020-05-27 16:02:57] [INFO ] Deduced a trap composed of 21 places in 159 ms
[2020-05-27 16:02:57] [INFO ] Deduced a trap composed of 26 places in 152 ms
[2020-05-27 16:02:57] [INFO ] Deduced a trap composed of 24 places in 145 ms
[2020-05-27 16:02:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 21 trap constraints in 4826 ms
[2020-05-27 16:02:57] [INFO ] [Real]Absence check using 111 positive place invariants in 57 ms returned sat
[2020-05-27 16:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:02:58] [INFO ] [Real]Absence check using state equation in 1198 ms returned sat
[2020-05-27 16:02:59] [INFO ] Deduced a trap composed of 29 places in 209 ms
[2020-05-27 16:02:59] [INFO ] Deduced a trap composed of 22 places in 258 ms
[2020-05-27 16:02:59] [INFO ] Deduced a trap composed of 17 places in 266 ms
[2020-05-27 16:02:59] [INFO ] Deduced a trap composed of 22 places in 219 ms
[2020-05-27 16:03:00] [INFO ] Deduced a trap composed of 19 places in 210 ms
[2020-05-27 16:03:01] [INFO ] Deduced a trap composed of 23 places in 963 ms
[2020-05-27 16:03:01] [INFO ] Deduced a trap composed of 24 places in 292 ms
[2020-05-27 16:03:01] [INFO ] Deduced a trap composed of 30 places in 271 ms
[2020-05-27 16:03:02] [INFO ] Deduced a trap composed of 22 places in 230 ms
[2020-05-27 16:03:02] [INFO ] Deduced a trap composed of 23 places in 214 ms
[2020-05-27 16:03:02] [INFO ] Deduced a trap composed of 24 places in 201 ms
[2020-05-27 16:03:02] [INFO ] Deduced a trap composed of 19 places in 206 ms
[2020-05-27 16:03:03] [INFO ] Deduced a trap composed of 33 places in 237 ms
[2020-05-27 16:03:03] [INFO ] Deduced a trap composed of 32 places in 210 ms
[2020-05-27 16:03:03] [INFO ] Deduced a trap composed of 29 places in 178 ms
[2020-05-27 16:03:03] [INFO ] Deduced a trap composed of 36 places in 221 ms
[2020-05-27 16:03:03] [INFO ] Deduced a trap composed of 41 places in 217 ms
[2020-05-27 16:03:04] [INFO ] Deduced a trap composed of 94 places in 215 ms
[2020-05-27 16:03:04] [INFO ] Deduced a trap composed of 50 places in 184 ms
[2020-05-27 16:03:04] [INFO ] Deduced a trap composed of 25 places in 115 ms
[2020-05-27 16:03:04] [INFO ] Deduced a trap composed of 44 places in 174 ms
[2020-05-27 16:03:04] [INFO ] Deduced a trap composed of 41 places in 156 ms
[2020-05-27 16:03:05] [INFO ] Deduced a trap composed of 25 places in 140 ms
[2020-05-27 16:03:05] [INFO ] Deduced a trap composed of 40 places in 124 ms
[2020-05-27 16:03:05] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6433 ms
[2020-05-27 16:03:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:03:05] [INFO ] [Nat]Absence check using 111 positive place invariants in 120 ms returned sat
[2020-05-27 16:03:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:03:06] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2020-05-27 16:03:06] [INFO ] Deduced a trap composed of 22 places in 382 ms
[2020-05-27 16:03:07] [INFO ] Deduced a trap composed of 27 places in 289 ms
[2020-05-27 16:03:07] [INFO ] Deduced a trap composed of 10 places in 307 ms
[2020-05-27 16:03:07] [INFO ] Deduced a trap composed of 27 places in 404 ms
[2020-05-27 16:03:08] [INFO ] Deduced a trap composed of 18 places in 210 ms
[2020-05-27 16:03:08] [INFO ] Deduced a trap composed of 24 places in 250 ms
[2020-05-27 16:03:08] [INFO ] Deduced a trap composed of 23 places in 203 ms
[2020-05-27 16:03:08] [INFO ] Deduced a trap composed of 21 places in 181 ms
[2020-05-27 16:03:09] [INFO ] Deduced a trap composed of 33 places in 228 ms
[2020-05-27 16:03:09] [INFO ] Deduced a trap composed of 23 places in 207 ms
[2020-05-27 16:03:09] [INFO ] Deduced a trap composed of 23 places in 194 ms
[2020-05-27 16:03:09] [INFO ] Deduced a trap composed of 18 places in 228 ms
[2020-05-27 16:03:10] [INFO ] Deduced a trap composed of 17 places in 204 ms
[2020-05-27 16:03:10] [INFO ] Deduced a trap composed of 19 places in 192 ms
[2020-05-27 16:03:10] [INFO ] Deduced a trap composed of 27 places in 246 ms
[2020-05-27 16:03:10] [INFO ] Deduced a trap composed of 35 places in 230 ms
[2020-05-27 16:03:11] [INFO ] Deduced a trap composed of 29 places in 168 ms
[2020-05-27 16:03:11] [INFO ] Deduced a trap composed of 39 places in 232 ms
[2020-05-27 16:03:11] [INFO ] Deduced a trap composed of 24 places in 215 ms
[2020-05-27 16:03:11] [INFO ] Deduced a trap composed of 22 places in 218 ms
[2020-05-27 16:03:11] [INFO ] Deduced a trap composed of 25 places in 178 ms
[2020-05-27 16:03:12] [INFO ] Deduced a trap composed of 30 places in 238 ms
[2020-05-27 16:03:12] [INFO ] Deduced a trap composed of 41 places in 205 ms
[2020-05-27 16:03:12] [INFO ] Deduced a trap composed of 28 places in 205 ms
[2020-05-27 16:03:12] [INFO ] Deduced a trap composed of 42 places in 205 ms
[2020-05-27 16:03:13] [INFO ] Deduced a trap composed of 34 places in 206 ms
[2020-05-27 16:03:13] [INFO ] Deduced a trap composed of 46 places in 199 ms
[2020-05-27 16:03:13] [INFO ] Deduced a trap composed of 28 places in 197 ms
[2020-05-27 16:03:13] [INFO ] Deduced a trap composed of 26 places in 181 ms
[2020-05-27 16:03:13] [INFO ] Deduced a trap composed of 25 places in 154 ms
[2020-05-27 16:03:14] [INFO ] Deduced a trap composed of 46 places in 209 ms
[2020-05-27 16:03:14] [INFO ] Deduced a trap composed of 44 places in 121 ms
[2020-05-27 16:03:14] [INFO ] Deduced a trap composed of 45 places in 176 ms
[2020-05-27 16:03:14] [INFO ] Deduced a trap composed of 21 places in 169 ms
[2020-05-27 16:03:14] [INFO ] Deduced a trap composed of 55 places in 133 ms
[2020-05-27 16:03:15] [INFO ] Deduced a trap composed of 28 places in 182 ms
[2020-05-27 16:03:15] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8598 ms
[2020-05-27 16:03:15] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 32 ms.
[2020-05-27 16:03:21] [INFO ] Added : 618 causal constraints over 125 iterations in 6295 ms. Result :sat
[2020-05-27 16:03:21] [INFO ] [Real]Absence check using 111 positive place invariants in 76 ms returned sat
[2020-05-27 16:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:03:22] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2020-05-27 16:03:22] [INFO ] Deduced a trap composed of 23 places in 280 ms
[2020-05-27 16:03:23] [INFO ] Deduced a trap composed of 21 places in 254 ms
[2020-05-27 16:03:23] [INFO ] Deduced a trap composed of 16 places in 272 ms
[2020-05-27 16:03:23] [INFO ] Deduced a trap composed of 17 places in 271 ms
[2020-05-27 16:03:24] [INFO ] Deduced a trap composed of 19 places in 271 ms
[2020-05-27 16:03:24] [INFO ] Deduced a trap composed of 23 places in 250 ms
[2020-05-27 16:03:24] [INFO ] Deduced a trap composed of 30 places in 239 ms
[2020-05-27 16:03:24] [INFO ] Deduced a trap composed of 29 places in 240 ms
[2020-05-27 16:03:25] [INFO ] Deduced a trap composed of 34 places in 240 ms
[2020-05-27 16:03:25] [INFO ] Deduced a trap composed of 29 places in 245 ms
[2020-05-27 16:03:25] [INFO ] Deduced a trap composed of 34 places in 236 ms
[2020-05-27 16:03:25] [INFO ] Deduced a trap composed of 33 places in 178 ms
[2020-05-27 16:03:26] [INFO ] Deduced a trap composed of 30 places in 247 ms
[2020-05-27 16:03:26] [INFO ] Deduced a trap composed of 26 places in 242 ms
[2020-05-27 16:03:26] [INFO ] Deduced a trap composed of 22 places in 263 ms
[2020-05-27 16:03:27] [INFO ] Deduced a trap composed of 31 places in 236 ms
[2020-05-27 16:03:27] [INFO ] Deduced a trap composed of 24 places in 252 ms
[2020-05-27 16:03:27] [INFO ] Deduced a trap composed of 17 places in 249 ms
[2020-05-27 16:03:27] [INFO ] Deduced a trap composed of 32 places in 242 ms
[2020-05-27 16:03:28] [INFO ] Deduced a trap composed of 32 places in 231 ms
[2020-05-27 16:03:28] [INFO ] Deduced a trap composed of 28 places in 206 ms
[2020-05-27 16:03:28] [INFO ] Deduced a trap composed of 21 places in 204 ms
[2020-05-27 16:03:28] [INFO ] Deduced a trap composed of 22 places in 208 ms
[2020-05-27 16:03:29] [INFO ] Deduced a trap composed of 39 places in 196 ms
[2020-05-27 16:03:29] [INFO ] Deduced a trap composed of 26 places in 216 ms
[2020-05-27 16:03:29] [INFO ] Deduced a trap composed of 36 places in 175 ms
[2020-05-27 16:03:29] [INFO ] Deduced a trap composed of 57 places in 201 ms
[2020-05-27 16:03:29] [INFO ] Deduced a trap composed of 26 places in 137 ms
[2020-05-27 16:03:30] [INFO ] Deduced a trap composed of 39 places in 166 ms
[2020-05-27 16:03:30] [INFO ] Deduced a trap composed of 25 places in 124 ms
[2020-05-27 16:03:30] [INFO ] Deduced a trap composed of 24 places in 150 ms
[2020-05-27 16:03:30] [INFO ] Deduced a trap composed of 40 places in 116 ms
[2020-05-27 16:03:30] [INFO ] Deduced a trap composed of 32 places in 136 ms
[2020-05-27 16:03:30] [INFO ] Deduced a trap composed of 31 places in 146 ms
[2020-05-27 16:03:31] [INFO ] Deduced a trap composed of 38 places in 149 ms
[2020-05-27 16:03:31] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 8520 ms
[2020-05-27 16:03:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:03:31] [INFO ] [Nat]Absence check using 111 positive place invariants in 253 ms returned sat
[2020-05-27 16:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:03:32] [INFO ] [Nat]Absence check using state equation in 1105 ms returned sat
[2020-05-27 16:03:32] [INFO ] Deduced a trap composed of 30 places in 318 ms
[2020-05-27 16:03:33] [INFO ] Deduced a trap composed of 21 places in 272 ms
[2020-05-27 16:03:33] [INFO ] Deduced a trap composed of 28 places in 252 ms
[2020-05-27 16:03:33] [INFO ] Deduced a trap composed of 17 places in 222 ms
[2020-05-27 16:03:34] [INFO ] Deduced a trap composed of 19 places in 224 ms
[2020-05-27 16:03:34] [INFO ] Deduced a trap composed of 23 places in 227 ms
[2020-05-27 16:03:34] [INFO ] Deduced a trap composed of 56 places in 216 ms
[2020-05-27 16:03:34] [INFO ] Deduced a trap composed of 28 places in 223 ms
[2020-05-27 16:03:35] [INFO ] Deduced a trap composed of 17 places in 216 ms
[2020-05-27 16:03:35] [INFO ] Deduced a trap composed of 19 places in 223 ms
[2020-05-27 16:03:35] [INFO ] Deduced a trap composed of 29 places in 215 ms
[2020-05-27 16:03:35] [INFO ] Deduced a trap composed of 36 places in 209 ms
[2020-05-27 16:03:35] [INFO ] Deduced a trap composed of 27 places in 162 ms
[2020-05-27 16:03:36] [INFO ] Deduced a trap composed of 29 places in 185 ms
[2020-05-27 16:03:36] [INFO ] Deduced a trap composed of 10 places in 181 ms
[2020-05-27 16:03:36] [INFO ] Deduced a trap composed of 17 places in 177 ms
[2020-05-27 16:03:36] [INFO ] Deduced a trap composed of 23 places in 266 ms
[2020-05-27 16:03:37] [INFO ] Deduced a trap composed of 26 places in 224 ms
[2020-05-27 16:03:37] [INFO ] Deduced a trap composed of 25 places in 264 ms
[2020-05-27 16:03:37] [INFO ] Deduced a trap composed of 30 places in 234 ms
[2020-05-27 16:03:37] [INFO ] Deduced a trap composed of 30 places in 217 ms
[2020-05-27 16:03:38] [INFO ] Deduced a trap composed of 24 places in 208 ms
[2020-05-27 16:03:38] [INFO ] Deduced a trap composed of 32 places in 205 ms
[2020-05-27 16:03:38] [INFO ] Deduced a trap composed of 25 places in 250 ms
[2020-05-27 16:03:38] [INFO ] Deduced a trap composed of 19 places in 219 ms
[2020-05-27 16:03:39] [INFO ] Deduced a trap composed of 33 places in 222 ms
[2020-05-27 16:03:39] [INFO ] Deduced a trap composed of 22 places in 212 ms
[2020-05-27 16:03:39] [INFO ] Deduced a trap composed of 24 places in 218 ms
[2020-05-27 16:03:39] [INFO ] Deduced a trap composed of 25 places in 243 ms
[2020-05-27 16:03:40] [INFO ] Deduced a trap composed of 23 places in 204 ms
[2020-05-27 16:03:40] [INFO ] Deduced a trap composed of 34 places in 210 ms
[2020-05-27 16:03:40] [INFO ] Deduced a trap composed of 36 places in 206 ms
[2020-05-27 16:03:40] [INFO ] Deduced a trap composed of 26 places in 190 ms
[2020-05-27 16:03:40] [INFO ] Deduced a trap composed of 19 places in 188 ms
[2020-05-27 16:03:41] [INFO ] Deduced a trap composed of 28 places in 185 ms
[2020-05-27 16:03:41] [INFO ] Deduced a trap composed of 22 places in 213 ms
[2020-05-27 16:03:41] [INFO ] Deduced a trap composed of 35 places in 178 ms
[2020-05-27 16:03:41] [INFO ] Deduced a trap composed of 29 places in 158 ms
[2020-05-27 16:03:41] [INFO ] Deduced a trap composed of 21 places in 106 ms
[2020-05-27 16:03:41] [INFO ] Deduced a trap composed of 28 places in 131 ms
[2020-05-27 16:03:42] [INFO ] Deduced a trap composed of 17 places in 106 ms
[2020-05-27 16:03:42] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 9510 ms
[2020-05-27 16:03:42] [INFO ] Computed and/alt/rep : 632/1063/632 causal constraints in 32 ms.
[2020-05-27 16:03:48] [INFO ] Added : 622 causal constraints over 129 iterations in 6249 ms. Result :sat
[2020-05-27 16:03:48] [INFO ] Deduced a trap composed of 32 places in 142 ms
[2020-05-27 16:03:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-27 16:03:48] [INFO ] Flatten gal took : 99 ms
[2020-05-27 16:03:48] [INFO ] Flatten gal took : 46 ms
[2020-05-27 16:03:49] [INFO ] Applying decomposition
[2020-05-27 16:03:49] [INFO ] Flatten gal took : 41 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/graph16687167979986684408.txt, -o, /tmp/graph16687167979986684408.bin, -w, /tmp/graph16687167979986684408.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/graph16687167979986684408.bin, -l, -1, -v, -w, /tmp/graph16687167979986684408.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 16:03:49] [INFO ] Decomposing Gal with order
[2020-05-27 16:03:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 16:03:49] [INFO ] Removed a total of 90 redundant transitions.
[2020-05-27 16:03:49] [INFO ] Flatten gal took : 81 ms
[2020-05-27 16:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2020-05-27 16:03:49] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 14 ms
[2020-05-27 16:03:49] [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 17 ordering constraints for composite.
built 40 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 19 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 22 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 17 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 18 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 16:24:25] [INFO ] Applying decomposition
[2020-05-27 16:24:25] [INFO ] Flatten gal took : 193 ms
[2020-05-27 16:24:25] [INFO ] Decomposing Gal with order
[2020-05-27 16:24:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 16:24:26] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-27 16:24:26] [INFO ] Flatten gal took : 164 ms
[2020-05-27 16:24:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 48 ms.
[2020-05-27 16:24:26] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 22 ms
[2020-05-27 16:24:26] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 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 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 16:45:03] [INFO ] Flatten gal took : 181 ms
[2020-05-27 16:45:04] [INFO ] Input system was already deterministic with 633 transitions.
[2020-05-27 16:45:04] [INFO ] Transformed 683 places.
[2020-05-27 16:45:04] [INFO ] Transformed 633 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 16:45:04] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-27 16:45:04] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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="ShieldPPPs-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 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 r210-tajo-159033475800484"
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 ;