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.r051-ebro-158902546000284.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 DES-PT-30b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546000284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.3K Mar 30 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 103K Mar 24 05:37 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 DES-PT-30b-CTLFireability-00
FORMULA_NAME DES-PT-30b-CTLFireability-01
FORMULA_NAME DES-PT-30b-CTLFireability-02
FORMULA_NAME DES-PT-30b-CTLFireability-03
FORMULA_NAME DES-PT-30b-CTLFireability-04
FORMULA_NAME DES-PT-30b-CTLFireability-05
FORMULA_NAME DES-PT-30b-CTLFireability-06
FORMULA_NAME DES-PT-30b-CTLFireability-07
FORMULA_NAME DES-PT-30b-CTLFireability-08
FORMULA_NAME DES-PT-30b-CTLFireability-09
FORMULA_NAME DES-PT-30b-CTLFireability-10
FORMULA_NAME DES-PT-30b-CTLFireability-11
FORMULA_NAME DES-PT-30b-CTLFireability-12
FORMULA_NAME DES-PT-30b-CTLFireability-13
FORMULA_NAME DES-PT-30b-CTLFireability-14
FORMULA_NAME DES-PT-30b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589546924289

[2020-05-15 12:48:48] [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-15 12:48:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 12:48:48] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2020-05-15 12:48:48] [INFO ] Transformed 399 places.
[2020-05-15 12:48:48] [INFO ] Transformed 350 transitions.
[2020-05-15 12:48:48] [INFO ] Found NUPN structural information;
[2020-05-15 12:48:48] [INFO ] Parsed PT model containing 399 places and 350 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 56 ms.
Incomplete random walk after 100000 steps, including 841 resets, run finished after 683 ms. (steps per millisecond=146 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1]
// Phase 1: matrix 350 rows 399 cols
[2020-05-15 12:48:49] [INFO ] Computed 65 place invariants in 65 ms
[2020-05-15 12:48:49] [INFO ] [Real]Absence check using 39 positive place invariants in 68 ms returned sat
[2020-05-15 12:48:49] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 43 ms returned sat
[2020-05-15 12:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:48:50] [INFO ] [Real]Absence check using state equation in 910 ms returned sat
[2020-05-15 12:48:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:48:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-05-15 12:48:51] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 64 ms returned sat
[2020-05-15 12:48:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:48:51] [INFO ] [Nat]Absence check using state equation in 841 ms returned sat
[2020-05-15 12:48:52] [INFO ] Deduced a trap composed of 15 places in 313 ms
[2020-05-15 12:48:52] [INFO ] Deduced a trap composed of 19 places in 207 ms
[2020-05-15 12:48:52] [INFO ] Deduced a trap composed of 9 places in 120 ms
[2020-05-15 12:48:52] [INFO ] Deduced a trap composed of 43 places in 116 ms
[2020-05-15 12:48:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 987 ms
[2020-05-15 12:48:52] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 40 ms.
[2020-05-15 12:48:57] [INFO ] Added : 306 causal constraints over 62 iterations in 4790 ms. Result :sat
[2020-05-15 12:48:57] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2020-05-15 12:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2020-05-15 12:48:58] [INFO ] [Real]Absence check using 39 positive place invariants in 56 ms returned sat
[2020-05-15 12:48:58] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-05-15 12:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:48:59] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2020-05-15 12:48:59] [INFO ] Deduced a trap composed of 8 places in 290 ms
[2020-05-15 12:48:59] [INFO ] Deduced a trap composed of 14 places in 142 ms
[2020-05-15 12:49:00] [INFO ] Deduced a trap composed of 9 places in 156 ms
[2020-05-15 12:49:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 739 ms
[2020-05-15 12:49:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:49:00] [INFO ] [Nat]Absence check using 39 positive place invariants in 68 ms returned sat
[2020-05-15 12:49:00] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 74 ms returned sat
[2020-05-15 12:49:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:01] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2020-05-15 12:49:01] [INFO ] Deduced a trap composed of 9 places in 275 ms
[2020-05-15 12:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2020-05-15 12:49:01] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 51 ms.
[2020-05-15 12:49:08] [INFO ] Added : 321 causal constraints over 65 iterations in 6744 ms. Result :sat
[2020-05-15 12:49:09] [INFO ] [Real]Absence check using 39 positive place invariants in 132 ms returned sat
[2020-05-15 12:49:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-05-15 12:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:10] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2020-05-15 12:49:10] [INFO ] Deduced a trap composed of 21 places in 393 ms
[2020-05-15 12:49:11] [INFO ] Deduced a trap composed of 16 places in 336 ms
[2020-05-15 12:49:11] [INFO ] Deduced a trap composed of 12 places in 353 ms
[2020-05-15 12:49:12] [INFO ] Deduced a trap composed of 14 places in 550 ms
[2020-05-15 12:49:12] [INFO ] Deduced a trap composed of 14 places in 488 ms
[2020-05-15 12:49:13] [INFO ] Deduced a trap composed of 19 places in 427 ms
[2020-05-15 12:49:13] [INFO ] Deduced a trap composed of 24 places in 323 ms
[2020-05-15 12:49:13] [INFO ] Deduced a trap composed of 17 places in 169 ms
[2020-05-15 12:49:13] [INFO ] Deduced a trap composed of 16 places in 122 ms
[2020-05-15 12:49:14] [INFO ] Deduced a trap composed of 21 places in 219 ms
[2020-05-15 12:49:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3818 ms
[2020-05-15 12:49:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:49:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 63 ms returned sat
[2020-05-15 12:49:14] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 59 ms returned sat
[2020-05-15 12:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:15] [INFO ] [Nat]Absence check using state equation in 1382 ms returned sat
[2020-05-15 12:49:16] [INFO ] Deduced a trap composed of 12 places in 348 ms
[2020-05-15 12:49:16] [INFO ] Deduced a trap composed of 8 places in 258 ms
[2020-05-15 12:49:16] [INFO ] Deduced a trap composed of 20 places in 249 ms
[2020-05-15 12:49:17] [INFO ] Deduced a trap composed of 29 places in 246 ms
[2020-05-15 12:49:17] [INFO ] Deduced a trap composed of 23 places in 129 ms
[2020-05-15 12:49:17] [INFO ] Deduced a trap composed of 24 places in 118 ms
[2020-05-15 12:49:17] [INFO ] Deduced a trap composed of 23 places in 109 ms
[2020-05-15 12:49:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1927 ms
[2020-05-15 12:49:17] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 132 ms.
[2020-05-15 12:49:22] [INFO ] Added : 288 causal constraints over 58 iterations in 5073 ms. Result :sat
[2020-05-15 12:49:22] [INFO ] Deduced a trap composed of 31 places in 140 ms
[2020-05-15 12:49:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2020-05-15 12:49:23] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-05-15 12:49:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 68 ms returned sat
[2020-05-15 12:49:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:26] [INFO ] [Real]Absence check using state equation in 2944 ms returned sat
[2020-05-15 12:49:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:49:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 92 ms returned sat
[2020-05-15 12:49:26] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 102 ms returned sat
[2020-05-15 12:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:27] [INFO ] [Nat]Absence check using state equation in 1359 ms returned sat
[2020-05-15 12:49:28] [INFO ] Deduced a trap composed of 16 places in 261 ms
[2020-05-15 12:49:28] [INFO ] Deduced a trap composed of 20 places in 216 ms
[2020-05-15 12:49:28] [INFO ] Deduced a trap composed of 8 places in 193 ms
[2020-05-15 12:49:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 874 ms
[2020-05-15 12:49:28] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 45 ms.
[2020-05-15 12:49:35] [INFO ] Added : 315 causal constraints over 63 iterations in 6490 ms. Result :sat
[2020-05-15 12:49:35] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-05-15 12:49:35] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-05-15 12:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:36] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2020-05-15 12:49:37] [INFO ] Deduced a trap composed of 16 places in 661 ms
[2020-05-15 12:49:37] [INFO ] Deduced a trap composed of 15 places in 262 ms
[2020-05-15 12:49:37] [INFO ] Deduced a trap composed of 12 places in 200 ms
[2020-05-15 12:49:38] [INFO ] Deduced a trap composed of 17 places in 251 ms
[2020-05-15 12:49:38] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-05-15 12:49:38] [INFO ] Deduced a trap composed of 24 places in 181 ms
[2020-05-15 12:49:38] [INFO ] Deduced a trap composed of 20 places in 160 ms
[2020-05-15 12:49:38] [INFO ] Deduced a trap composed of 17 places in 144 ms
[2020-05-15 12:49:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2358 ms
[2020-05-15 12:49:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:49:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 89 ms returned sat
[2020-05-15 12:49:39] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 69 ms returned sat
[2020-05-15 12:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:40] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2020-05-15 12:49:40] [INFO ] Deduced a trap composed of 19 places in 309 ms
[2020-05-15 12:49:41] [INFO ] Deduced a trap composed of 18 places in 325 ms
[2020-05-15 12:49:41] [INFO ] Deduced a trap composed of 24 places in 293 ms
[2020-05-15 12:49:41] [INFO ] Deduced a trap composed of 17 places in 122 ms
[2020-05-15 12:49:41] [INFO ] Deduced a trap composed of 18 places in 171 ms
[2020-05-15 12:49:42] [INFO ] Deduced a trap composed of 21 places in 132 ms
[2020-05-15 12:49:42] [INFO ] Deduced a trap composed of 14 places in 178 ms
[2020-05-15 12:49:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1835 ms
[2020-05-15 12:49:42] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 138 ms.
[2020-05-15 12:49:46] [INFO ] Added : 238 causal constraints over 49 iterations in 4254 ms. Result :sat
[2020-05-15 12:49:46] [INFO ] Deduced a trap composed of 54 places in 314 ms
[2020-05-15 12:49:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2020-05-15 12:49:47] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2020-05-15 12:49:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-05-15 12:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:49] [INFO ] [Real]Absence check using state equation in 1823 ms returned sat
[2020-05-15 12:49:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:49:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 69 ms returned sat
[2020-05-15 12:49:49] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 66 ms returned sat
[2020-05-15 12:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:51] [INFO ] [Nat]Absence check using state equation in 1602 ms returned sat
[2020-05-15 12:49:51] [INFO ] Deduced a trap composed of 24 places in 321 ms
[2020-05-15 12:49:51] [INFO ] Deduced a trap composed of 32 places in 539 ms
[2020-05-15 12:49:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1001 ms
[2020-05-15 12:49:52] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 48 ms.
[2020-05-15 12:49:57] [INFO ] Added : 342 causal constraints over 69 iterations in 5625 ms. Result :sat
[2020-05-15 12:49:57] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-05-15 12:49:57] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2020-05-15 12:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:49:58] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2020-05-15 12:49:59] [INFO ] Deduced a trap composed of 8 places in 483 ms
[2020-05-15 12:49:59] [INFO ] Deduced a trap composed of 9 places in 384 ms
[2020-05-15 12:50:00] [INFO ] Deduced a trap composed of 34 places in 261 ms
[2020-05-15 12:50:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1278 ms
[2020-05-15 12:50:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:50:00] [INFO ] [Nat]Absence check using 39 positive place invariants in 133 ms returned sat
[2020-05-15 12:50:00] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 72 ms returned sat
[2020-05-15 12:50:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:03] [INFO ] [Nat]Absence check using state equation in 2791 ms returned sat
[2020-05-15 12:50:03] [INFO ] Deduced a trap composed of 13 places in 423 ms
[2020-05-15 12:50:04] [INFO ] Deduced a trap composed of 14 places in 193 ms
[2020-05-15 12:50:04] [INFO ] Deduced a trap composed of 31 places in 107 ms
[2020-05-15 12:50:04] [INFO ] Deduced a trap composed of 24 places in 122 ms
[2020-05-15 12:50:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1040 ms
[2020-05-15 12:50:04] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 100 ms.
[2020-05-15 12:50:10] [INFO ] Added : 341 causal constraints over 69 iterations in 5750 ms. Result :sat
[2020-05-15 12:50:10] [INFO ] Deduced a trap composed of 32 places in 205 ms
[2020-05-15 12:50:10] [INFO ] Deduced a trap composed of 33 places in 170 ms
[2020-05-15 12:50:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 612 ms
[2020-05-15 12:50:10] [INFO ] [Real]Absence check using 39 positive place invariants in 80 ms returned sat
[2020-05-15 12:50:10] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 50 ms returned sat
[2020-05-15 12:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:11] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2020-05-15 12:50:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:50:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 145 ms returned sat
[2020-05-15 12:50:12] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 88 ms returned sat
[2020-05-15 12:50:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:13] [INFO ] [Nat]Absence check using state equation in 1279 ms returned sat
[2020-05-15 12:50:13] [INFO ] Deduced a trap composed of 23 places in 341 ms
[2020-05-15 12:50:14] [INFO ] Deduced a trap composed of 36 places in 369 ms
[2020-05-15 12:50:14] [INFO ] Deduced a trap composed of 25 places in 226 ms
[2020-05-15 12:50:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1073 ms
[2020-05-15 12:50:14] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 82 ms.
[2020-05-15 12:50:19] [INFO ] Added : 256 causal constraints over 52 iterations in 4448 ms. Result :sat
[2020-05-15 12:50:19] [INFO ] Deduced a trap composed of 55 places in 382 ms
[2020-05-15 12:50:20] [INFO ] Deduced a trap composed of 46 places in 574 ms
[2020-05-15 12:50:20] [INFO ] Deduced a trap composed of 50 places in 287 ms
[2020-05-15 12:50:20] [INFO ] Deduced a trap composed of 29 places in 206 ms
[2020-05-15 12:50:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1912 ms
[2020-05-15 12:50:21] [INFO ] [Real]Absence check using 39 positive place invariants in 46 ms returned sat
[2020-05-15 12:50:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-05-15 12:50:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:22] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2020-05-15 12:50:22] [INFO ] Deduced a trap composed of 39 places in 304 ms
[2020-05-15 12:50:22] [INFO ] Deduced a trap composed of 48 places in 368 ms
[2020-05-15 12:50:23] [INFO ] Deduced a trap composed of 21 places in 306 ms
[2020-05-15 12:50:23] [INFO ] Deduced a trap composed of 37 places in 286 ms
[2020-05-15 12:50:23] [INFO ] Deduced a trap composed of 25 places in 247 ms
[2020-05-15 12:50:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1742 ms
[2020-05-15 12:50:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:50:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 66 ms returned sat
[2020-05-15 12:50:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2020-05-15 12:50:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:25] [INFO ] [Nat]Absence check using state equation in 1494 ms returned sat
[2020-05-15 12:50:26] [INFO ] Deduced a trap composed of 23 places in 434 ms
[2020-05-15 12:50:26] [INFO ] Deduced a trap composed of 14 places in 245 ms
[2020-05-15 12:50:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 799 ms
[2020-05-15 12:50:26] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 51 ms.
[2020-05-15 12:50:32] [INFO ] Added : 326 causal constraints over 66 iterations in 5485 ms. Result :sat
[2020-05-15 12:50:32] [INFO ] Deduced a trap composed of 43 places in 247 ms
[2020-05-15 12:50:32] [INFO ] Deduced a trap composed of 50 places in 223 ms
[2020-05-15 12:50:33] [INFO ] Deduced a trap composed of 27 places in 259 ms
[2020-05-15 12:50:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1187 ms
[2020-05-15 12:50:33] [INFO ] [Real]Absence check using 39 positive place invariants in 49 ms returned sat
[2020-05-15 12:50:33] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-05-15 12:50:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:34] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2020-05-15 12:50:35] [INFO ] Deduced a trap composed of 10 places in 420 ms
[2020-05-15 12:50:35] [INFO ] Deduced a trap composed of 21 places in 216 ms
[2020-05-15 12:50:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 772 ms
[2020-05-15 12:50:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:50:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 151 ms returned sat
[2020-05-15 12:50:36] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 155 ms returned sat
[2020-05-15 12:50:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:38] [INFO ] [Nat]Absence check using state equation in 2232 ms returned sat
[2020-05-15 12:50:39] [INFO ] Deduced a trap composed of 31 places in 565 ms
[2020-05-15 12:50:39] [INFO ] Deduced a trap composed of 28 places in 523 ms
[2020-05-15 12:50:39] [INFO ] Deduced a trap composed of 8 places in 226 ms
[2020-05-15 12:50:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1525 ms
[2020-05-15 12:50:40] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 43 ms.
[2020-05-15 12:50:45] [INFO ] Added : 308 causal constraints over 63 iterations in 5812 ms. Result :sat
[2020-05-15 12:50:46] [INFO ] [Real]Absence check using 39 positive place invariants in 102 ms returned sat
[2020-05-15 12:50:46] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 101 ms returned sat
[2020-05-15 12:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:47] [INFO ] [Real]Absence check using state equation in 1582 ms returned sat
[2020-05-15 12:50:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:50:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 93 ms returned sat
[2020-05-15 12:50:48] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 61 ms returned sat
[2020-05-15 12:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:49] [INFO ] [Nat]Absence check using state equation in 1542 ms returned sat
[2020-05-15 12:50:50] [INFO ] Deduced a trap composed of 35 places in 394 ms
[2020-05-15 12:50:50] [INFO ] Deduced a trap composed of 20 places in 422 ms
[2020-05-15 12:50:50] [INFO ] Deduced a trap composed of 40 places in 261 ms
[2020-05-15 12:50:50] [INFO ] Deduced a trap composed of 18 places in 169 ms
[2020-05-15 12:50:51] [INFO ] Deduced a trap composed of 14 places in 298 ms
[2020-05-15 12:50:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1805 ms
[2020-05-15 12:50:51] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 38 ms.
[2020-05-15 12:50:56] [INFO ] Added : 308 causal constraints over 63 iterations in 5450 ms. Result :sat
[2020-05-15 12:50:57] [INFO ] Deduced a trap composed of 53 places in 158 ms
[2020-05-15 12:50:57] [INFO ] Deduced a trap composed of 51 places in 313 ms
[2020-05-15 12:50:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 747 ms
[2020-05-15 12:50:57] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-05-15 12:50:57] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-05-15 12:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:50:58] [INFO ] [Real]Absence check using state equation in 958 ms returned sat
[2020-05-15 12:50:59] [INFO ] Deduced a trap composed of 13 places in 259 ms
[2020-05-15 12:50:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2020-05-15 12:50:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:50:59] [INFO ] [Nat]Absence check using 39 positive place invariants in 224 ms returned sat
[2020-05-15 12:50:59] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 121 ms returned sat
[2020-05-15 12:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:51:01] [INFO ] [Nat]Absence check using state equation in 1416 ms returned sat
[2020-05-15 12:51:01] [INFO ] Deduced a trap composed of 12 places in 383 ms
[2020-05-15 12:51:01] [INFO ] Deduced a trap composed of 15 places in 209 ms
[2020-05-15 12:51:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 709 ms
[2020-05-15 12:51:01] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 56 ms.
[2020-05-15 12:51:07] [INFO ] Added : 337 causal constraints over 68 iterations in 5854 ms. Result :sat
[2020-05-15 12:51:08] [INFO ] Deduced a trap composed of 32 places in 384 ms
[2020-05-15 12:51:08] [INFO ] Deduced a trap composed of 52 places in 320 ms
[2020-05-15 12:51:09] [INFO ] Deduced a trap composed of 54 places in 389 ms
[2020-05-15 12:51:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1532 ms
[2020-05-15 12:51:09] [INFO ] [Real]Absence check using 39 positive place invariants in 72 ms returned sat
[2020-05-15 12:51:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2020-05-15 12:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:51:10] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2020-05-15 12:51:10] [INFO ] Deduced a trap composed of 8 places in 473 ms
[2020-05-15 12:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2020-05-15 12:51:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:51:11] [INFO ] [Nat]Absence check using 39 positive place invariants in 76 ms returned sat
[2020-05-15 12:51:11] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 72 ms returned sat
[2020-05-15 12:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:51:12] [INFO ] [Nat]Absence check using state equation in 1222 ms returned sat
[2020-05-15 12:51:12] [INFO ] Deduced a trap composed of 28 places in 305 ms
[2020-05-15 12:51:12] [INFO ] Deduced a trap composed of 13 places in 268 ms
[2020-05-15 12:51:13] [INFO ] Deduced a trap composed of 9 places in 218 ms
[2020-05-15 12:51:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 930 ms
[2020-05-15 12:51:13] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 48 ms.
[2020-05-15 12:51:19] [INFO ] Added : 339 causal constraints over 69 iterations in 5839 ms. Result :sat
[2020-05-15 12:51:19] [INFO ] [Real]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-05-15 12:51:19] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 49 ms returned sat
[2020-05-15 12:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 12:51:20] [INFO ] [Real]Absence check using state equation in 1313 ms returned sat
[2020-05-15 12:51:21] [INFO ] Deduced a trap composed of 8 places in 468 ms
[2020-05-15 12:51:21] [INFO ] Deduced a trap composed of 24 places in 314 ms
[2020-05-15 12:51:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 885 ms
[2020-05-15 12:51:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 12:51:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 64 ms returned sat
[2020-05-15 12:51:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-05-15 12:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 12:51:22] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2020-05-15 12:51:23] [INFO ] Deduced a trap composed of 8 places in 238 ms
[2020-05-15 12:51:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2020-05-15 12:51:23] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 36 ms.
[2020-05-15 12:51:28] [INFO ] Added : 320 causal constraints over 64 iterations in 5151 ms. Result :sat
[2020-05-15 12:51:28] [INFO ] Deduced a trap composed of 32 places in 338 ms
[2020-05-15 12:51:29] [INFO ] Deduced a trap composed of 54 places in 257 ms
[2020-05-15 12:51:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 827 ms
[2020-05-15 12:51:29] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-15 12:51:29] [INFO ] Flatten gal took : 159 ms
[2020-05-15 12:51:29] [INFO ] Flatten gal took : 62 ms
[2020-05-15 12:51:30] [INFO ] Applying decomposition
[2020-05-15 12:51:30] [INFO ] Flatten gal took : 60 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/graph10230414971288404389.txt, -o, /tmp/graph10230414971288404389.bin, -w, /tmp/graph10230414971288404389.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/graph10230414971288404389.bin, -l, -1, -v, -w, /tmp/graph10230414971288404389.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 12:51:30] [INFO ] Decomposing Gal with order
[2020-05-15 12:51:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 12:51:30] [INFO ] Removed a total of 30 redundant transitions.
[2020-05-15 12:51:30] [INFO ] Flatten gal took : 130 ms
[2020-05-15 12:51:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2020-05-15 12:51:30] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 24 ms
[2020-05-15 12:51:30] [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 28 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 21 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 28 ordering constraints for composite.
built 31 ordering constraints for composite.
built 23 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.96792e+22,58.036,909244,14342,2741,2.44382e+06,18514,751,1.67257e+06,344,105375,0


Converting to forward existential form...Done !
original formula: (EX(E((i11.u17.p175==1) U ((u41.p17==1)&&(u41.p250==1)))) + AF((i11.u18.p181==1)))
=> equivalent forward existential formula: [FwdG((Init * !(EX(E((i11.u17.p175==1) U ((u41.p17==1)&&(u41.p250==1)))))),!((i11.u18.p181==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t62, t64, t99, t139, t141, t154, u40.t83, u41.t80, u85.t17, i2.i1.u15.t133, i2.i1.u15.t135, i2.i1.u15.t137, i2.i2.t121, i2.i2.u19.t123, i3.i0.t166, i3.i0.u6.t162, i3.i0.u6.t164, i3.i1.u26.t112, i3.i1.u27.t111, i3.i1.u27.t117, i4.i1.u22.t118, i4.i1.u29.t102, i4.i1.u29.t109, i5.t160, i5.u8.t156, i5.u8.t158, i6.u36.t90, i6.u36.t92, i6.u36.t94, i6.u36.t96, i6.u36.t98, i7.i1.u14.t144, i7.i1.u14.t146, i7.i1.u14.t149, i7.i1.u14.t151, i7.i1.u14.t153, i10.i0.u44.t78, i10.i2.u74.t41, i10.i2.u75.t33, i10.i2.u75.t36, i10.i2.u75.t38, i10.i2.u82.t23, i10.i2.u82.t25, i10.i2.u82.t27, i11.u17.t126, i11.u17.t128, i11.u17.t130, i12.t58, i12.u60.t65, i12.i0.u48.t76, i12.i2.u66.t52, i12.i3.t54, i12.i3.t56, i12.i3.u63.t59, i12.i3.u64.t57, i12.i3.u65.t55, i12.i4.t60, i12.i4.u61.t63, i12.i4.u62.t61, i13.t66, i13.u58.t68, i13.u59.t67, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/286/62/348
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2020-05-15 12:55:04] [INFO ] Applying decomposition
[2020-05-15 12:55:04] [INFO ] Flatten gal took : 58 ms
[2020-05-15 12:55:04] [INFO ] Decomposing Gal with order
[2020-05-15 12:55:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 12:55:04] [INFO ] Removed a total of 137 redundant transitions.
[2020-05-15 12:55:04] [INFO ] Flatten gal took : 102 ms
[2020-05-15 12:55:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 492 labels/synchronizations in 74 ms.
[2020-05-15 12:55:04] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 13 ms
[2020-05-15 12:55: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], 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 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 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.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-15 13:16:00] [INFO ] Flatten gal took : 451 ms
[2020-05-15 13:16:01] [INFO ] Input system was already deterministic with 350 transitions.
[2020-05-15 13:16:01] [INFO ] Transformed 399 places.
[2020-05-15 13:16:01] [INFO ] Transformed 350 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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-15 13:16:31] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 7 ms
[2020-05-15 13:16:31] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 11 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.
Detected timeout of ITS tools.

BK_STOP 1589549846683

--------------------
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="DES-PT-30b"
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 DES-PT-30b, 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 r051-ebro-158902546000284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b 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 ;