fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r035-tajo-162038167700094
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BusinessProcesses-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16253.888 3591659.00 3409784.00 177354.30 ??????????????FT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r035-tajo-162038167700094.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is BusinessProcesses-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 100K May 5 16:51 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-07-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620904319288

[2021-05-13 11:12:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 11:12:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:12:00] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-13 11:12:00] [INFO ] Transformed 386 places.
[2021-05-13 11:12:00] [INFO ] Transformed 360 transitions.
[2021-05-13 11:12:00] [INFO ] Found NUPN structural information;
[2021-05-13 11:12:00] [INFO ] Parsed PT model containing 386 places and 360 transitions in 104 ms.
[2021-05-13 11:12:00] [INFO ] Reduced 1 identical enabling conditions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 40 ms.
Incomplete random walk after 100000 steps, including 1099 resets, run finished after 325 ms. (steps per millisecond=307 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 360 rows 386 cols
[2021-05-13 11:12:01] [INFO ] Computed 62 place invariants in 26 ms
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-13 11:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 8 places in 174 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 10 places in 102 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 16 places in 97 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 11 places in 101 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 11 places in 100 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 14 places in 87 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 32 places in 37 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 12 places in 28 ms
[2021-05-13 11:12:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 872 ms
[2021-05-13 11:12:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 47 ms returned sat
[2021-05-13 11:12:02] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 21 ms returned sat
[2021-05-13 11:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:03] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 8 places in 127 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 10 places in 159 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 16 places in 126 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 87 places in 151 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 11 places in 139 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 11 places in 167 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 28 places in 137 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 107 places in 157 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 14 places in 138 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 11 places in 39 ms
[2021-05-13 11:12:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1539 ms
[2021-05-13 11:12:04] [INFO ] Computed and/alt/rep : 359/1286/359 causal constraints in 25 ms.
[2021-05-13 11:12:06] [INFO ] Added : 246 causal constraints over 50 iterations in 1846 ms. Result :sat
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2021-05-13 11:12:06] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-13 11:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using state equation in 393 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-13 11:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using state equation in 257 ms returned unsat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2021-05-13 11:12:07] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-13 11:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using state equation in 419 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned sat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 14 ms returned sat
[2021-05-13 11:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using state equation in 293 ms returned unsat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2021-05-13 11:12:08] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2021-05-13 11:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:09] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 12 places in 139 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 16 places in 122 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 12 places in 109 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 15 places in 119 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 11 places in 120 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 19 places in 186 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 100 places in 275 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 98 places in 211 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 100 places in 278 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 106 places in 114 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 106 places in 170 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 100 places in 422 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 106 places in 247 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 98 places in 120 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 97 places in 118 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 104 places in 106 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 112 places in 109 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 101 places in 144 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 105 places in 105 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 104 places in 106 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 98 places in 113 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 21 places in 110 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 114 places in 126 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 101 places in 123 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 100 places in 113 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 103 places in 117 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 104 places in 127 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 105 places in 124 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 97 places in 116 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 103 places in 106 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 102 places in 180 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 107 places in 136 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 102 places in 160 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 106 places in 164 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 107 places in 155 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 107 places in 139 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 108 places in 129 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 104 places in 112 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 104 places in 108 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 105 places in 109 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 110 places in 103 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 107 places in 109 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 98 places in 100 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 97 places in 129 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 104 places in 98 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 96 places in 103 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 113 places in 96 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 100 places in 95 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 111 places in 92 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 107 places in 92 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 101 places in 135 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 109 places in 97 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 106 places in 91 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 102 places in 126 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 117 places in 95 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 115 places in 87 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 101 places in 144 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 97 places in 122 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 100 places in 108 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 98 places in 148 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 102 places in 124 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 103 places in 107 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 110 places in 111 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 104 places in 111 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 100 places in 113 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 101 places in 107 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 112 places in 98 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 109 places in 106 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 113 places in 127 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 110 places in 93 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 106 places in 85 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 99 places in 136 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 111 places in 143 ms
[2021-05-13 11:12:20] [INFO ] Deduced a trap composed of 110 places in 106 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 110 places in 104 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 114 places in 107 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 109 places in 161 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 111 places in 121 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 103 places in 150 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 105 places in 125 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 114 places in 135 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 105 places in 116 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 107 places in 147 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 105 places in 156 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 110 places in 137 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 110 places in 120 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 115 places in 139 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 113 places in 129 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 116 places in 132 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 105 places in 152 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 110 places in 112 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 115 places in 107 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 106 places in 109 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 109 places in 106 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 106 places in 144 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 107 places in 143 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 112 places in 135 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 102 places in 168 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 101 places in 122 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 104 places in 156 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 100 places in 116 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 104 places in 107 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 95 places in 131 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 106 places in 116 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 111 places in 130 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 104 places in 124 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 108 places in 164 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 107 places in 121 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 102 places in 114 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 109 places in 103 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 110 places in 136 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 113 places in 133 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 96 places in 123 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 100 places in 91 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 99 places in 98 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 106 places in 131 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 101 places in 112 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 100 places in 103 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 107 places in 117 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 111 places in 90 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 111 places in 110 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 102 places in 114 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 110 places in 106 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 15 places in 190 ms
[2021-05-13 11:12:28] [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 s163 s164 s165 s166 s167 s168 s169 s170 s224 s225 s226 s227 s228) 0)") while checking expression at index 5
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 89 ms returned sat
[2021-05-13 11:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using state equation in 269 ms returned unsat
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-13 11:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using state equation in 425 ms returned unsat
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-13 11:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:30] [INFO ] [Real]Absence check using state equation in 350 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2021-05-13 11:12:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 11:12:30] [INFO ] Flatten gal took : 112 ms
[2021-05-13 11:12:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 11:12:30] [INFO ] Flatten gal took : 33 ms
FORMULA BusinessProcesses-PT-07-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:12:30] [INFO ] Applying decomposition
[2021-05-13 11:12:30] [INFO ] Flatten gal took : 29 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/graph8515541648705972285.txt, -o, /tmp/graph8515541648705972285.bin, -w, /tmp/graph8515541648705972285.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/graph8515541648705972285.bin, -l, -1, -v, -w, /tmp/graph8515541648705972285.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:12:31] [INFO ] Decomposing Gal with order
[2021-05-13 11:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:12:31] [INFO ] Removed a total of 232 redundant transitions.
[2021-05-13 11:12:31] [INFO ] Flatten gal took : 96 ms
[2021-05-13 11:12:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-13 11:12:31] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2021-05-13 11:12:31] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
built 49 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 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 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 47 ordering constraints for composite.
built 16 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 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 25 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 32 ordering constraints for composite.
built 10 ordering constraints for composite.
built 30 ordering constraints for composite.
built 29 ordering constraints for composite.
built 7 ordering constraints for composite.
built 42 ordering constraints for composite.
built 8 ordering constraints for composite.
built 17 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,8.14359e+17,53.9191,853964,9055,69,1.18661e+06,775,1038,2.93184e+06,77,2289,0


