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

About the Execution of ITS-Tools for ShieldPPPt-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15756.650 3600000.00 3314457.00 315187.90 [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-159033476100692.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 ShieldPPPt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476100692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 3.7K May 14 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K 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.6K May 13 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:53 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 569K 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 ShieldPPPt-PT-030B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590612572168

[2020-05-27 20:49:34] [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 20:49:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 20:49:34] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2020-05-27 20:49:34] [INFO ] Transformed 2343 places.
[2020-05-27 20:49:34] [INFO ] Transformed 2133 transitions.
[2020-05-27 20:49:34] [INFO ] Found NUPN structural information;
[2020-05-27 20:49:34] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 53 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 618 ms. (steps per millisecond=161 ) properties seen :[1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1]
// Phase 1: matrix 2133 rows 2343 cols
[2020-05-27 20:49:35] [INFO ] Computed 331 place invariants in 87 ms
[2020-05-27 20:49:36] [INFO ] [Real]Absence check using 331 positive place invariants in 504 ms returned sat
[2020-05-27 20:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:49:47] [INFO ] [Real]Absence check using state equation in 10972 ms returned sat
[2020-05-27 20:49:48] [INFO ] Deduced a trap composed of 25 places in 1091 ms
[2020-05-27 20:49:50] [INFO ] Deduced a trap composed of 21 places in 1180 ms
[2020-05-27 20:49:51] [INFO ] Deduced a trap composed of 25 places in 1179 ms
[2020-05-27 20:49:52] [INFO ] Deduced a trap composed of 29 places in 1069 ms
[2020-05-27 20:49:53] [INFO ] Deduced a trap composed of 31 places in 1188 ms
[2020-05-27 20:49:54] [INFO ] Deduced a trap composed of 17 places in 930 ms
[2020-05-27 20:49:55] [INFO ] Deduced a trap composed of 49 places in 958 ms
[2020-05-27 20:49:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s957 s958 s959 s960 s961 s962 s982 s1059 s1060 s1065 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1097 s1122 s1123 s1124 s1125 s1126 s1128 s1136 s1137 s1138 s1141 s1142 s1168 s1174) 0)") while checking expression at index 0
[2020-05-27 20:49:56] [INFO ] [Real]Absence check using 331 positive place invariants in 368 ms returned sat
[2020-05-27 20:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:50:06] [INFO ] [Real]Absence check using state equation in 10323 ms returned sat
[2020-05-27 20:50:08] [INFO ] Deduced a trap composed of 23 places in 1177 ms
[2020-05-27 20:50:09] [INFO ] Deduced a trap composed of 20 places in 1017 ms
[2020-05-27 20:50:10] [INFO ] Deduced a trap composed of 16 places in 991 ms
[2020-05-27 20:50:11] [INFO ] Deduced a trap composed of 24 places in 965 ms
[2020-05-27 20:50:12] [INFO ] Deduced a trap composed of 26 places in 903 ms
[2020-05-27 20:50:13] [INFO ] Deduced a trap composed of 18 places in 973 ms
[2020-05-27 20:50:14] [INFO ] Deduced a trap composed of 25 places in 952 ms
[2020-05-27 20:50:15] [INFO ] Deduced a trap composed of 33 places in 1042 ms
[2020-05-27 20:50:16] [INFO ] Deduced a trap composed of 28 places in 939 ms
[2020-05-27 20:50:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s1419 s1420 s1421 s1422 s1423 s1424 s1444 s1551 s1552 s1553 s1554 s1555 s1556 s1557 s1558 s1559) 0)") while checking expression at index 1
[2020-05-27 20:50:17] [INFO ] [Real]Absence check using 331 positive place invariants in 380 ms returned sat
[2020-05-27 20:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:50:28] [INFO ] [Real]Absence check using state equation in 10610 ms returned sat
[2020-05-27 20:50:29] [INFO ] Deduced a trap composed of 18 places in 1108 ms
[2020-05-27 20:50:30] [INFO ] Deduced a trap composed of 32 places in 1129 ms
[2020-05-27 20:50:31] [INFO ] Deduced a trap composed of 27 places in 977 ms
[2020-05-27 20:50:32] [INFO ] Deduced a trap composed of 23 places in 1007 ms
[2020-05-27 20:50:33] [INFO ] Deduced a trap composed of 19 places in 979 ms
[2020-05-27 20:50:34] [INFO ] Deduced a trap composed of 18 places in 959 ms
[2020-05-27 20:50:35] [INFO ] Deduced a trap composed of 19 places in 986 ms
[2020-05-27 20:50:37] [INFO ] Deduced a trap composed of 24 places in 1157 ms
[2020-05-27 20:50:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s1727 s1728 s1729 s1730 s1731 s1732 s1752 s1859 s1860 s1861 s1862 s1863 s1864 s1865 s1866 s1867) 0)") while checking expression at index 2
[2020-05-27 20:50:37] [INFO ] [Real]Absence check using 331 positive place invariants in 356 ms returned sat
[2020-05-27 20:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:50:48] [INFO ] [Real]Absence check using state equation in 10531 ms returned sat
[2020-05-27 20:50:49] [INFO ] Deduced a trap composed of 19 places in 1251 ms
[2020-05-27 20:50:50] [INFO ] Deduced a trap composed of 28 places in 1167 ms
[2020-05-27 20:50:52] [INFO ] Deduced a trap composed of 18 places in 1145 ms
[2020-05-27 20:50:53] [INFO ] Deduced a trap composed of 18 places in 999 ms
[2020-05-27 20:50:54] [INFO ] Deduced a trap composed of 23 places in 986 ms
[2020-05-27 20:50:55] [INFO ] Deduced a trap composed of 25 places in 1210 ms
[2020-05-27 20:50:56] [INFO ] Deduced a trap composed of 24 places in 1140 ms
[2020-05-27 20:50:58] [INFO ] Deduced a trap composed of 35 places in 1147 ms
[2020-05-27 20:50:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s1815 s1816 s1817 s1819 s1820 s1821 s1838 s1839 s1840 s1841 s1842 s1843 s1844 s1845 s1881 s1882 s1899 s1900 s1905 s1947 s1949 s1950 s1951 s1952 s1953 s1954 s1955 s1956 s1957) 0)") while checking expression at index 3
[2020-05-27 20:50:58] [INFO ] [Real]Absence check using 331 positive place invariants in 350 ms returned sat
[2020-05-27 20:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:51:08] [INFO ] [Real]Absence check using state equation in 10387 ms returned sat
[2020-05-27 20:51:10] [INFO ] Deduced a trap composed of 35 places in 1112 ms
[2020-05-27 20:51:11] [INFO ] Deduced a trap composed of 25 places in 954 ms
[2020-05-27 20:51:12] [INFO ] Deduced a trap composed of 24 places in 1006 ms
[2020-05-27 20:51:13] [INFO ] Deduced a trap composed of 21 places in 955 ms
[2020-05-27 20:51:14] [INFO ] Deduced a trap composed of 21 places in 1070 ms
[2020-05-27 20:51:15] [INFO ] Deduced a trap composed of 37 places in 928 ms
[2020-05-27 20:51:16] [INFO ] Deduced a trap composed of 26 places in 907 ms
[2020-05-27 20:51:17] [INFO ] Deduced a trap composed of 18 places in 901 ms
[2020-05-27 20:51:18] [INFO ] Deduced a trap composed of 24 places in 916 ms
[2020-05-27 20:51:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2130 s2131 s2132 s2134 s2135 s2136 s2145 s2146 s2147 s2148 s2149 s2150 s2151 s2153 s2189 s2190 s2191 s2192 s2193 s2194 s2195 s2207) 0)") while checking expression at index 4
[2020-05-27 20:51:19] [INFO ] [Real]Absence check using 331 positive place invariants in 336 ms returned sat
[2020-05-27 20:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:51:28] [INFO ] [Real]Absence check using state equation in 9493 ms returned sat
[2020-05-27 20:51:29] [INFO ] Deduced a trap composed of 18 places in 1095 ms
[2020-05-27 20:51:31] [INFO ] Deduced a trap composed of 23 places in 961 ms
[2020-05-27 20:51:32] [INFO ] Deduced a trap composed of 18 places in 1107 ms
[2020-05-27 20:51:33] [INFO ] Deduced a trap composed of 21 places in 948 ms
[2020-05-27 20:51:34] [INFO ] Deduced a trap composed of 21 places in 905 ms
[2020-05-27 20:51:35] [INFO ] Deduced a trap composed of 34 places in 858 ms
[2020-05-27 20:51:36] [INFO ] Deduced a trap composed of 22 places in 843 ms
[2020-05-27 20:51:37] [INFO ] Deduced a trap composed of 27 places in 883 ms
[2020-05-27 20:51:38] [INFO ] Deduced a trap composed of 26 places in 808 ms
[2020-05-27 20:51:39] [INFO ] Deduced a trap composed of 20 places in 859 ms
[2020-05-27 20:51:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2189 s2190 s2191 s2192 s2193 s2194 s2214 s2216 s2217 s2256 s2257 s2258 s2259 s2260 s2261 s2262 s2263 s2264) 0)") while checking expression at index 5
[2020-05-27 20:51:39] [INFO ] [Real]Absence check using 331 positive place invariants in 445 ms returned sat
[2020-05-27 20:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:51:48] [INFO ] [Real]Absence check using state equation in 9164 ms returned sat
[2020-05-27 20:51:50] [INFO ] Deduced a trap composed of 22 places in 1074 ms
[2020-05-27 20:51:51] [INFO ] Deduced a trap composed of 21 places in 1130 ms
[2020-05-27 20:51:52] [INFO ] Deduced a trap composed of 18 places in 1009 ms
[2020-05-27 20:51:53] [INFO ] Deduced a trap composed of 17 places in 946 ms
[2020-05-27 20:51:54] [INFO ] Deduced a trap composed of 38 places in 897 ms
[2020-05-27 20:51:55] [INFO ] Deduced a trap composed of 31 places in 944 ms
[2020-05-27 20:51:56] [INFO ] Deduced a trap composed of 17 places in 1026 ms
[2020-05-27 20:51:57] [INFO ] Deduced a trap composed of 33 places in 895 ms
[2020-05-27 20:51:58] [INFO ] Deduced a trap composed of 34 places in 864 ms
[2020-05-27 20:51:59] [INFO ] Deduced a trap composed of 22 places in 814 ms
[2020-05-27 20:51:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2189 s2190 s2191 s2192 s2193 s2194 s2195 s2196 s2200 s2202 s2205 s2244 s2245 s2246 s2247 s2248 s2249 s2250 s2251 s2252) 0)") while checking expression at index 6
[2020-05-27 20:52:00] [INFO ] [Real]Absence check using 331 positive place invariants in 353 ms returned sat
[2020-05-27 20:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:52:10] [INFO ] [Real]Absence check using state equation in 10041 ms returned sat
[2020-05-27 20:52:11] [INFO ] Deduced a trap composed of 22 places in 1009 ms
[2020-05-27 20:52:12] [INFO ] Deduced a trap composed of 20 places in 1022 ms
[2020-05-27 20:52:13] [INFO ] Deduced a trap composed of 34 places in 850 ms
[2020-05-27 20:52:14] [INFO ] Deduced a trap composed of 33 places in 843 ms
[2020-05-27 20:52:15] [INFO ] Deduced a trap composed of 20 places in 1007 ms
[2020-05-27 20:52:16] [INFO ] Deduced a trap composed of 40 places in 898 ms
[2020-05-27 20:52:17] [INFO ] Deduced a trap composed of 29 places in 834 ms
[2020-05-27 20:52:18] [INFO ] Deduced a trap composed of 23 places in 823 ms
[2020-05-27 20:52:19] [INFO ] Deduced a trap composed of 32 places in 800 ms
[2020-05-27 20:52:20] [INFO ] Deduced a trap composed of 25 places in 821 ms
[2020-05-27 20:52:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s1650 s1651 s1668 s1669 s1670 s1673 s1674 s1675 s1676 s1677 s1679 s1680 s1681 s1716 s1725 s1726) 0)") while checking expression at index 7
[2020-05-27 20:52:20] [INFO ] [Real]Absence check using 331 positive place invariants in 489 ms returned sat
[2020-05-27 20:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:52:31] [INFO ] [Real]Absence check using state equation in 10350 ms returned sat
[2020-05-27 20:52:32] [INFO ] Deduced a trap composed of 29 places in 1028 ms
[2020-05-27 20:52:33] [INFO ] Deduced a trap composed of 22 places in 873 ms
[2020-05-27 20:52:34] [INFO ] Deduced a trap composed of 19 places in 876 ms
[2020-05-27 20:52:35] [INFO ] Deduced a trap composed of 18 places in 904 ms
[2020-05-27 20:52:36] [INFO ] Deduced a trap composed of 22 places in 1004 ms
[2020-05-27 20:52:37] [INFO ] Deduced a trap composed of 25 places in 886 ms
[2020-05-27 20:52:38] [INFO ] Deduced a trap composed of 21 places in 954 ms
[2020-05-27 20:52:39] [INFO ] Deduced a trap composed of 24 places in 822 ms
[2020-05-27 20:52:40] [INFO ] Deduced a trap composed of 31 places in 819 ms
[2020-05-27 20:52:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s1419 s1420 s1421 s1422 s1423 s1424 s1425 s1437 s1439 s1440 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s1459 s1460) 0)") while checking expression at index 8
[2020-05-27 20:52:41] [INFO ] [Real]Absence check using 331 positive place invariants in 361 ms returned sat
[2020-05-27 20:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:52:50] [INFO ] [Real]Absence check using state equation in 9881 ms returned sat
[2020-05-27 20:52:52] [INFO ] Deduced a trap composed of 22 places in 1104 ms
[2020-05-27 20:52:53] [INFO ] Deduced a trap composed of 34 places in 960 ms
[2020-05-27 20:52:54] [INFO ] Deduced a trap composed of 18 places in 930 ms
[2020-05-27 20:52:55] [INFO ] Deduced a trap composed of 31 places in 998 ms
[2020-05-27 20:52:56] [INFO ] Deduced a trap composed of 28 places in 1087 ms
[2020-05-27 20:52:57] [INFO ] Deduced a trap composed of 23 places in 1029 ms
[2020-05-27 20:52:58] [INFO ] Deduced a trap composed of 33 places in 826 ms
[2020-05-27 20:52:59] [INFO ] Deduced a trap composed of 21 places in 931 ms
[2020-05-27 20:53:00] [INFO ] Deduced a trap composed of 19 places in 1054 ms
[2020-05-27 20:53:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s2112 s2113 s2114 s2115 s2116 s2117 s2137 s2244 s2245 s2246 s2247 s2248 s2249 s2250 s2251 s2252) 0)") while checking expression at index 9
[2020-05-27 20:53:01] [INFO ] [Real]Absence check using 331 positive place invariants in 344 ms returned sat
[2020-05-27 20:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:53:11] [INFO ] [Real]Absence check using state equation in 10679 ms returned sat
[2020-05-27 20:53:13] [INFO ] Deduced a trap composed of 21 places in 1048 ms
[2020-05-27 20:53:14] [INFO ] Deduced a trap composed of 33 places in 871 ms
[2020-05-27 20:53:15] [INFO ] Deduced a trap composed of 32 places in 1014 ms
[2020-05-27 20:53:16] [INFO ] Deduced a trap composed of 26 places in 976 ms
[2020-05-27 20:53:17] [INFO ] Deduced a trap composed of 24 places in 985 ms
[2020-05-27 20:53:18] [INFO ] Deduced a trap composed of 22 places in 971 ms
[2020-05-27 20:53:19] [INFO ] Deduced a trap composed of 19 places in 921 ms
[2020-05-27 20:53:20] [INFO ] Deduced a trap composed of 28 places in 966 ms
[2020-05-27 20:53:21] [INFO ] Deduced a trap composed of 22 places in 798 ms
[2020-05-27 20:53:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s1881 s1882 s1883 s1884 s1885 s1886 s1906 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021) 0)") while checking expression at index 10
[2020-05-27 20:53:22] [INFO ] [Real]Absence check using 331 positive place invariants in 499 ms returned sat
[2020-05-27 20:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:53:32] [INFO ] [Real]Absence check using state equation in 10128 ms returned sat
[2020-05-27 20:53:33] [INFO ] Deduced a trap composed of 29 places in 1144 ms
[2020-05-27 20:53:34] [INFO ] Deduced a trap composed of 18 places in 1040 ms
[2020-05-27 20:53:35] [INFO ] Deduced a trap composed of 25 places in 1188 ms
[2020-05-27 20:53:37] [INFO ] Deduced a trap composed of 16 places in 1061 ms
[2020-05-27 20:53:38] [INFO ] Deduced a trap composed of 37 places in 993 ms
[2020-05-27 20:53:39] [INFO ] Deduced a trap composed of 43 places in 1100 ms
[2020-05-27 20:53:40] [INFO ] Deduced a trap composed of 34 places in 899 ms
[2020-05-27 20:53:41] [INFO ] Deduced a trap composed of 25 places in 1070 ms
[2020-05-27 20:53:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s1958 s1959 s1960 s1961 s1962 s1963 s1983 s2060 s2061 s2062 s2065 s2066 s2090 s2091 s2092 s2093 s2094 s2095 s2096 s2098) 0)") while checking expression at index 11
[2020-05-27 20:53:42] [INFO ] Flatten gal took : 202 ms
[2020-05-27 20:53:42] [INFO ] Flatten gal took : 115 ms
[2020-05-27 20:53:42] [INFO ] Applying decomposition
[2020-05-27 20:53:42] [INFO ] Flatten gal took : 105 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/graph11137226227950338997.txt, -o, /tmp/graph11137226227950338997.bin, -w, /tmp/graph11137226227950338997.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/graph11137226227950338997.bin, -l, -1, -v, -w, /tmp/graph11137226227950338997.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 20:53:42] [INFO ] Decomposing Gal with order
[2020-05-27 20:53:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 20:53:43] [INFO ] Removed a total of 180 redundant transitions.
[2020-05-27 20:53:43] [INFO ] Flatten gal took : 221 ms
[2020-05-27 20:53:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2020-05-27 20:53:43] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 64 ms
[2020-05-27 20:53:43] [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 43 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 27 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 39 ordering constraints for composite.
built 42 ordering constraints for composite.
built 12 ordering constraints for composite.
built 20 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 26 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 44 ordering constraints for composite.
built 39 ordering constraints for composite.
built 15 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 10 ordering constraints for composite.
built 26 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 42 ordering constraints for composite.
built 10 ordering constraints for composite.
built 20 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 39 ordering constraints for composite.
built 42 ordering constraints for composite.
built 43 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 42 ordering constraints for composite.
built 39 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 21:15:07] [INFO ] Applying decomposition
[2020-05-27 21:15:08] [INFO ] Flatten gal took : 363 ms
[2020-05-27 21:15:08] [INFO ] Decomposing Gal with order
[2020-05-27 21:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 21:15:09] [INFO ] Flatten gal took : 315 ms
[2020-05-27 21:15:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2020-05-27 21:15:09] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 60 ms
[2020-05-27 21:15:09] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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 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 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 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 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 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 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 21:36:34] [INFO ] Flatten gal took : 693 ms
[2020-05-27 21:36:37] [INFO ] Input system was already deterministic with 2133 transitions.
[2020-05-27 21:36:37] [INFO ] Transformed 2343 places.
[2020-05-27 21:36:37] [INFO ] Transformed 2133 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 21:36:38] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 48 ms
[2020-05-27 21:36:38] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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-159033476100692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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