About the Execution of 2021-gold for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 275.212 | 48691.00 | 60732.00 | 2028.00 | FTFTFTTTFFFTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100168.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is BusinessProcesses-PT-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100168
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.9K Apr 29 23:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 23:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 23:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 23:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 23:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 29 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 29 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 159K May 10 09:33 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-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655083370081
Running Version 0
[2022-06-13 01:22:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:22:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:22:53] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-06-13 01:22:53] [INFO ] Transformed 638 places.
[2022-06-13 01:22:53] [INFO ] Transformed 578 transitions.
[2022-06-13 01:22:53] [INFO ] Found NUPN structural information;
[2022-06-13 01:22:53] [INFO ] Parsed PT model containing 638 places and 578 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 570 rows 630 cols
[2022-06-13 01:22:53] [INFO ] Computed 100 place invariants in 46 ms
[2022-06-13 01:22:53] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2022-06-13 01:22:53] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned unsat
[2022-06-13 01:22:54] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2022-06-13 01:22:54] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2022-06-13 01:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:54] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2022-06-13 01:22:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:54] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2022-06-13 01:22:54] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2022-06-13 01:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:54] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-06-13 01:22:55] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 4 ms to minimize.
[2022-06-13 01:22:55] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2022-06-13 01:22:55] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:22:55] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 2 ms to minimize.
[2022-06-13 01:22:55] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:22:55] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:22:56] [INFO ] Deduced a trap composed of 160 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:22:56] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:22:56] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2022-06-13 01:22:56] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:22:56] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:22:56] [INFO ] Deduced a trap composed of 147 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:22:57] [INFO ] Deduced a trap composed of 147 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:22:57] [INFO ] Deduced a trap composed of 141 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:22:57] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:22:57] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:22:57] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 0 ms to minimize.
[2022-06-13 01:22:57] [INFO ] Deduced a trap composed of 167 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 163 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 162 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 156 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:22:58] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 0 ms to minimize.
[2022-06-13 01:22:59] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:22:59] [INFO ] Deduced a trap composed of 151 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:22:59] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:22:59] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2022-06-13 01:22:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-13 01:22:59] [INFO ] [Real]Absence check using 62 positive place invariants in 14 ms returned unsat
[2022-06-13 01:22:59] [INFO ] [Real]Absence check using 62 positive place invariants in 29 ms returned sat
[2022-06-13 01:22:59] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 19 ms returned sat
[2022-06-13 01:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:00] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-06-13 01:23:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:00] [INFO ] [Nat]Absence check using 62 positive place invariants in 30 ms returned sat
[2022-06-13 01:23:00] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 17 ms returned sat
[2022-06-13 01:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:00] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-06-13 01:23:00] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 146 places in 135 ms of which 0 ms to minimize.
[2022-06-13 01:23:01] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 155 places in 144 ms of which 0 ms to minimize.
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 1 ms to minimize.
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:23:02] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 146 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 153 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 141 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 153 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 141 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 154 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 171 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 147 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:23:05] [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 close... while checking expression at index 3
[2022-06-13 01:23:05] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2022-06-13 01:23:05] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 43 ms returned sat
[2022-06-13 01:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:07] [INFO ] [Real]Absence check using state equation in 2077 ms returned sat
[2022-06-13 01:23:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:07] [INFO ] [Nat]Absence check using 62 positive place invariants in 36 ms returned sat
[2022-06-13 01:23:07] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 34 ms returned sat
[2022-06-13 01:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:08] [INFO ] [Nat]Absence check using state equation in 1116 ms returned sat
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 747 ms
[2022-06-13 01:23:09] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 33 ms.
[2022-06-13 01:23:11] [INFO ] Added : 196 causal constraints over 40 iterations in 1832 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-13 01:23:11] [INFO ] [Real]Absence check using 62 positive place invariants in 29 ms returned sat
[2022-06-13 01:23:11] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2022-06-13 01:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:11] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-06-13 01:23:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:12] [INFO ] [Nat]Absence check using 62 positive place invariants in 26 ms returned sat
[2022-06-13 01:23:12] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2022-06-13 01:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:12] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2412 ms
[2022-06-13 01:23:14] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 33 ms.
[2022-06-13 01:23:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-13 01:23:17] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2022-06-13 01:23:17] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2022-06-13 01:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:17] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2022-06-13 01:23:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:17] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2022-06-13 01:23:17] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2022-06-13 01:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:17] [INFO ] [Nat]Absence check using state equation in 157 ms returned unsat
[2022-06-13 01:23:17] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2022-06-13 01:23:18] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2022-06-13 01:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:18] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-06-13 01:23:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:18] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2022-06-13 01:23:18] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2022-06-13 01:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:18] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 154 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 139 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2479 ms
[2022-06-13 01:23:21] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 29 ms.
[2022-06-13 01:23:23] [INFO ] Added : 282 causal constraints over 57 iterations in 2193 ms. Result :unknown
[2022-06-13 01:23:23] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2022-06-13 01:23:23] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 18 ms returned sat
[2022-06-13 01:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:23] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1278 ms
[2022-06-13 01:23:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:25] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2022-06-13 01:23:25] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 17 ms returned sat
[2022-06-13 01:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:25] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:23:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1261 ms
[2022-06-13 01:23:27] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 31 ms.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2022-06-13 01:23:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2022-06-13 01:23:29] [INFO ] Added : 284 causal constraints over 57 iterations in 2651 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 25400 steps, including 208 resets, run finished after 85 ms. (steps per millisecond=298 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 28300 steps, including 121 resets, run finished after 68 ms. (steps per millisecond=416 ) properties (out of 5) seen :4 could not realise parikh vector
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 21800 steps, including 141 resets, run finished after 62 ms. (steps per millisecond=351 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 49 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 624 transition count 483
Reduce places removed 86 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 91 rules applied. Total rules applied 178 place count 538 transition count 478
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 183 place count 533 transition count 478
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 183 place count 533 transition count 357
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 439 place count 398 transition count 357
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 516 place count 321 transition count 280
Iterating global reduction 3 with 77 rules applied. Total rules applied 593 place count 321 transition count 280
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 593 place count 321 transition count 276
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 603 place count 315 transition count 276
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 779 place count 226 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 780 place count 226 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 782 place count 225 transition count 192
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 786 place count 225 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 787 place count 224 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 788 place count 223 transition count 191
Applied a total of 788 rules in 161 ms. Remains 223 /630 variables (removed 407) and now considering 191/570 (removed 379) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/630 places, 191/570 transitions.
[2022-06-13 01:23:30] [INFO ] Flatten gal took : 91 ms
[2022-06-13 01:23:30] [INFO ] Flatten gal took : 31 ms
[2022-06-13 01:23:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15278451490435316088.gal : 17 ms
[2022-06-13 01:23:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9616106208198870849.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15278451490435316088.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9616106208198870849.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15278451490435316088.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9616106208198870849.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9616106208198870849.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 60
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 360
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :360 after 1530
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1530 after 3330
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3330 after 30090
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :30090 after 38206
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :38206 after 891360
Reachability property BusinessProcesses-PT-16-ReachabilityFireability-06 is true.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.14307e+06,3.33159,22328,2,12046,15,62828,6,0,1078,41249,0
Total reachable state count : 1143072
Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-16-ReachabilityFireability-06 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-16-ReachabilityFireability-06,288,5.47218,22532,2,364,15,62828,7,0,1211,41249,0
All properties solved without resorting to model-checking.
BK_STOP 1655083418772
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BusinessProcesses-PT-16, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-tall-165251936100168"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;