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.r026-tajo-162038143900431.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 itstools
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 5 16:58 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.4K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 156K 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-14-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620546691663

Running Version 0
[2021-05-09 07:51:34] [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]
[2021-05-09 07:51:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:51:34] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2021-05-09 07:51:34] [INFO ] Transformed 624 places.
[2021-05-09 07:51:34] [INFO ] Transformed 564 transitions.
[2021-05-09 07:51:34] [INFO ] Found NUPN structural information;
[2021-05-09 07:51:34] [INFO ] Parsed PT model containing 624 places and 564 transitions in 220 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 21 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 16) seen :4
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 556 rows 616 cols
[2021-05-09 07:51:35] [INFO ] Computed 99 place invariants in 43 ms
[2021-05-09 07:51:36] [INFO ] [Real]Absence check using 60 positive place invariants in 265 ms returned sat
[2021-05-09 07:51:36] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-09 07:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:36] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2021-05-09 07:51:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:51:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 96 ms returned sat
[2021-05-09 07:51:37] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 14 ms returned sat
[2021-05-09 07:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:37] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2021-05-09 07:51:37] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 4 ms to minimize.
[2021-05-09 07:51:38] [INFO ] Deduced a trap composed of 134 places in 324 ms of which 2 ms to minimize.
[2021-05-09 07:51:38] [INFO ] Deduced a trap composed of 16 places in 356 ms of which 2 ms to minimize.
[2021-05-09 07:51:39] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 1 ms to minimize.
[2021-05-09 07:51:39] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 2 ms to minimize.
[2021-05-09 07:51:39] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 1 ms to minimize.
[2021-05-09 07:51:39] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 0 ms to minimize.
[2021-05-09 07:51:39] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:51:40] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:51:40] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:51:40] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:51:40] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:51:40] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:51:40] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:51:41] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:51:41] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:51:41] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:51:41] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:51:41] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:51:42] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:51:42] [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 0
[2021-05-09 07:51:42] [INFO ] [Real]Absence check using 60 positive place invariants in 27 ms returned sat
[2021-05-09 07:51:42] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:42] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2021-05-09 07:51:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:51:42] [INFO ] [Nat]Absence check using 60 positive place invariants in 44 ms returned sat
[2021-05-09 07:51:42] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 23 ms returned sat
[2021-05-09 07:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:43] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2021-05-09 07:51:43] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:51:44] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 0 ms to minimize.
[2021-05-09 07:51:44] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 1 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 33 places in 747 ms of which 26 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:51:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2228 ms
[2021-05-09 07:51:46] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 60 ms.
[2021-05-09 07:51:47] [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
[2021-05-09 07:51:47] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-09 07:51:47] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 07:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:48] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2021-05-09 07:51:48] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:51:48] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 6 ms to minimize.
[2021-05-09 07:51:49] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2021-05-09 07:51:49] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:51:49] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:51:49] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 0 ms to minimize.
[2021-05-09 07:51:59] [INFO ] Deduced a trap composed of 123 places in 9822 ms of which 27 ms to minimize.
[2021-05-09 07:51:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-09 07:51:59] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2021-05-09 07:51:59] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 15 ms returned sat
[2021-05-09 07:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:00] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2021-05-09 07:52:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:52:00] [INFO ] [Nat]Absence check using 60 positive place invariants in 30 ms returned sat
[2021-05-09 07:52:00] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 13 ms returned unsat
[2021-05-09 07:52:00] [INFO ] [Real]Absence check using 60 positive place invariants in 52 ms returned sat
[2021-05-09 07:52:00] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 31 ms returned sat
[2021-05-09 07:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:00] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-09 07:52:01] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 1 ms to minimize.
[2021-05-09 07:52:01] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 1 ms to minimize.
[2021-05-09 07:52:01] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 0 ms to minimize.
[2021-05-09 07:52:01] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 0 ms to minimize.
[2021-05-09 07:52:02] [INFO ] Deduced a trap composed of 120 places in 174 ms of which 0 ms to minimize.
[2021-05-09 07:52:02] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 0 ms to minimize.
[2021-05-09 07:52:02] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2021-05-09 07:52:02] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:52:03] [INFO ] Deduced a trap composed of 32 places in 734 ms of which 0 ms to minimize.
[2021-05-09 07:52:03] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 13 ms to minimize.
[2021-05-09 07:52:03] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 14 ms to minimize.
[2021-05-09 07:52:04] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 1 ms to minimize.
[2021-05-09 07:52:04] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:52:04] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 0 ms to minimize.
[2021-05-09 07:52:04] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 1 ms to minimize.
[2021-05-09 07:52:04] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 19 ms to minimize.
[2021-05-09 07:52:05] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2021-05-09 07:52:05] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 1 ms to minimize.
[2021-05-09 07:52:05] [INFO ] Deduced a trap composed of 124 places in 216 ms of which 1 ms to minimize.
[2021-05-09 07:52: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 4
[2021-05-09 07:52:05] [INFO ] [Real]Absence check using 60 positive place invariants in 19 ms returned sat
[2021-05-09 07:52:05] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 38 ms returned sat
[2021-05-09 07:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:05] [INFO ] [Real]Absence check using state equation in 200 ms returned unsat
[2021-05-09 07:52:06] [INFO ] [Real]Absence check using 60 positive place invariants in 29 ms returned sat
[2021-05-09 07:52:06] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 17 ms returned sat
[2021-05-09 07:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:06] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2021-05-09 07:52:06] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 1 ms to minimize.
[2021-05-09 07:52:07] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 1 ms to minimize.
[2021-05-09 07:52:07] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2021-05-09 07:52:07] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:52:07] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 1 ms to minimize.
[2021-05-09 07:52:08] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 0 ms to minimize.
[2021-05-09 07:52:08] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 1 ms to minimize.
[2021-05-09 07:52:08] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:52:08] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2021-05-09 07:52:10] [INFO ] Deduced a trap composed of 38 places in 2263 ms of which 29 ms to minimize.
[2021-05-09 07:52:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4261 ms
[2021-05-09 07:52:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:52:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 29 ms returned sat
[2021-05-09 07:52:11] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 20 ms returned sat
[2021-05-09 07:52:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:11] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2021-05-09 07:52:11] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:52:11] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:52:12] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 0 ms to minimize.
[2021-05-09 07:52:12] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 0 ms to minimize.
[2021-05-09 07:52:12] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 1 ms to minimize.
[2021-05-09 07:52:12] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 0 ms to minimize.
[2021-05-09 07:52:13] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:52:13] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:52:13] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:52:13] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:52:13] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:52:13] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:52:13] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:52:14] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:52:14] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 0 ms to minimize.
[2021-05-09 07:52:14] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 0 ms to minimize.
[2021-05-09 07:52:14] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:52:14] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:52:15] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:52:15] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:52:15] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 0 ms to minimize.
[2021-05-09 07:52:15] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:52:15] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:52:16] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:52: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 6
[2021-05-09 07:52:16] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-09 07:52:16] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 07:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:16] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2021-05-09 07:52:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:52:16] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2021-05-09 07:52:16] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:17] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2021-05-09 07:52:17] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 1 ms to minimize.
[2021-05-09 07:52:17] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2021-05-09 07:52:18] [INFO ] Deduced a trap composed of 20 places in 342 ms of which 1 ms to minimize.
[2021-05-09 07:52:18] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 2 ms to minimize.
[2021-05-09 07:52:18] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2021-05-09 07:52:18] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:52:19] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 0 ms to minimize.
[2021-05-09 07:52:19] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2021-05-09 07:52:19] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 0 ms to minimize.
[2021-05-09 07:52:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 2394 ms
[2021-05-09 07:52:19] [INFO ] [Real]Absence check using 60 positive place invariants in 25 ms returned sat
[2021-05-09 07:52:19] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:19] [INFO ] [Real]Absence check using state equation in 203 ms returned unsat
[2021-05-09 07:52:20] [INFO ] [Real]Absence check using 60 positive place invariants in 20 ms returned sat
[2021-05-09 07:52:20] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:20] [INFO ] [Real]Absence check using state equation in 184 ms returned unsat
[2021-05-09 07:52:20] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-09 07:52:20] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 07:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:20] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2021-05-09 07:52:20] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:52:20] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:52:21] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:52:21] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:52:21] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:52:21] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:52:21] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:52:21] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:52:21] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:52:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1011 ms
[2021-05-09 07:52:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:52:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 27 ms returned sat
[2021-05-09 07:52:21] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:52:22] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-09 07:52:22] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:52:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2021-05-09 07:52:22] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2021-05-09 07:52:22] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:52:22] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 1 ms to minimize.
[2021-05-09 07:52:23] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:52:23] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 1 ms to minimize.
[2021-05-09 07:52:23] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:52:23] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:52:23] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 0 ms to minimize.
[2021-05-09 07:52:23] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:52:24] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:52:24] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:52:24] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:52:24] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:52:24] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:52:24] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:52:24] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2721 ms
[2021-05-09 07:52:24] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 34 ms.
[2021-05-09 07:52:26] [INFO ] Added : 249 causal constraints over 50 iterations in 1891 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Support contains 35 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 610 transition count 466
Reduce places removed 89 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 95 rules applied. Total rules applied 185 place count 521 transition count 460
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 191 place count 515 transition count 460
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 191 place count 515 transition count 340
Deduced a syphon composed of 120 places in 3 ms
Ensure Unique test removed 16 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 447 place count 379 transition count 340
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 526 place count 300 transition count 261
Iterating global reduction 3 with 79 rules applied. Total rules applied 605 place count 300 transition count 261
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 605 place count 300 transition count 254
Deduced a syphon composed of 7 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 622 place count 290 transition count 254
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 790 place count 206 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 791 place count 206 transition count 169
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 793 place count 205 transition count 173
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 797 place count 205 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 798 place count 204 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 799 place count 203 transition count 172
Applied a total of 799 rules in 206 ms. Remains 203 /616 variables (removed 413) and now considering 172/556 (removed 384) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/616 places, 172/556 transitions.
[2021-05-09 07:52:27] [INFO ] Flatten gal took : 96 ms
[2021-05-09 07:52:27] [INFO ] Flatten gal took : 41 ms
[2021-05-09 07:52:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1183797916499858585.gal : 41 ms
[2021-05-09 07:52:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13356419963940555396.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/ReachabilityCardinality1183797916499858585.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13356419963940555396.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/ReachabilityCardinality1183797916499858585.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13356419963940555396.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13356419963940555396.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 20
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :20 after 26
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :26 after 52
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :52 after 2854
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-10 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :2854 after 8948
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-14 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-08 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :8948 after 16013
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :16013 after 26000
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-03 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :26000 after 160160
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :160160 after 483104
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :483104 after 2.54675e+06
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,6.90054e+06,0.48094,16972,2,7572,21,36390,8,0,1003,29277,0
Total reachable state count : 6900544

Verifying 6 reachability properties.
Invariant property BusinessProcesses-PT-14-ReachabilityFireability-01 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

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-14-ReachabilityFireability-01,0,0.484399,16972,1,0,21,36390,8,0,1013,29277,0
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-03 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-14-ReachabilityFireability-03,384,0.485705,16972,2,372,21,36390,9,0,1027,29277,0
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-06 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

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-14-ReachabilityFireability-06,1,0.486917,16972,2,204,21,36390,9,0,1033,29277,0
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-08 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-14-ReachabilityFireability-08,6,0.488181,16972,2,240,21,36390,10,0,1035,29277,0
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-10 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-14-ReachabilityFireability-10,1,0.489788,16972,2,204,21,36390,11,0,1067,29277,0
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-14 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-14-ReachabilityFireability-14,12,0.492148,16972,2,252,21,36390,12,0,1074,29277,0
All properties solved without resorting to model-checking.

BK_STOP 1620546748504

--------------------
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-14"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-14, 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 r026-tajo-162038143900431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;