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-159033475600339.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475600339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 3.5K May 14 01:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.0K May 13 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 512K May 12 20:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-030B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1590583544657

[2020-05-27 12:45:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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 12:45:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 12:45:46] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2020-05-27 12:45:46] [INFO ] Transformed 2103 places.
[2020-05-27 12:45:46] [INFO ] Transformed 1953 transitions.
[2020-05-27 12:45:46] [INFO ] Found NUPN structural information;
[2020-05-27 12:45:46] [INFO ] Parsed PT model containing 2103 places and 1953 transitions in 235 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 74 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 530 ms. (steps per millisecond=188 ) properties seen :[1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0]
// Phase 1: matrix 1953 rows 2103 cols
[2020-05-27 12:45:47] [INFO ] Computed 271 place invariants in 69 ms
[2020-05-27 12:45:47] [INFO ] [Real]Absence check using 271 positive place invariants in 320 ms returned sat
[2020-05-27 12:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:45:55] [INFO ] [Real]Absence check using state equation in 7916 ms returned sat
[2020-05-27 12:45:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:45:56] [INFO ] [Nat]Absence check using 271 positive place invariants in 600 ms returned sat
[2020-05-27 12:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:46:04] [INFO ] [Nat]Absence check using state equation in 8032 ms returned sat
[2020-05-27 12:46:05] [INFO ] Deduced a trap composed of 13 places in 1110 ms
[2020-05-27 12:46:06] [INFO ] Deduced a trap composed of 27 places in 911 ms
[2020-05-27 12:46:08] [INFO ] Deduced a trap composed of 17 places in 1087 ms
[2020-05-27 12:46:09] [INFO ] Deduced a trap composed of 21 places in 974 ms
[2020-05-27 12:46:10] [INFO ] Deduced a trap composed of 18 places in 812 ms
[2020-05-27 12:46:11] [INFO ] Deduced a trap composed of 24 places in 983 ms
[2020-05-27 12:46:12] [INFO ] Deduced a trap composed of 22 places in 965 ms
[2020-05-27 12:46:13] [INFO ] Deduced a trap composed of 32 places in 815 ms
[2020-05-27 12:46:14] [INFO ] Deduced a trap composed of 18 places in 810 ms
[2020-05-27 12:46:15] [INFO ] Deduced a trap composed of 30 places in 784 ms
[2020-05-27 12:46:15] [INFO ] Deduced a trap composed of 24 places in 778 ms
[2020-05-27 12:46:15] [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 s1206 s1207 s1224 s1225 s1226 s1227 s1228 s1229 s1264 s1273 s1274) 0)") while checking expression at index 0
[2020-05-27 12:46:16] [INFO ] [Real]Absence check using 271 positive place invariants in 269 ms returned sat
[2020-05-27 12:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:46:24] [INFO ] [Real]Absence check using state equation in 7985 ms returned sat
[2020-05-27 12:46:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:46:25] [INFO ] [Nat]Absence check using 271 positive place invariants in 505 ms returned sat
[2020-05-27 12:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:46:33] [INFO ] [Nat]Absence check using state equation in 8204 ms returned sat
[2020-05-27 12:46:34] [INFO ] Deduced a trap composed of 24 places in 1067 ms
[2020-05-27 12:46:35] [INFO ] Deduced a trap composed of 25 places in 931 ms
[2020-05-27 12:46:36] [INFO ] Deduced a trap composed of 36 places in 914 ms
[2020-05-27 12:46:37] [INFO ] Deduced a trap composed of 23 places in 983 ms
[2020-05-27 12:46:38] [INFO ] Deduced a trap composed of 18 places in 933 ms
[2020-05-27 12:46:39] [INFO ] Deduced a trap composed of 26 places in 930 ms
[2020-05-27 12:46:40] [INFO ] Deduced a trap composed of 20 places in 907 ms
[2020-05-27 12:46:41] [INFO ] Deduced a trap composed of 17 places in 883 ms
[2020-05-27 12:46:42] [INFO ] Deduced a trap composed of 28 places in 870 ms
[2020-05-27 12:46:43] [INFO ] Deduced a trap composed of 24 places in 828 ms
[2020-05-27 12:46:44] [INFO ] Deduced a trap composed of 23 places in 786 ms
[2020-05-27 12:46:45] [INFO ] Deduced a trap composed of 18 places in 851 ms
[2020-05-27 12:46:45] [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 s2034 s2035 s2036 s2037 s2038 s2045 s2046 s2047 s2048 s2049 s2052 s2053 s2054 s2058 s2067 s2068 s2069) 0)") while checking expression at index 1
[2020-05-27 12:46:45] [INFO ] [Real]Absence check using 271 positive place invariants in 360 ms returned sat
[2020-05-27 12:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:46:53] [INFO ] [Real]Absence check using state equation in 7938 ms returned sat
[2020-05-27 12:46:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:46:55] [INFO ] [Nat]Absence check using 271 positive place invariants in 730 ms returned sat
[2020-05-27 12:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:47:02] [INFO ] [Nat]Absence check using state equation in 7519 ms returned sat
[2020-05-27 12:47:03] [INFO ] Deduced a trap composed of 17 places in 1002 ms
[2020-05-27 12:47:04] [INFO ] Deduced a trap composed of 13 places in 844 ms
[2020-05-27 12:47:05] [INFO ] Deduced a trap composed of 20 places in 763 ms
[2020-05-27 12:47:06] [INFO ] Deduced a trap composed of 29 places in 759 ms
[2020-05-27 12:47:07] [INFO ] Deduced a trap composed of 34 places in 789 ms
[2020-05-27 12:47:07] [INFO ] Deduced a trap composed of 37 places in 694 ms
[2020-05-27 12:47:08] [INFO ] Deduced a trap composed of 24 places in 730 ms
[2020-05-27 12:47:09] [INFO ] Deduced a trap composed of 31 places in 725 ms
[2020-05-27 12:47:10] [INFO ] Deduced a trap composed of 18 places in 699 ms
[2020-05-27 12:47:10] [INFO ] Deduced a trap composed of 17 places in 752 ms
[2020-05-27 12:47:11] [INFO ] Deduced a trap composed of 26 places in 836 ms
[2020-05-27 12:47:12] [INFO ] Deduced a trap composed of 33 places in 715 ms
[2020-05-27 12:47:13] [INFO ] Deduced a trap composed of 31 places in 711 ms
[2020-05-27 12:47:14] [INFO ] Deduced a trap composed of 21 places in 924 ms
[2020-05-27 12:47:14] [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 s1827 s1828 s1829 s1830 s1831 s1832 s1848 s1850 s1874 s1875 s1876 s1877 s1878 s1879 s1880 s1881 s1882) 0)") while checking expression at index 2
[2020-05-27 12:47:14] [INFO ] [Real]Absence check using 271 positive place invariants in 256 ms returned sat
[2020-05-27 12:47:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:47:22] [INFO ] [Real]Absence check using state equation in 7988 ms returned sat
[2020-05-27 12:47:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:47:23] [INFO ] [Nat]Absence check using 271 positive place invariants in 480 ms returned sat
[2020-05-27 12:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:47:31] [INFO ] [Nat]Absence check using state equation in 7763 ms returned sat
[2020-05-27 12:47:32] [INFO ] Deduced a trap composed of 17 places in 977 ms
[2020-05-27 12:47:33] [INFO ] Deduced a trap composed of 23 places in 948 ms
[2020-05-27 12:47:34] [INFO ] Deduced a trap composed of 18 places in 792 ms
[2020-05-27 12:47:35] [INFO ] Deduced a trap composed of 14 places in 822 ms
[2020-05-27 12:47:36] [INFO ] Deduced a trap composed of 19 places in 784 ms
[2020-05-27 12:47:36] [INFO ] Deduced a trap composed of 30 places in 882 ms
[2020-05-27 12:47:37] [INFO ] Deduced a trap composed of 22 places in 914 ms
[2020-05-27 12:47:38] [INFO ] Deduced a trap composed of 29 places in 938 ms
[2020-05-27 12:47:39] [INFO ] Deduced a trap composed of 18 places in 742 ms
[2020-05-27 12:47:40] [INFO ] Deduced a trap composed of 31 places in 956 ms
[2020-05-27 12:47:41] [INFO ] Deduced a trap composed of 26 places in 780 ms
[2020-05-27 12:47:42] [INFO ] Deduced a trap composed of 19 places in 782 ms
[2020-05-27 12:47:43] [INFO ] Deduced a trap composed of 29 places in 787 ms
[2020-05-27 12:47:43] [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 s1206 s1207 s1208 s1209 s1210 s1211 s1212 s1213 s1217 s1243 s1244 s1245 s1246 s1247 s1248 s1249) 0)") while checking expression at index 3
[2020-05-27 12:47:43] [INFO ] [Real]Absence check using 271 positive place invariants in 264 ms returned sat
[2020-05-27 12:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:47:52] [INFO ] [Real]Absence check using state equation in 8479 ms returned sat
[2020-05-27 12:47:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:47:53] [INFO ] [Nat]Absence check using 271 positive place invariants in 625 ms returned sat
[2020-05-27 12:47:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:48:00] [INFO ] [Nat]Absence check using state equation in 7014 ms returned sat
[2020-05-27 12:48:01] [INFO ] Deduced a trap composed of 36 places in 995 ms
[2020-05-27 12:48:02] [INFO ] Deduced a trap composed of 27 places in 838 ms
[2020-05-27 12:48:03] [INFO ] Deduced a trap composed of 23 places in 907 ms
[2020-05-27 12:48:04] [INFO ] Deduced a trap composed of 26 places in 1028 ms
[2020-05-27 12:48:05] [INFO ] Deduced a trap composed of 21 places in 838 ms
[2020-05-27 12:48:06] [INFO ] Deduced a trap composed of 25 places in 906 ms
[2020-05-27 12:48:06] [INFO ] Deduced a trap composed of 26 places in 845 ms
[2020-05-27 12:48:07] [INFO ] Deduced a trap composed of 27 places in 939 ms
[2020-05-27 12:48:08] [INFO ] Deduced a trap composed of 27 places in 861 ms
[2020-05-27 12:48:09] [INFO ] Deduced a trap composed of 26 places in 873 ms
[2020-05-27 12:48:10] [INFO ] Deduced a trap composed of 24 places in 780 ms
[2020-05-27 12:48:11] [INFO ] Deduced a trap composed of 17 places in 813 ms
[2020-05-27 12:48:12] [INFO ] Deduced a trap composed of 23 places in 739 ms
[2020-05-27 12:48:12] [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 s1758 s1759 s1760 s1761 s1762 s1763 s1764 s1776 s1778 s1817 s1818 s1819 s1820 s1821 s1822 s1823 s1824 s1825) 0)") while checking expression at index 4
[2020-05-27 12:48:12] [INFO ] [Real]Absence check using 271 positive place invariants in 255 ms returned sat
[2020-05-27 12:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:48:20] [INFO ] [Real]Absence check using state equation in 7645 ms returned sat
[2020-05-27 12:48:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:48:21] [INFO ] [Nat]Absence check using 271 positive place invariants in 631 ms returned sat
[2020-05-27 12:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:48:28] [INFO ] [Nat]Absence check using state equation in 7351 ms returned sat
[2020-05-27 12:48:29] [INFO ] Deduced a trap composed of 27 places in 1018 ms
[2020-05-27 12:48:30] [INFO ] Deduced a trap composed of 27 places in 752 ms
[2020-05-27 12:48:31] [INFO ] Deduced a trap composed of 30 places in 760 ms
[2020-05-27 12:48:32] [INFO ] Deduced a trap composed of 19 places in 749 ms
[2020-05-27 12:48:32] [INFO ] Deduced a trap composed of 32 places in 777 ms
[2020-05-27 12:48:34] [INFO ] Deduced a trap composed of 20 places in 977 ms
[2020-05-27 12:48:34] [INFO ] Deduced a trap composed of 23 places in 732 ms
[2020-05-27 12:48:35] [INFO ] Deduced a trap composed of 23 places in 742 ms
[2020-05-27 12:48:36] [INFO ] Deduced a trap composed of 30 places in 724 ms
[2020-05-27 12:48:37] [INFO ] Deduced a trap composed of 30 places in 744 ms
[2020-05-27 12:48:37] [INFO ] Deduced a trap composed of 29 places in 737 ms
[2020-05-27 12:48:38] [INFO ] Deduced a trap composed of 29 places in 896 ms
[2020-05-27 12:48:39] [INFO ] Deduced a trap composed of 26 places in 930 ms
[2020-05-27 12:48:40] [INFO ] Deduced a trap composed of 20 places in 718 ms
[2020-05-27 12:48: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 s1827 s1828 s1829 s1830 s1831 s1832 s1833 s1834 s1838 s1864 s1865 s1866 s1867 s1868 s1869 s1870) 0)") while checking expression at index 5
[2020-05-27 12:48:41] [INFO ] [Real]Absence check using 271 positive place invariants in 250 ms returned sat
[2020-05-27 12:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:48:49] [INFO ] [Real]Absence check using state equation in 7913 ms returned sat
[2020-05-27 12:48:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:48:50] [INFO ] [Nat]Absence check using 271 positive place invariants in 637 ms returned sat
[2020-05-27 12:48:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:48:56] [INFO ] [Nat]Absence check using state equation in 6867 ms returned sat
[2020-05-27 12:48:57] [INFO ] Deduced a trap composed of 21 places in 952 ms
[2020-05-27 12:48:58] [INFO ] Deduced a trap composed of 26 places in 829 ms
[2020-05-27 12:48:59] [INFO ] Deduced a trap composed of 19 places in 801 ms
[2020-05-27 12:49:00] [INFO ] Deduced a trap composed of 18 places in 957 ms
[2020-05-27 12:49:01] [INFO ] Deduced a trap composed of 20 places in 917 ms
[2020-05-27 12:49:02] [INFO ] Deduced a trap composed of 22 places in 1019 ms
[2020-05-27 12:49:03] [INFO ] Deduced a trap composed of 21 places in 973 ms
[2020-05-27 12:49:04] [INFO ] Deduced a trap composed of 18 places in 893 ms
[2020-05-27 12:49:05] [INFO ] Deduced a trap composed of 18 places in 1028 ms
[2020-05-27 12:49:06] [INFO ] Deduced a trap composed of 21 places in 905 ms
[2020-05-27 12:49:07] [INFO ] Deduced a trap composed of 21 places in 936 ms
[2020-05-27 12:49:08] [INFO ] Deduced a trap composed of 28 places in 833 ms
[2020-05-27 12:49:09] [INFO ] Deduced a trap composed of 14 places in 952 ms
[2020-05-27 12:49:09] [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 s1896 s1897 s1914 s1915 s1916 s1917 s1918 s1919 s1954 s1963 s1964) 0)") while checking expression at index 6
[2020-05-27 12:49:10] [INFO ] [Real]Absence check using 271 positive place invariants in 294 ms returned sat
[2020-05-27 12:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:49:17] [INFO ] [Real]Absence check using state equation in 7568 ms returned sat
[2020-05-27 12:49:18] [INFO ] Deduced a trap composed of 12 places in 868 ms
[2020-05-27 12:49:19] [INFO ] Deduced a trap composed of 28 places in 1031 ms
[2020-05-27 12:49:20] [INFO ] Deduced a trap composed of 36 places in 891 ms
[2020-05-27 12:49:21] [INFO ] Deduced a trap composed of 20 places in 762 ms
[2020-05-27 12:49:22] [INFO ] Deduced a trap composed of 33 places in 824 ms
[2020-05-27 12:49:23] [INFO ] Deduced a trap composed of 23 places in 810 ms
[2020-05-27 12:49:24] [INFO ] Deduced a trap composed of 32 places in 787 ms
[2020-05-27 12:49:25] [INFO ] Deduced a trap composed of 22 places in 761 ms
[2020-05-27 12:49:26] [INFO ] Deduced a trap composed of 31 places in 768 ms
[2020-05-27 12:49:26] [INFO ] Deduced a trap composed of 33 places in 831 ms
[2020-05-27 12:49:27] [INFO ] Deduced a trap composed of 46 places in 972 ms
[2020-05-27 12:49:28] [INFO ] Deduced a trap composed of 24 places in 728 ms
[2020-05-27 12:49:29] [INFO ] Deduced a trap composed of 34 places in 751 ms
[2020-05-27 12:49:30] [INFO ] Deduced a trap composed of 28 places in 933 ms
[2020-05-27 12:49:30] [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 s1275 s1276 s1277 s1278 s1279 s1280 s1296 s1391 s1392 s1393 s1394 s1395 s1396 s1397 s1398 s1399) 0)") while checking expression at index 7
[2020-05-27 12:49:31] [INFO ] [Real]Absence check using 271 positive place invariants in 264 ms returned sat
[2020-05-27 12:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:49:39] [INFO ] [Real]Absence check using state equation in 8226 ms returned sat
[2020-05-27 12:49:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:49:40] [INFO ] [Nat]Absence check using 271 positive place invariants in 612 ms returned sat
[2020-05-27 12:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:49:47] [INFO ] [Nat]Absence check using state equation in 7537 ms returned sat
[2020-05-27 12:49:48] [INFO ] Deduced a trap composed of 22 places in 1136 ms
[2020-05-27 12:49:49] [INFO ] Deduced a trap composed of 17 places in 930 ms
[2020-05-27 12:49:51] [INFO ] Deduced a trap composed of 29 places in 1048 ms
[2020-05-27 12:49:51] [INFO ] Deduced a trap composed of 19 places in 894 ms
[2020-05-27 12:49:53] [INFO ] Deduced a trap composed of 19 places in 1043 ms
[2020-05-27 12:49:53] [INFO ] Deduced a trap composed of 20 places in 825 ms
[2020-05-27 12:49:54] [INFO ] Deduced a trap composed of 14 places in 825 ms
[2020-05-27 12:49:55] [INFO ] Deduced a trap composed of 25 places in 872 ms
[2020-05-27 12:49:56] [INFO ] Deduced a trap composed of 20 places in 978 ms
[2020-05-27 12:49:57] [INFO ] Deduced a trap composed of 22 places in 929 ms
[2020-05-27 12:49:58] [INFO ] Deduced a trap composed of 18 places in 883 ms
[2020-05-27 12:49:59] [INFO ] Deduced a trap composed of 18 places in 891 ms
[2020-05-27 12:49: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 s2 s3 s4 s5 s6 s1620 s1621 s1622 s1623 s1628 s1629 s1630 s1656 s1663 s1664 s1665) 0)") while checking expression at index 8
[2020-05-27 12:50:00] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 12:50:00] [INFO ] Flatten gal took : 174 ms
[2020-05-27 12:50:00] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 12:50:00] [INFO ] Flatten gal took : 69 ms
FORMULA ShieldIIPt-PT-030B-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 12:50:00] [INFO ] Applying decomposition
[2020-05-27 12:50:00] [INFO ] Flatten gal took : 66 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/graph10235116414727844302.txt, -o, /tmp/graph10235116414727844302.bin, -w, /tmp/graph10235116414727844302.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/graph10235116414727844302.bin, -l, -1, -v, -w, /tmp/graph10235116414727844302.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 12:50:00] [INFO ] Decomposing Gal with order
[2020-05-27 12:50:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:50:01] [INFO ] Removed a total of 180 redundant transitions.
[2020-05-27 12:50:01] [INFO ] Flatten gal took : 195 ms
[2020-05-27 12:50:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2020-05-27 12:50:01] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 34 ms
[2020-05-27 12:50:01] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.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/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.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/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
built 45 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 8 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 35 ordering constraints for composite.
built 12 ordering constraints for composite.
built 20 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 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 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 35 ordering constraints for composite.
built 38 ordering constraints for composite.
built 35 ordering constraints for composite.
built 38 ordering constraints for composite.
built 35 ordering constraints for composite.
built 38 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 43 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 41 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 15 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 22 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 31 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 13:11:27] [INFO ] Applying decomposition
[2020-05-27 13:11:29] [INFO ] Flatten gal took : 1772 ms
[2020-05-27 13:11:29] [INFO ] Decomposing Gal with order
[2020-05-27 13:11:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 13:11:29] [INFO ] Flatten gal took : 133 ms
[2020-05-27 13:11:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2020-05-27 13:11:30] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 26 ms
[2020-05-27 13:11:30] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.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/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.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/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 12 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 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 13:32:57] [INFO ] Flatten gal took : 1499 ms
[2020-05-27 13:32:58] [INFO ] Input system was already deterministic with 1953 transitions.
[2020-05-27 13:32:58] [INFO ] Transformed 2103 places.
[2020-05-27 13:32:58] [INFO ] Transformed 1953 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 13:32:58] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 28 ms
[2020-05-27 13:32:58] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.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/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.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 12 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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-030B, examination is CTLCardinality"
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-159033475600339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;