About the Execution of ITS-Tools for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15725.930 | 526129.00 | 556124.00 | 1603.80 | FTFFFTFTFFFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200571.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200571
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 4.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 159K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1589255830474
[2020-05-12 03:57:11] [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-12 03:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:57:11] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-05-12 03:57:11] [INFO ] Transformed 638 places.
[2020-05-12 03:57:11] [INFO ] Transformed 578 transitions.
[2020-05-12 03:57:11] [INFO ] Found NUPN structural information;
[2020-05-12 03:57:11] [INFO ] Parsed PT model containing 638 places and 578 transitions in 107 ms.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Incomplete random walk after 100000 steps, including 664 resets, run finished after 256 ms. (steps per millisecond=390 ) properties seen :[1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 570 rows 630 cols
[2020-05-12 03:57:12] [INFO ] Computed 100 place invariants in 34 ms
[2020-05-12 03:57:12] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2020-05-12 03:57:12] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 25 ms returned sat
[2020-05-12 03:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:13] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2020-05-12 03:57:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:57:13] [INFO ] [Nat]Absence check using 62 positive place invariants in 78 ms returned sat
[2020-05-12 03:57:13] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 03:57:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:14] [INFO ] [Nat]Absence check using state equation in 490 ms returned unsat
[2020-05-12 03:57:14] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-05-12 03:57:14] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 25 ms returned sat
[2020-05-12 03:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:15] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2020-05-12 03:57:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:57:15] [INFO ] [Nat]Absence check using 62 positive place invariants in 62 ms returned sat
[2020-05-12 03:57:15] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2020-05-12 03:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:15] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2020-05-12 03:57:16] [INFO ] Deduced a trap composed of 16 places in 199 ms
[2020-05-12 03:57:16] [INFO ] Deduced a trap composed of 24 places in 211 ms
[2020-05-12 03:57:16] [INFO ] Deduced a trap composed of 13 places in 119 ms
[2020-05-12 03:57:16] [INFO ] Deduced a trap composed of 12 places in 136 ms
[2020-05-12 03:57:16] [INFO ] Deduced a trap composed of 14 places in 109 ms
[2020-05-12 03:57:16] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2020-05-12 03:57:17] [INFO ] Deduced a trap composed of 28 places in 132 ms
[2020-05-12 03:57:17] [INFO ] Deduced a trap composed of 17 places in 131 ms
[2020-05-12 03:57:17] [INFO ] Deduced a trap composed of 14 places in 110 ms
[2020-05-12 03:57:17] [INFO ] Deduced a trap composed of 15 places in 119 ms
[2020-05-12 03:57:17] [INFO ] Deduced a trap composed of 36 places in 114 ms
[2020-05-12 03:57:17] [INFO ] Deduced a trap composed of 16 places in 102 ms
[2020-05-12 03:57:17] [INFO ] Deduced a trap composed of 41 places in 100 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 25 places in 97 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 41 places in 101 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 45 places in 101 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 29 places in 83 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 58 places in 319 ms
[2020-05-12 03:57:18] [INFO ] Deduced a trap composed of 39 places in 91 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 16 places in 96 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 75 places in 86 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 44 places in 79 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 28 places in 90 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 48 places in 85 ms
[2020-05-12 03:57:19] [INFO ] Deduced a trap composed of 32 places in 31 ms
[2020-05-12 03:57:19] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3706 ms
[2020-05-12 03:57:19] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 42 ms.
[2020-05-12 03:57:24] [INFO ] Added : 444 causal constraints over 89 iterations in 5028 ms. Result :sat
[2020-05-12 03:57:24] [INFO ] [Real]Absence check using 62 positive place invariants in 48 ms returned sat
[2020-05-12 03:57:24] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 40 ms returned sat
[2020-05-12 03:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:25] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2020-05-12 03:57:25] [INFO ] Deduced a trap composed of 18 places in 165 ms
[2020-05-12 03:57:26] [INFO ] Deduced a trap composed of 8 places in 228 ms
[2020-05-12 03:57:26] [INFO ] Deduced a trap composed of 11 places in 178 ms
[2020-05-12 03:57:26] [INFO ] Deduced a trap composed of 20 places in 167 ms
[2020-05-12 03:57:26] [INFO ] Deduced a trap composed of 15 places in 145 ms
[2020-05-12 03:57:26] [INFO ] Deduced a trap composed of 19 places in 61 ms
[2020-05-12 03:57:26] [INFO ] Deduced a trap composed of 27 places in 47 ms
[2020-05-12 03:57:26] [INFO ] Deduced a trap composed of 31 places in 71 ms
[2020-05-12 03:57:26] [INFO ] Deduced a trap composed of 47 places in 49 ms
[2020-05-12 03:57:27] [INFO ] Deduced a trap composed of 35 places in 40 ms
[2020-05-12 03:57:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1416 ms
[2020-05-12 03:57:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:57:27] [INFO ] [Nat]Absence check using 62 positive place invariants in 63 ms returned sat
[2020-05-12 03:57:27] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 03:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:27] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2020-05-12 03:57:28] [INFO ] Deduced a trap composed of 8 places in 243 ms
[2020-05-12 03:57:28] [INFO ] Deduced a trap composed of 15 places in 173 ms
[2020-05-12 03:57:28] [INFO ] Deduced a trap composed of 12 places in 144 ms
[2020-05-12 03:57:28] [INFO ] Deduced a trap composed of 16 places in 181 ms
[2020-05-12 03:57:28] [INFO ] Deduced a trap composed of 15 places in 155 ms
[2020-05-12 03:57:29] [INFO ] Deduced a trap composed of 35 places in 56 ms
[2020-05-12 03:57:29] [INFO ] Deduced a trap composed of 42 places in 55 ms
[2020-05-12 03:57:29] [INFO ] Deduced a trap composed of 31 places in 49 ms
[2020-05-12 03:57:29] [INFO ] Deduced a trap composed of 29 places in 53 ms
[2020-05-12 03:57:29] [INFO ] Deduced a trap composed of 45 places in 56 ms
[2020-05-12 03:57:29] [INFO ] Deduced a trap composed of 52 places in 57 ms
[2020-05-12 03:57:29] [INFO ] Deduced a trap composed of 48 places in 55 ms
[2020-05-12 03:57:29] [INFO ] Deduced a trap composed of 34 places in 46 ms
[2020-05-12 03:57:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1654 ms
[2020-05-12 03:57:29] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 24 ms.
[2020-05-12 03:57:32] [INFO ] Added : 335 causal constraints over 67 iterations in 2653 ms. Result :sat
[2020-05-12 03:57:32] [INFO ] Deduced a trap composed of 138 places in 171 ms
[2020-05-12 03:57:32] [INFO ] Deduced a trap composed of 142 places in 138 ms
[2020-05-12 03:57:32] [INFO ] Deduced a trap composed of 138 places in 129 ms
[2020-05-12 03:57:33] [INFO ] Deduced a trap composed of 140 places in 125 ms
[2020-05-12 03:57:33] [INFO ] Deduced a trap composed of 137 places in 133 ms
[2020-05-12 03:57:33] [INFO ] Deduced a trap composed of 144 places in 148 ms
[2020-05-12 03:57:33] [INFO ] Deduced a trap composed of 147 places in 135 ms
[2020-05-12 03:57:33] [INFO ] Deduced a trap composed of 159 places in 136 ms
[2020-05-12 03:57:33] [INFO ] Deduced a trap composed of 155 places in 135 ms
[2020-05-12 03:57:34] [INFO ] Deduced a trap composed of 147 places in 143 ms
[2020-05-12 03:57:34] [INFO ] Deduced a trap composed of 145 places in 130 ms
[2020-05-12 03:57:34] [INFO ] Deduced a trap composed of 144 places in 133 ms
[2020-05-12 03:57:34] [INFO ] Deduced a trap composed of 143 places in 131 ms
[2020-05-12 03:57:34] [INFO ] Deduced a trap composed of 141 places in 131 ms
[2020-05-12 03:57:35] [INFO ] Deduced a trap composed of 142 places in 137 ms
[2020-05-12 03:57:35] [INFO ] Deduced a trap composed of 139 places in 136 ms
[2020-05-12 03:57:35] [INFO ] Deduced a trap composed of 142 places in 150 ms
[2020-05-12 03:57:35] [INFO ] Deduced a trap composed of 136 places in 127 ms
[2020-05-12 03:57:35] [INFO ] Deduced a trap composed of 138 places in 124 ms
[2020-05-12 03:57:35] [INFO ] Deduced a trap composed of 140 places in 124 ms
[2020-05-12 03:57:36] [INFO ] Deduced a trap composed of 138 places in 129 ms
[2020-05-12 03:57:36] [INFO ] Deduced a trap composed of 144 places in 124 ms
[2020-05-12 03:57:36] [INFO ] Deduced a trap composed of 146 places in 131 ms
[2020-05-12 03:57:36] [INFO ] Deduced a trap composed of 144 places in 125 ms
[2020-05-12 03:57:36] [INFO ] Deduced a trap composed of 142 places in 124 ms
[2020-05-12 03:57:37] [INFO ] Deduced a trap composed of 141 places in 127 ms
[2020-05-12 03:57:37] [INFO ] Deduced a trap composed of 138 places in 129 ms
[2020-05-12 03:57:37] [INFO ] Deduced a trap composed of 161 places in 128 ms
[2020-05-12 03:57:37] [INFO ] Deduced a trap composed of 168 places in 131 ms
[2020-05-12 03:57:37] [INFO ] Deduced a trap composed of 147 places in 146 ms
[2020-05-12 03:57:37] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5673 ms
[2020-05-12 03:57:38] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-05-12 03:57:38] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 03:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:38] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2020-05-12 03:57:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:57:38] [INFO ] [Nat]Absence check using 62 positive place invariants in 80 ms returned sat
[2020-05-12 03:57:38] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2020-05-12 03:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:39] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2020-05-12 03:57:39] [INFO ] Deduced a trap composed of 15 places in 183 ms
[2020-05-12 03:57:40] [INFO ] Deduced a trap composed of 8 places in 163 ms
[2020-05-12 03:57:40] [INFO ] Deduced a trap composed of 120 places in 161 ms
[2020-05-12 03:57:40] [INFO ] Deduced a trap composed of 39 places in 155 ms
[2020-05-12 03:57:40] [INFO ] Deduced a trap composed of 147 places in 164 ms
[2020-05-12 03:57:40] [INFO ] Deduced a trap composed of 37 places in 162 ms
[2020-05-12 03:57:41] [INFO ] Deduced a trap composed of 14 places in 157 ms
[2020-05-12 03:57:41] [INFO ] Deduced a trap composed of 32 places in 156 ms
[2020-05-12 03:57:41] [INFO ] Deduced a trap composed of 133 places in 177 ms
[2020-05-12 03:57:41] [INFO ] Deduced a trap composed of 15 places in 156 ms
[2020-05-12 03:57:41] [INFO ] Deduced a trap composed of 27 places in 131 ms
[2020-05-12 03:57:41] [INFO ] Deduced a trap composed of 27 places in 157 ms
[2020-05-12 03:57:42] [INFO ] Deduced a trap composed of 22 places in 129 ms
[2020-05-12 03:57:42] [INFO ] Deduced a trap composed of 32 places in 126 ms
[2020-05-12 03:57:42] [INFO ] Deduced a trap composed of 45 places in 129 ms
[2020-05-12 03:57:42] [INFO ] Deduced a trap composed of 121 places in 144 ms
[2020-05-12 03:57:42] [INFO ] Deduced a trap composed of 156 places in 134 ms
[2020-05-12 03:57:42] [INFO ] Deduced a trap composed of 124 places in 145 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 43 places in 162 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 69 places in 158 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 39 places in 179 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 146 places in 135 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 135 places in 166 ms
[2020-05-12 03:57:43] [INFO ] Deduced a trap composed of 44 places in 145 ms
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 149 places in 134 ms
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 157 places in 133 ms
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 41 places in 36 ms
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 35 places in 142 ms
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 47 places in 134 ms
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 33 places in 142 ms
[2020-05-12 03:57:44] [INFO ] Deduced a trap composed of 150 places in 140 ms
[2020-05-12 03:57:45] [INFO ] Deduced a trap composed of 55 places in 56 ms
[2020-05-12 03:57:45] [INFO ] Deduced a trap composed of 51 places in 60 ms
[2020-05-12 03:57:45] [INFO ] Deduced a trap composed of 143 places in 143 ms
[2020-05-12 03:57:45] [INFO ] Deduced a trap composed of 147 places in 170 ms
[2020-05-12 03:57:45] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5782 ms
[2020-05-12 03:57:45] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 20 ms.
[2020-05-12 03:57:51] [INFO ] Added : 453 causal constraints over 92 iterations in 5666 ms. Result :sat
[2020-05-12 03:57:51] [INFO ] Deduced a trap composed of 139 places in 160 ms
[2020-05-12 03:57:51] [INFO ] Deduced a trap composed of 36 places in 136 ms
[2020-05-12 03:57:51] [INFO ] Deduced a trap composed of 143 places in 130 ms
[2020-05-12 03:57:52] [INFO ] Deduced a trap composed of 140 places in 138 ms
[2020-05-12 03:57:52] [INFO ] Deduced a trap composed of 141 places in 131 ms
[2020-05-12 03:57:52] [INFO ] Deduced a trap composed of 155 places in 138 ms
[2020-05-12 03:57:52] [INFO ] Deduced a trap composed of 162 places in 123 ms
[2020-05-12 03:57:53] [INFO ] Deduced a trap composed of 147 places in 116 ms
[2020-05-12 03:57:53] [INFO ] Deduced a trap composed of 145 places in 121 ms
[2020-05-12 03:57:53] [INFO ] Deduced a trap composed of 134 places in 114 ms
[2020-05-12 03:57:53] [INFO ] Deduced a trap composed of 139 places in 111 ms
[2020-05-12 03:57:54] [INFO ] Deduced a trap composed of 143 places in 123 ms
[2020-05-12 03:57:54] [INFO ] Deduced a trap composed of 141 places in 111 ms
[2020-05-12 03:57:54] [INFO ] Deduced a trap composed of 162 places in 106 ms
[2020-05-12 03:57:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3635 ms
[2020-05-12 03:57:54] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2020-05-12 03:57:54] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2020-05-12 03:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:55] [INFO ] [Real]Absence check using state equation in 724 ms returned sat
[2020-05-12 03:57:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:57:55] [INFO ] [Nat]Absence check using 62 positive place invariants in 113 ms returned sat
[2020-05-12 03:57:55] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2020-05-12 03:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:57:56] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2020-05-12 03:57:56] [INFO ] Deduced a trap composed of 15 places in 187 ms
[2020-05-12 03:57:56] [INFO ] Deduced a trap composed of 14 places in 92 ms
[2020-05-12 03:57:57] [INFO ] Deduced a trap composed of 22 places in 333 ms
[2020-05-12 03:57:57] [INFO ] Deduced a trap composed of 8 places in 127 ms
[2020-05-12 03:57:57] [INFO ] Deduced a trap composed of 11 places in 88 ms
[2020-05-12 03:57:57] [INFO ] Deduced a trap composed of 44 places in 86 ms
[2020-05-12 03:57:57] [INFO ] Deduced a trap composed of 36 places in 88 ms
[2020-05-12 03:57:57] [INFO ] Deduced a trap composed of 16 places in 74 ms
[2020-05-12 03:57:57] [INFO ] Deduced a trap composed of 14 places in 75 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 29 places in 76 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 25 places in 70 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 16 places in 70 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 27 places in 82 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 22 places in 69 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 29 places in 70 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 48 places in 61 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 45 places in 58 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 28 places in 74 ms
[2020-05-12 03:57:58] [INFO ] Deduced a trap composed of 25 places in 62 ms
[2020-05-12 03:57:59] [INFO ] Deduced a trap composed of 39 places in 59 ms
[2020-05-12 03:57:59] [INFO ] Deduced a trap composed of 18 places in 60 ms
[2020-05-12 03:57:59] [INFO ] Deduced a trap composed of 32 places in 31 ms
[2020-05-12 03:57:59] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2529 ms
[2020-05-12 03:57:59] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 21 ms.
[2020-05-12 03:58:03] [INFO ] Added : 401 causal constraints over 81 iterations in 3989 ms. Result :sat
[2020-05-12 03:58:03] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-05-12 03:58:03] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 29 ms returned sat
[2020-05-12 03:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:04] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2020-05-12 03:58:04] [INFO ] Deduced a trap composed of 16 places in 155 ms
[2020-05-12 03:58:04] [INFO ] Deduced a trap composed of 13 places in 159 ms
[2020-05-12 03:58:04] [INFO ] Deduced a trap composed of 16 places in 154 ms
[2020-05-12 03:58:04] [INFO ] Deduced a trap composed of 23 places in 140 ms
[2020-05-12 03:58:05] [INFO ] Deduced a trap composed of 11 places in 141 ms
[2020-05-12 03:58:05] [INFO ] Deduced a trap composed of 16 places in 176 ms
[2020-05-12 03:58:05] [INFO ] Deduced a trap composed of 34 places in 131 ms
[2020-05-12 03:58:05] [INFO ] Deduced a trap composed of 30 places in 485 ms
[2020-05-12 03:58:06] [INFO ] Deduced a trap composed of 121 places in 138 ms
[2020-05-12 03:58:06] [INFO ] Deduced a trap composed of 137 places in 128 ms
[2020-05-12 03:58:06] [INFO ] Deduced a trap composed of 119 places in 136 ms
[2020-05-12 03:58:06] [INFO ] Deduced a trap composed of 34 places in 141 ms
[2020-05-12 03:58:06] [INFO ] Deduced a trap composed of 18 places in 135 ms
[2020-05-12 03:58:06] [INFO ] Deduced a trap composed of 118 places in 127 ms
[2020-05-12 03:58:07] [INFO ] Deduced a trap composed of 29 places in 122 ms
[2020-05-12 03:58:07] [INFO ] Deduced a trap composed of 32 places in 130 ms
[2020-05-12 03:58:07] [INFO ] Deduced a trap composed of 33 places in 85 ms
[2020-05-12 03:58:07] [INFO ] Deduced a trap composed of 38 places in 84 ms
[2020-05-12 03:58:07] [INFO ] Deduced a trap composed of 36 places in 68 ms
[2020-05-12 03:58:07] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2020-05-12 03:58:07] [INFO ] Deduced a trap composed of 54 places in 72 ms
[2020-05-12 03:58:07] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3517 ms
[2020-05-12 03:58:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:58:07] [INFO ] [Nat]Absence check using 62 positive place invariants in 62 ms returned sat
[2020-05-12 03:58:07] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2020-05-12 03:58:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:08] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2020-05-12 03:58:08] [INFO ] Deduced a trap composed of 15 places in 164 ms
[2020-05-12 03:58:08] [INFO ] Deduced a trap composed of 13 places in 162 ms
[2020-05-12 03:58:09] [INFO ] Deduced a trap composed of 14 places in 158 ms
[2020-05-12 03:58:09] [INFO ] Deduced a trap composed of 13 places in 153 ms
[2020-05-12 03:58:09] [INFO ] Deduced a trap composed of 11 places in 154 ms
[2020-05-12 03:58:09] [INFO ] Deduced a trap composed of 16 places in 154 ms
[2020-05-12 03:58:09] [INFO ] Deduced a trap composed of 111 places in 154 ms
[2020-05-12 03:58:10] [INFO ] Deduced a trap composed of 30 places in 158 ms
[2020-05-12 03:58:10] [INFO ] Deduced a trap composed of 14 places in 170 ms
[2020-05-12 03:58:10] [INFO ] Deduced a trap composed of 13 places in 133 ms
[2020-05-12 03:58:10] [INFO ] Deduced a trap composed of 30 places in 129 ms
[2020-05-12 03:58:10] [INFO ] Deduced a trap composed of 38 places in 132 ms
[2020-05-12 03:58:10] [INFO ] Deduced a trap composed of 26 places in 157 ms
[2020-05-12 03:58:11] [INFO ] Deduced a trap composed of 136 places in 133 ms
[2020-05-12 03:58:11] [INFO ] Deduced a trap composed of 122 places in 133 ms
[2020-05-12 03:58:11] [INFO ] Deduced a trap composed of 120 places in 131 ms
[2020-05-12 03:58:11] [INFO ] Deduced a trap composed of 32 places in 145 ms
[2020-05-12 03:58:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2907 ms
[2020-05-12 03:58:11] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 24 ms.
[2020-05-12 03:58:13] [INFO ] Added : 264 causal constraints over 54 iterations in 1942 ms. Result :sat
[2020-05-12 03:58:13] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2020-05-12 03:58:13] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 24 ms returned sat
[2020-05-12 03:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:14] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2020-05-12 03:58:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:58:14] [INFO ] [Nat]Absence check using 62 positive place invariants in 71 ms returned sat
[2020-05-12 03:58:14] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 20 ms returned sat
[2020-05-12 03:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:15] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2020-05-12 03:58:15] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2020-05-12 03:58:15] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2020-05-12 03:58:15] [INFO ] Deduced a trap composed of 17 places in 103 ms
[2020-05-12 03:58:15] [INFO ] Deduced a trap composed of 17 places in 103 ms
[2020-05-12 03:58:15] [INFO ] Deduced a trap composed of 12 places in 106 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 36 places in 102 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 17 places in 82 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 13 places in 81 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 16 places in 87 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 22 places in 96 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 36 places in 89 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 33 places in 62 ms
[2020-05-12 03:58:16] [INFO ] Deduced a trap composed of 40 places in 62 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 37 places in 60 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 38 places in 70 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 45 places in 62 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 14 places in 62 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 26 places in 66 ms
[2020-05-12 03:58:17] [INFO ] Deduced a trap composed of 38 places in 34 ms
[2020-05-12 03:58:17] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2138 ms
[2020-05-12 03:58:17] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 22 ms.
[2020-05-12 03:58:21] [INFO ] Added : 382 causal constraints over 77 iterations in 3905 ms. Result :sat
[2020-05-12 03:58:21] [INFO ] [Real]Absence check using 62 positive place invariants in 68 ms returned sat
[2020-05-12 03:58:21] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2020-05-12 03:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:22] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2020-05-12 03:58:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:58:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 59 ms returned sat
[2020-05-12 03:58:22] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 03:58:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:23] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2020-05-12 03:58:23] [INFO ] Deduced a trap composed of 8 places in 223 ms
[2020-05-12 03:58:23] [INFO ] Deduced a trap composed of 14 places in 197 ms
[2020-05-12 03:58:23] [INFO ] Deduced a trap composed of 17 places in 182 ms
[2020-05-12 03:58:24] [INFO ] Deduced a trap composed of 11 places in 259 ms
[2020-05-12 03:58:24] [INFO ] Deduced a trap composed of 8 places in 216 ms
[2020-05-12 03:58:24] [INFO ] Deduced a trap composed of 15 places in 200 ms
[2020-05-12 03:58:24] [INFO ] Deduced a trap composed of 18 places in 161 ms
[2020-05-12 03:58:25] [INFO ] Deduced a trap composed of 16 places in 165 ms
[2020-05-12 03:58:25] [INFO ] Deduced a trap composed of 14 places in 138 ms
[2020-05-12 03:58:25] [INFO ] Deduced a trap composed of 30 places in 140 ms
[2020-05-12 03:58:25] [INFO ] Deduced a trap composed of 26 places in 138 ms
[2020-05-12 03:58:25] [INFO ] Deduced a trap composed of 22 places in 138 ms
[2020-05-12 03:58:25] [INFO ] Deduced a trap composed of 120 places in 136 ms
[2020-05-12 03:58:26] [INFO ] Deduced a trap composed of 29 places in 133 ms
[2020-05-12 03:58:26] [INFO ] Deduced a trap composed of 30 places in 133 ms
[2020-05-12 03:58:26] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-05-12 03:58:26] [INFO ] Deduced a trap composed of 42 places in 133 ms
[2020-05-12 03:58:26] [INFO ] Deduced a trap composed of 26 places in 146 ms
[2020-05-12 03:58:26] [INFO ] Deduced a trap composed of 43 places in 135 ms
[2020-05-12 03:58:26] [INFO ] Deduced a trap composed of 130 places in 132 ms
[2020-05-12 03:58:27] [INFO ] Deduced a trap composed of 50 places in 134 ms
[2020-05-12 03:58:27] [INFO ] Deduced a trap composed of 137 places in 147 ms
[2020-05-12 03:58:27] [INFO ] Deduced a trap composed of 48 places in 135 ms
[2020-05-12 03:58:27] [INFO ] Deduced a trap composed of 59 places in 155 ms
[2020-05-12 03:58:27] [INFO ] Deduced a trap composed of 123 places in 133 ms
[2020-05-12 03:58:27] [INFO ] Deduced a trap composed of 140 places in 140 ms
[2020-05-12 03:58:28] [INFO ] Deduced a trap composed of 50 places in 133 ms
[2020-05-12 03:58:28] [INFO ] Deduced a trap composed of 121 places in 178 ms
[2020-05-12 03:58:28] [INFO ] Deduced a trap composed of 35 places in 151 ms
[2020-05-12 03:58:28] [INFO ] Deduced a trap composed of 59 places in 159 ms
[2020-05-12 03:58:28] [INFO ] Deduced a trap composed of 133 places in 154 ms
[2020-05-12 03:58:28] [INFO ] Deduced a trap composed of 58 places in 138 ms
[2020-05-12 03:58:29] [INFO ] Deduced a trap composed of 67 places in 129 ms
[2020-05-12 03:58:29] [INFO ] Deduced a trap composed of 145 places in 125 ms
[2020-05-12 03:58:29] [INFO ] Deduced a trap composed of 53 places in 125 ms
[2020-05-12 03:58:29] [INFO ] Deduced a trap composed of 83 places in 132 ms
[2020-05-12 03:58:29] [INFO ] Deduced a trap composed of 60 places in 154 ms
[2020-05-12 03:58:29] [INFO ] Deduced a trap composed of 68 places in 146 ms
[2020-05-12 03:58:30] [INFO ] Deduced a trap composed of 123 places in 141 ms
[2020-05-12 03:58:30] [INFO ] Deduced a trap composed of 43 places in 129 ms
[2020-05-12 03:58:30] [INFO ] Deduced a trap composed of 93 places in 157 ms
[2020-05-12 03:58:30] [INFO ] Deduced a trap composed of 130 places in 151 ms
[2020-05-12 03:58:30] [INFO ] Deduced a trap composed of 69 places in 169 ms
[2020-05-12 03:58:30] [INFO ] Deduced a trap composed of 137 places in 142 ms
[2020-05-12 03:58:31] [INFO ] Deduced a trap composed of 128 places in 132 ms
[2020-05-12 03:58:31] [INFO ] Deduced a trap composed of 138 places in 147 ms
[2020-05-12 03:58:31] [INFO ] Deduced a trap composed of 79 places in 130 ms
[2020-05-12 03:58:31] [INFO ] Deduced a trap composed of 137 places in 134 ms
[2020-05-12 03:58:31] [INFO ] Deduced a trap composed of 65 places in 143 ms
[2020-05-12 03:58:31] [INFO ] Deduced a trap composed of 159 places in 132 ms
[2020-05-12 03:58:32] [INFO ] Deduced a trap composed of 42 places in 136 ms
[2020-05-12 03:58:32] [INFO ] Deduced a trap composed of 46 places in 139 ms
[2020-05-12 03:58:32] [INFO ] Deduced a trap composed of 130 places in 134 ms
[2020-05-12 03:58:32] [INFO ] Deduced a trap composed of 140 places in 138 ms
[2020-05-12 03:58:32] [INFO ] Deduced a trap composed of 68 places in 136 ms
[2020-05-12 03:58:32] [INFO ] Deduced a trap composed of 127 places in 139 ms
[2020-05-12 03:58:32] [INFO ] Deduced a trap composed of 140 places in 147 ms
[2020-05-12 03:58:33] [INFO ] Deduced a trap composed of 142 places in 129 ms
[2020-05-12 03:58:33] [INFO ] Deduced a trap composed of 125 places in 152 ms
[2020-05-12 03:58:33] [INFO ] Deduced a trap composed of 138 places in 128 ms
[2020-05-12 03:58:33] [INFO ] Deduced a trap composed of 138 places in 127 ms
[2020-05-12 03:58:33] [INFO ] Deduced a trap composed of 122 places in 140 ms
[2020-05-12 03:58:33] [INFO ] Deduced a trap composed of 131 places in 127 ms
[2020-05-12 03:58:34] [INFO ] Deduced a trap composed of 145 places in 125 ms
[2020-05-12 03:58:34] [INFO ] Deduced a trap composed of 131 places in 124 ms
[2020-05-12 03:58:34] [INFO ] Deduced a trap composed of 44 places in 125 ms
[2020-05-12 03:58:34] [INFO ] Deduced a trap composed of 127 places in 118 ms
[2020-05-12 03:58:34] [INFO ] Deduced a trap composed of 152 places in 114 ms
[2020-05-12 03:58:34] [INFO ] Deduced a trap composed of 67 places in 114 ms
[2020-05-12 03:58:34] [INFO ] Deduced a trap composed of 147 places in 129 ms
[2020-05-12 03:58:35] [INFO ] Deduced a trap composed of 133 places in 115 ms
[2020-05-12 03:58:35] [INFO ] Deduced a trap composed of 37 places in 110 ms
[2020-05-12 03:58:35] [INFO ] Deduced a trap composed of 133 places in 115 ms
[2020-05-12 03:58:35] [INFO ] Deduced a trap composed of 134 places in 115 ms
[2020-05-12 03:58:35] [INFO ] Deduced a trap composed of 123 places in 134 ms
[2020-05-12 03:58:35] [INFO ] Deduced a trap composed of 22 places in 114 ms
[2020-05-12 03:58:35] [INFO ] Deduced a trap composed of 125 places in 127 ms
[2020-05-12 03:58:36] [INFO ] Deduced a trap composed of 69 places in 232 ms
[2020-05-12 03:58:36] [INFO ] Deduced a trap composed of 134 places in 119 ms
[2020-05-12 03:58:36] [INFO ] Deduced a trap composed of 68 places in 107 ms
[2020-05-12 03:58:36] [INFO ] Deduced a trap composed of 46 places in 140 ms
[2020-05-12 03:58:36] [INFO ] Deduced a trap composed of 143 places in 247 ms
[2020-05-12 03:58:37] [INFO ] Deduced a trap composed of 127 places in 132 ms
[2020-05-12 03:58:37] [INFO ] Deduced a trap composed of 127 places in 144 ms
[2020-05-12 03:58:37] [INFO ] Deduced a trap composed of 126 places in 134 ms
[2020-05-12 03:58:37] [INFO ] Deduced a trap composed of 139 places in 144 ms
[2020-05-12 03:58:37] [INFO ] Deduced a trap composed of 127 places in 137 ms
[2020-05-12 03:58:38] [INFO ] Deduced a trap composed of 138 places in 258 ms
[2020-05-12 03:58:38] [INFO ] Deduced a trap composed of 119 places in 132 ms
[2020-05-12 03:58:38] [INFO ] Deduced a trap composed of 117 places in 169 ms
[2020-05-12 03:58:38] [INFO ] Deduced a trap composed of 44 places in 126 ms
[2020-05-12 03:58:38] [INFO ] Deduced a trap composed of 123 places in 133 ms
[2020-05-12 03:58:38] [INFO ] Deduced a trap composed of 131 places in 142 ms
[2020-05-12 03:58:39] [INFO ] Deduced a trap composed of 141 places in 135 ms
[2020-05-12 03:58:39] [INFO ] Deduced a trap composed of 58 places in 133 ms
[2020-05-12 03:58:39] [INFO ] Deduced a trap composed of 118 places in 122 ms
[2020-05-12 03:58:39] [INFO ] Deduced a trap composed of 139 places in 139 ms
[2020-05-12 03:58:39] [INFO ] Deduced a trap composed of 124 places in 136 ms
[2020-05-12 03:58:39] [INFO ] Deduced a trap composed of 121 places in 119 ms
[2020-05-12 03:58:39] [INFO ] Trap strengthening (SAT) tested/added 100/99 trap constraints in 16679 ms
[2020-05-12 03:58:39] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 22 ms.
[2020-05-12 03:58:42] [INFO ] Added : 285 causal constraints over 57 iterations in 2512 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-12 03:58:42] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2020-05-12 03:58:42] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-05-12 03:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:43] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2020-05-12 03:58:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:58:43] [INFO ] [Nat]Absence check using 62 positive place invariants in 48 ms returned sat
[2020-05-12 03:58:43] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2020-05-12 03:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:58:44] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2020-05-12 03:58:44] [INFO ] Deduced a trap composed of 16 places in 165 ms
[2020-05-12 03:58:44] [INFO ] Deduced a trap composed of 11 places in 70 ms
[2020-05-12 03:58:44] [INFO ] Deduced a trap composed of 14 places in 84 ms
[2020-05-12 03:58:44] [INFO ] Deduced a trap composed of 27 places in 72 ms
[2020-05-12 03:58:44] [INFO ] Deduced a trap composed of 17 places in 123 ms
[2020-05-12 03:58:44] [INFO ] Deduced a trap composed of 34 places in 88 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 23 places in 96 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 26 places in 67 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 36 places in 81 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 35 places in 70 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 38 places in 60 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 38 places in 73 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 44 places in 74 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 44 places in 91 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 50 places in 87 ms
[2020-05-12 03:58:45] [INFO ] Deduced a trap composed of 32 places in 82 ms
[2020-05-12 03:58:46] [INFO ] Deduced a trap composed of 34 places in 101 ms
[2020-05-12 03:58:46] [INFO ] Deduced a trap composed of 37 places in 76 ms
[2020-05-12 03:58:46] [INFO ] Deduced a trap composed of 55 places in 72 ms
[2020-05-12 03:58:46] [INFO ] Deduced a trap composed of 56 places in 86 ms
[2020-05-12 03:58:46] [INFO ] Deduced a trap composed of 51 places in 74 ms
[2020-05-12 03:58:46] [INFO ] Deduced a trap composed of 57 places in 165 ms
[2020-05-12 03:58:46] [INFO ] Deduced a trap composed of 54 places in 79 ms
[2020-05-12 03:58:46] [INFO ] Deduced a trap composed of 85 places in 66 ms
[2020-05-12 03:58:46] [INFO ] Deduced a trap composed of 58 places in 64 ms
[2020-05-12 03:58:46] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2755 ms
[2020-05-12 03:58:46] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 22 ms.
[2020-05-12 03:58:48] [INFO ] Added : 261 causal constraints over 53 iterations in 1984 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-12 03:58:49] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-12 03:58:49] [INFO ] Flatten gal took : 117 ms
[2020-05-12 03:58:49] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-12 03:58:49] [INFO ] Flatten gal took : 27 ms
FORMULA BusinessProcesses-PT-16-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:58:49] [INFO ] Applying decomposition
[2020-05-12 03:58:49] [INFO ] Flatten gal took : 40 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/graph1056798588184254494.txt, -o, /tmp/graph1056798588184254494.bin, -w, /tmp/graph1056798588184254494.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/graph1056798588184254494.bin, -l, -1, -v, -w, /tmp/graph1056798588184254494.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:58:50] [INFO ] Decomposing Gal with order
[2020-05-12 03:58:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:58:50] [INFO ] Removed a total of 285 redundant transitions.
[2020-05-12 03:58:50] [INFO ] Flatten gal took : 214 ms
[2020-05-12 03:58:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 27 ms.
[2020-05-12 03:58:50] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 17 ms
[2020-05-12 03:58:50] [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 11 CTL formulae.
built 62 ordering constraints for composite.
built 22 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 21 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 23 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 24 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 81 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 22 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 26 ordering constraints for composite.
built 21 ordering constraints for composite.
built 43 ordering constraints for composite.
built 38 ordering constraints for composite.
built 24 ordering constraints for composite.
built 19 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 21 ordering constraints for composite.
built 13 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.74273e+27,25.6032,788756,28484,69,1.34479e+06,943,1435,2.44082e+06,81,2842,0
Converting to forward existential form...Done !
original formula: EF(AG(((i17.i2.u165.p425==0)||(i15.i0.u37.p87==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i17.i2.u165.p425==0)||(i15.i0.u37.p87==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t33, t294, t416, t430, i0.i0.t410, i0.i0.t424, i0.i0.u15.t440, i0.i0.u22.t427, i0.i0.u29.t413, i0.i1.t429, i0.i1.u23.t425, i0.i2.t415, i0.i2.u30.t411, i0.i3.t115, i0.i3.u190.t119, i0.i4.t102, i0.i4.u197.t106, i1.t444, i1.t442, i1.u16.t438, i2.i0.t401, i2.i0.u34.t403, i2.i1.t222, i2.i1.u142.t223, i2.i2.t162, i2.i2.u172.t163, i3.t378, i3.i0.t376, i3.i0.t391, i3.i1.t381, i3.i1.t385, i3.i1.t387, i3.i1.u44.t383, i4.i0.u86.t309, i4.i1.t298, i4.i1.u88.t305, i4.i1.u90.t301, i5.i0.u92.t297, i5.i1.u94.t287, i5.i3.t158, i5.i3.u174.t159, i5.i4.t154, i5.i4.u175.t155, i6.i1.t186, i6.i1.u159.t187, i6.i2.t170, i6.i2.u168.t171, i6.i3.t166, i6.i3.u169.t167, i7.i1.t210, i7.i1.u147.t211, i7.i2.t206, i7.i2.u150.t207, i7.i3.t202, i7.i3.u152.t203, i7.i4.t190, i7.i4.u158.t191, i8.i1.t234, i8.i1.u135.t235, i8.i2.t230, i8.i2.u138.t231, i8.i3.t226, i8.i3.u140.t227, i8.i4.t218, i8.i4.u143.t219, i8.i5.t214, i8.i5.u146.t215, i9.i0.t419, i9.i0.t421, i9.i0.u24.t423, i9.i2.t250, i9.i2.u127.t251, i9.i3.t246, i9.i3.u130.t247, i9.i4.t242, i9.i4.u132.t243, i9.i5.t238, i9.i5.u133.t239, i10.i0.t281, i10.i0.u114.t282, i10.i1.t278, i10.i1.u116.t279, i10.i2.t274, i10.i2.u117.t275, i10.i3.t128, i10.i3.t132, i10.i3.u182.t134, i11.i0.t407, i11.i0.u31.t409, i11.i2.t262, i11.i2.u121.t263, i12.i0.t433, i12.i0.t435, i12.i0.u17.t437, i12.i1.t258, i12.i1.u124.t259, i12.i2.t254, i12.i2.u125.t255, i13.i0.u62.t347, i13.i0.u64.t343, i13.i1.u66.t339, i14.u56.t359, i14.u58.t355, i14.u60.t351, i15.i0.u37.t397, i15.i0.u48.t373, i15.i0.u50.t369, i15.i2.t198, i15.i2.u153.t199, i16.i0.u52.t365, i16.i1.t194, i16.i1.u156.t195, i17.t317, i17.t315, i17.i0.t182, i17.i0.u161.t183, i17.i1.t178, i17.i1.u164.t179, i17.i2.t174, i17.i2.t313, i17.i2.u68.t321, i17.i2.u68.t325, i17.i2.u68.t329, i17.i2.u68.t335, i17.i2.u165.t175, i18.t148, i18.t141, i18.t136, i18.t130, i18.t126, i18.t124, i18.t122, i18.t117, i18.t113, i18.t111, i18.t109, i18.t104, i18.t100, i18.t98, i18.t95, i18.t93, i18.t90, i18.t88, i18.t86, i18.t84, i18.t82, i18.t80, i18.t77, i18.t69, i18.t66, i18.t63, i18.t60, i18.t57, i18.t54, i18.t26, i18.t23, i18.t20, i18.t17, i18.t14, i18.u244.t12, i18.u244.t37, i18.u244.t41, i18.u244.t45, i18.u244.t51, i18.u244.t74, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/367/165/568
(forward)formula 0,1,263.215,3067576,1,0,4.88827e+06,943,4116,1.02532e+07,200,2842,3208891
FORMULA BusinessProcesses-PT-16-CTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(((i17.i1.u72.p214==1) + AG(((i5.i1.u95.p251==0)||(i4.i0.u236.p588==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((i17.i1.u72.p214==1))),TRUE) * !(((i5.i1.u95.p251==0)||(i4.i0.u236.p588==1))))] = FALSE
(forward)formula 1,0,274.099,3085260,1,0,4.88827e+06,1101,6207,1.14753e+07,258,3205,4605081
FORMULA BusinessProcesses-PT-16-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(((i5.i0.u92.p235!=0) + EX(((i17.i0.u161.p416==0)||(i15.i1.u39.p92==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((i5.i0.u92.p235!=0))) * !(EX(((i17.i0.u161.p416==0)||(i15.i1.u39.p92==1)))))] = FALSE
(forward)formula 2,0,317.867,3834960,1,0,4.88827e+06,1116,6379,1.38665e+07,262,3449,5168366
FORMULA BusinessProcesses-PT-16-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EF(((i9.i1.u108.p278==1)&&((i18.u244.p572==0)||(i17.i2.u79.p197==1)))) + EX(TRUE))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((i9.i1.u108.p278==1)&&((i18.u244.p572==0)||(i17.i2.u79.p197==1))))] != FALSE + [(EY(Init) * TRUE)] != FALSE)
(forward)formula 3,1,317.939,3837600,1,0,4.88827e+06,1116,6392,1.38703e+07,264,3455,5198934
FORMULA BusinessProcesses-PT-16-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(((i15.i0.u37.p85!=0)&&(i17.i1.u228.p617!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i15.i0.u37.p85!=0)&&(i17.i1.u228.p617!=1)))] != FALSE
(forward)formula 4,1,317.943,3837864,1,0,4.88827e+06,1116,6402,1.38709e+07,266,3455,5199711
FORMULA BusinessProcesses-PT-16-CTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EF(((i15.i1.u38.p88==0)||(i18.u243.p601==1))) * E(((i8.i0.u106.p275==0)||(i14.u217.p544==1)) U (i16.i0.u246.p609==1)))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((i15.i1.u38.p88==0)||(i18.u243.p601==1)))),((i8.i0.u106.p275==0)||(i14.u217.p544==1))) * (i16.i0.u246.p609==1))] != FALSE
(forward)formula 5,0,372.843,3867960,1,0,4.88827e+06,1143,6076,1.40035e+07,257,3533,1385417
FORMULA BusinessProcesses-PT-16-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(EF((i12.i0.u189.p485==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (i12.i0.u189.p485==1))))] = FALSE
(forward)formula 6,0,424.26,3867960,1,0,4.88827e+06,1143,6085,1.40035e+07,257,3533,2370527
FORMULA BusinessProcesses-PT-16-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG((AF(((i16.i0.u53.p125==0)||(i0.i0.u15.p28==1))) * ((i8.i2.u138.p357==0)||(i8.i2.u138.p356==1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(((i16.i0.u53.p125==0)||(i0.i0.u15.p28==1))))] = FALSE * [(FwdU(Init,TRUE) * !(((i8.i2.u138.p357==0)||(i8.i2.u138.p356==1))))] = FALSE)
(forward)formula 7,0,424.554,3867960,1,0,4.88827e+06,1143,6100,1.40035e+07,262,3533,2392072
FORMULA BusinessProcesses-PT-16-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(AG(((i18.u244.p568==0)||(i0.i4.u197.p506==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i18.u244.p568==0)||(i0.i4.u197.p506==1))))] != FALSE
(forward)formula 8,1,424.617,3867960,1,0,4.88827e+06,1143,6109,1.40035e+07,264,3533,2427712
FORMULA BusinessProcesses-PT-16-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF((i7.i0.u102.p267==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i7.i0.u102.p267==1))] != FALSE
(forward)formula 9,1,424.618,3867960,1,0,4.88827e+06,1143,6112,1.40035e+07,264,3533,2428032
FORMULA BusinessProcesses-PT-16-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX((((i0.i3.u190.p488!=0)&&(i11.i1.u120.p313!=1))||(i0.i0.u15.p28==1)))
=> equivalent forward existential formula: [(EY(Init) * !((((i0.i3.u190.p488!=0)&&(i11.i1.u120.p313!=1))||(i0.i0.u15.p28==1))))] = FALSE
(forward)formula 10,0,424.82,3867960,1,0,4.88827e+06,1143,6276,1.40035e+07,272,3533,2466598
FORMULA BusinessProcesses-PT-16-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
BK_STOP 1589256356603
--------------------
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="BusinessProcesses-PT-16"
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 BusinessProcesses-PT-16, 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 r021-oct2-158897699200571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 '
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 ;