Converting to forward existential form...Done !
original formula: EG(A((((EF(((i12.u2.p6==1)||(i16.u139.p346==1))) * EF((((((((((i5.i1.u44.p116==1)&&(i5.i1.u100.p252==1))&&(i5.i1.u124.p383==1))||(i9.i1.u71.p183==1))||(i9.i4.u79.p199==1))||(i15.u126.p317==1))||(i12.u53.p138==1))||(((i5.i0.u29.p71==1)&&(i7.i2.u102.p256==1))&&(i16.u142.p351==1)))||(((i5.i1.u44.p116==1)&&(i5.i1.u100.p252==1))&&(i5.i1.u127.p322==1))))) * EG(((((i12.u51.p133==1)||(i7.i3.u103.p259==1))||(((i3.u16.p39==1)&&(i8.i4.u88.p221==1))&&(i16.u142.p351==1)))||(i16.u118.p299==1)))) + (((((((((i14.i1.u123.p311!=1)&&(i4.i0.u23.p57!=1))&&(i7.i2.u101.p254!=1))&&(i9.i0.u69.p175!=1))&&(i1.i0.u6.p14!=1))&&((((((i4.i1.u25.p67==1)||(i11.u50.p129==1))||(i15.u126.p317==1))||(((i6.u59.p155==1)&&(i9.i2.u73.p186==1))&&(i16.u142.p351==1)))||(((i15.u34.p85==1)&&(i15.u98.p247==1))&&(i5.i1.u124.p380==1)))||((i4.i1.u25.p66==1)&&(i16.u108.p275==1))))&&(((i5.i1.u44.p116!=1)||(i5.i1.u100.p252!=1))||(i5.i1.u124.p383!=1)))&&(((i1.i0.u11.p26!=1)||(i1.i2.u76.p192!=1))||(i1.i0.u114.p289!=1)))&&((i14.i1.u36.p89!=1)||(i14.i1.u128.p323!=1)))) U EF((((((((i1.i0.u8.p19==1)||(i7.i0.u57.p151==1))||(i4.i0.u28.p55==1))||(((i15.u34.p85==1)&&(i15.u98.p247==1))&&(i14.i2.u145.p362==1)))||(((i12.u52.p134==1)&&(i9.i4.u80.p202==1))&&(i12.u134.p335==1)))||(((i3.u17.p43==1)&&(i8.i2.u83.p212==1))&&(i3.u117.p352==1)))||((i14.i1.u36.p89==1)&&(i14.i1.u128.p323==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U (((((((i1.i0.u8.p19==1)||(i7.i0.u57.p151==1))||(i4.i0.u28.p55==1))||(((i15.u34.p85==1)&&(i15.u98.p247==1))&&(i14.i2.u145.p362==1)))||(((i12.u52.p134==1)&&(i9.i4.u80.p202==1))&&(i12.u134.p335==1)))||(((i3.u17.p43==1)&&(i8.i2.u83.p212==1))&&(i3.u117.p352==1)))||((i14.i1.u36.p89==1)&&(i14.i1.u128.p323==1))))) U (!((((E(TRUE U ((i12.u2.p6==1)||(i16.u139.p346==1))) * E(TRUE U (((((((((i5.i1.u44.p116==1)&&(i5.i1.u100.p252==1))&&(i5.i1.u124.p383==1))||(i9.i1.u71.p183==1))||(i9.i4.u79.p199==1))||(i15.u126.p317==1))||(i12.u53.p138==1))||(((i5.i0.u29.p71==1)&&(i7.i2.u102.p256==1))&&(i16.u142.p351==1)))||(((i5.i1.u44.p116==1)&&(i5.i1.u100.p252==1))&&(i5.i1.u127.p322==1))))) * EG(((((i12.u51.p133==1)||(i7.i3.u103.p259==1))||(((i3.u16.p39==1)&&(i8.i4.u88.p221==1))&&(i16.u142.p351==1)))||(i16.u118.p299==1)))) + (((((((((i14.i1.u123.p311!=1)&&(i4.i0.u23.p57!=1))&&(i7.i2.u101.p254!=1))&&(i9.i0.u69.p175!=1))&&(i1.i0.u6.p14!=1))&&((((((i4.i1.u25.p67==1)||(i11.u50.p129==1))||(i15.u126.p317==1))||(((i6.u59.p155==1)&&(i9.i2.u73.p186==1))&&(i16.u142.p351==1)))||(((i15.u34.p85==1)&&(i15.u98.p247==1))&&(i5.i1.u124.p380==1)))||((i4.i1.u25.p66==1)&&(i16.u108.p275==1))))&&(((i5.i1.u44.p116!=1)||(i5.i1.u100.p252!=1))||(i5.i1.u124.p383!=1)))&&(((i1.i0.u11.p26!=1)||(i1.i2.u76.p192!=1))||(i1.i0.u114.p289!=1)))&&((i14.i1.u36.p89!=1)||(i14.i1.u128.p323!=1))))) * !(E(TRUE U (((((((i1.i0.u8.p19==1)||(i7.i0.u57.p151==1))||(i4.i0.u28.p55==1))||(((i15.u34.p85==1)&&(i15.u98.p247==1))&&(i14.i2.u145.p362==1)))||(((i12.u52.p134==1)&&(i9.i4.u80.p202==1))&&(i12.u134.p335==1)))||(((i3.u17.p43==1)&&(i8.i2.u83.p212==1))&&(i3.u117.p352==1)))||((i14.i1.u36.p89==1)&&(i14.i1.u128.p323==1))))))) + EG(!(E(TRUE U (((((((i1.i0.u8.p19==1)||(i7.i0.u57.p151==1))||(i4.i0.u28.p55==1))||(((i15.u34.p85==1)&&(i15.u98.p247==1))&&(i14.i2.u145.p362==1)))||(((i12.u52.p134==1)&&(i9.i4.u80.p202==1))&&(i12.u134.p335==1)))||(((i3.u17.p43==1)&&(i8.i2.u83.p212==1))&&(i3.u117.p352==1)))||((i14.i1.u36.p89==1)&&(i14.i1.u128.p323==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t39, t196, t201, t203, t242, t248, i0.t238, i0.u20.t241, i1.i0.t254, i1.i0.u8.t260, i1.i0.u10.t257, i1.i1.t262, i1.i1.u9.t258, i1.i2.t158, i1.i2.u76.t159, i2.i0.t253, i3.u16.t247, i4.t226, i4.i0.t224, i4.i0.t237, i4.i1.t229, i4.i1.t231, i4.i1.u25.t233, i5.t199, i5.i0.u29.t207, i5.i0.u29.t211, i5.i0.u29.t215, i5.i0.u29.t221, i5.i1.t110, i5.i1.u100.t111, i6.u59.t171, i7.i0.t172, i7.i0.u55.t179, i7.i0.u57.t175, i7.i2.t106, i7.i2.u102.t107, i7.i3.t102, i7.i3.u104.t103, i8.i1.t146, i8.i1.u82.t147, i8.i2.t142, i8.i2.u83.t143, i8.i3.t138, i8.i3.u86.t139, i8.i4.t134, i8.i4.u88.t135, i9.i1.t165, i9.i1.u72.t166, i9.i2.t162, i9.i2.u73.t163, i9.i3.t154, i9.i3.u78.t155, i9.i4.t150, i9.i4.u80.t151, i10.t78, i10.u110.t82, i11.u47.t195, i11.u49.t191, i12.u51.t187, i12.u53.t183, i13.i1.t130, i13.i1.u89.t131, i13.i2.t122, i13.i2.u93.t123, i13.i3.t118, i13.i3.u96.t119, i14.i1.t126, i14.i1.u91.t127, i15.t114, i15.u98.t115, i16.t96, i16.t89, i16.t84, i16.t80, i16.t76, i16.t73, i16.t71, i16.t64, i16.t61, i16.t59, i16.t32, i16.t29, i16.t26, i16.t23, i16.t20, i16.t17, i16.t14, i16.u142.t12, i16.u142.t43, i16.u142.t47, i16.u142.t51, i16.u142.t57, i16.u142.t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/229/95/360
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
ITS-tools command line returned an error code 139
[2021-05-13 11:30:56] [INFO ] Applying decomposition
[2021-05-13 11:30:56] [INFO ] Flatten gal took : 40 ms
[2021-05-13 11:30:56] [INFO ] Decomposing Gal with order
[2021-05-13 11:30:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:30:56] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-13 11:30:56] [INFO ] Flatten gal took : 59 ms
[2021-05-13 11:30:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-13 11:30:56] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 11 ms
[2021-05-13 11:30:56] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
built 2 ordering constraints for composite.
built 87 ordering constraints for composite.
built 53 ordering constraints for composite.
built 52 ordering constraints for composite.
built 51 ordering constraints for composite.
built 49 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 19 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 26 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 57 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2021-05-13 11:51:07] [INFO ] Flatten gal took : 356 ms
[2021-05-13 11:51:08] [INFO ] Input system was already deterministic with 360 transitions.
[2021-05-13 11:51:08] [INFO ] Transformed 386 places.
[2021-05-13 11:51:08] [INFO ] Transformed 360 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 11:51:38] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 7 ms
[2021-05-13 11:51:38] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 12 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Detected timeout of ITS tools.

BK_STOP 1620907910947

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-07"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is BusinessProcesses-PT-07, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-tajo-162038167700094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;