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.r024-tall-165251918600463.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 itstools
Input is BusinessProcesses-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.1K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 30 00:04 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 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 30 00:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 30 00:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 177K 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-18-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654200953808

Running Version 202205111006
[2022-06-02 20:15:55] [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-02 20:15:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:15:55] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2022-06-02 20:15:55] [INFO ] Transformed 717 places.
[2022-06-02 20:15:55] [INFO ] Transformed 642 transitions.
[2022-06-02 20:15:55] [INFO ] Found NUPN structural information;
[2022-06-02 20:15:55] [INFO ] Parsed PT model containing 717 places and 642 transitions in 257 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 21 ms
Reduce places removed 15 places and 15 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 627 rows 702 cols
[2022-06-02 20:15:56] [INFO ] Computed 114 place invariants in 31 ms
[2022-06-02 20:15:57] [INFO ] [Real]Absence check using 73 positive place invariants in 31 ms returned sat
[2022-06-02 20:15:57] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 14 ms returned sat
[2022-06-02 20:15:57] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 20:15:57] [INFO ] [Nat]Absence check using 73 positive place invariants in 35 ms returned sat
[2022-06-02 20:15:57] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2022-06-02 20:15:58] [INFO ] After 814ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2022-06-02 20:15:58] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 9 ms to minimize.
[2022-06-02 20:15:59] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 2 ms to minimize.
[2022-06-02 20:15:59] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2022-06-02 20:15:59] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2022-06-02 20:15:59] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2022-06-02 20:15:59] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2022-06-02 20:16:00] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 0 ms to minimize.
[2022-06-02 20:16:00] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:16:00] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:16:00] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2022-06-02 20:16:00] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 0 ms to minimize.
[2022-06-02 20:16:01] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:16:01] [INFO ] Deduced a trap composed of 155 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:16:01] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:16:01] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:16:01] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:16:01] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:16:02] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:16:02] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:16:02] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:16:02] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:16:02] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:16:03] [INFO ] Deduced a trap composed of 144 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:16:03] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:16:03] [INFO ] Deduced a trap composed of 161 places in 141 ms of which 0 ms to minimize.
[2022-06-02 20:16:03] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:16:03] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:16:03] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:16:04] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:16:04] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:16:04] [INFO ] Deduced a trap composed of 151 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:16:04] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:16:04] [INFO ] Deduced a trap composed of 151 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:16:05] [INFO ] Deduced a trap composed of 150 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:16:05] [INFO ] Deduced a trap composed of 160 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:16:05] [INFO ] Deduced a trap composed of 148 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:16:05] [INFO ] Deduced a trap composed of 160 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:16:05] [INFO ] Deduced a trap composed of 158 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:16:05] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 157 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 168 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 169 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 162 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:16:07] [INFO ] Deduced a trap composed of 163 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:16:07] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 0 ms to minimize.
[2022-06-02 20:16:07] [INFO ] Deduced a trap composed of 145 places in 145 ms of which 0 ms to minimize.
[2022-06-02 20:16:07] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 2 ms to minimize.
[2022-06-02 20:16:07] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:16:08] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 2 ms to minimize.
[2022-06-02 20:16:08] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:16:08] [INFO ] Deduced a trap composed of 154 places in 139 ms of which 0 ms to minimize.
[2022-06-02 20:16:08] [INFO ] Deduced a trap composed of 153 places in 137 ms of which 1 ms to minimize.
[2022-06-02 20:16:08] [INFO ] Deduced a trap composed of 147 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:16:08] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 0 ms to minimize.
[2022-06-02 20:16:09] [INFO ] Deduced a trap composed of 145 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:16:09] [INFO ] Deduced a trap composed of 152 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:16:09] [INFO ] Deduced a trap composed of 166 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:16:09] [INFO ] Deduced a trap composed of 156 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:16:09] [INFO ] Deduced a trap composed of 161 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:16:09] [INFO ] Deduced a trap composed of 179 places in 139 ms of which 0 ms to minimize.
[2022-06-02 20:16:10] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:16:10] [INFO ] Deduced a trap composed of 148 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:16:10] [INFO ] Deduced a trap composed of 171 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:16:10] [INFO ] Deduced a trap composed of 161 places in 136 ms of which 0 ms to minimize.
[2022-06-02 20:16:10] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2022-06-02 20:16:11] [INFO ] Deduced a trap composed of 162 places in 133 ms of which 0 ms to minimize.
[2022-06-02 20:16:11] [INFO ] Deduced a trap composed of 171 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:16:11] [INFO ] Deduced a trap composed of 173 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:16:11] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:16:11] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:16:11] [INFO ] Deduced a trap composed of 158 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:16:12] [INFO ] Deduced a trap composed of 160 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:16:12] [INFO ] Deduced a trap composed of 157 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:16:12] [INFO ] Deduced a trap composed of 157 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:16:12] [INFO ] Deduced a trap composed of 152 places in 137 ms of which 1 ms to minimize.
[2022-06-02 20:16:12] [INFO ] Deduced a trap composed of 183 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:16:12] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2022-06-02 20:16:13] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:16:13] [INFO ] Deduced a trap composed of 157 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:16:13] [INFO ] Deduced a trap composed of 159 places in 136 ms of which 0 ms to minimize.
[2022-06-02 20:16:13] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:16:14] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:16:14] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:16:14] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:16:14] [INFO ] Deduced a trap composed of 163 places in 155 ms of which 1 ms to minimize.
[2022-06-02 20:16:14] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:16:15] [INFO ] Deduced a trap composed of 151 places in 155 ms of which 0 ms to minimize.
[2022-06-02 20:16:15] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2022-06-02 20:16:15] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:16:15] [INFO ] Deduced a trap composed of 155 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:16:15] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 0 ms to minimize.
[2022-06-02 20:16:15] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:16:16] [INFO ] Deduced a trap composed of 160 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:16:16] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:16:16] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:16:16] [INFO ] Deduced a trap composed of 151 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:16:16] [INFO ] Deduced a trap composed of 151 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:16:17] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:16:17] [INFO ] Deduced a trap composed of 154 places in 140 ms of which 0 ms to minimize.
[2022-06-02 20:16:17] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 0 ms to minimize.
[2022-06-02 20:16:17] [INFO ] Deduced a trap composed of 187 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:16:17] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:16:17] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:16:18] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 0 ms to minimize.
[2022-06-02 20:16:18] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:16:18] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:16:18] [INFO ] Deduced a trap composed of 154 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:16:18] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:16:19] [INFO ] Deduced a trap composed of 150 places in 151 ms of which 0 ms to minimize.
[2022-06-02 20:16:19] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:16:19] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:16:19] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 0 ms to minimize.
[2022-06-02 20:16:19] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 0 ms to minimize.
[2022-06-02 20:16:20] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 1 ms to minimize.
[2022-06-02 20:16:20] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2022-06-02 20:16:20] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 1 ms to minimize.
[2022-06-02 20:16:20] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 0 ms to minimize.
[2022-06-02 20:16:20] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 0 ms to minimize.
[2022-06-02 20:16:20] [INFO ] Deduced a trap composed of 163 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:16:21] [INFO ] Deduced a trap composed of 163 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:16:21] [INFO ] Deduced a trap composed of 147 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:16:21] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:16:21] [INFO ] Deduced a trap composed of 145 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:16:21] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 0 ms to minimize.
[2022-06-02 20:16:22] [INFO ] Deduced a trap composed of 158 places in 141 ms of which 0 ms to minimize.
[2022-06-02 20:16:22] [INFO ] Deduced a trap composed of 154 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:16:22] [INFO ] Deduced a trap composed of 150 places in 159 ms of which 1 ms to minimize.
[2022-06-02 20:16:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:16:22] [INFO ] After 25120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2297 ms.
Support contains 22 out of 702 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (complete) has 1418 edges and 702 vertex of which 693 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 693 transition count 517
Reduce places removed 109 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 115 rules applied. Total rules applied 225 place count 584 transition count 511
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 231 place count 578 transition count 511
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 142 Pre rules applied. Total rules applied 231 place count 578 transition count 369
Deduced a syphon composed of 142 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 307 rules applied. Total rules applied 538 place count 413 transition count 369
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 627 place count 324 transition count 280
Iterating global reduction 3 with 89 rules applied. Total rules applied 716 place count 324 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 718 place count 324 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 719 place count 323 transition count 278
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 719 place count 323 transition count 270
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 738 place count 312 transition count 270
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 739 place count 311 transition count 269
Iterating global reduction 5 with 1 rules applied. Total rules applied 740 place count 311 transition count 269
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 944 place count 209 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 946 place count 208 transition count 170
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 947 place count 208 transition count 169
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 951 place count 208 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 952 place count 207 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 953 place count 206 transition count 168
Applied a total of 953 rules in 179 ms. Remains 206 /702 variables (removed 496) and now considering 168/627 (removed 459) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/702 places, 168/627 transitions.
Incomplete random walk after 1000000 steps, including 40480 resets, run finished after 13519 ms. (steps per millisecond=73 ) properties (out of 4) seen :2
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 11329 resets, run finished after 2830 ms. (steps per millisecond=353 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10724 resets, run finished after 1470 ms. (steps per millisecond=680 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 168 rows 206 cols
[2022-06-02 20:16:42] [INFO ] Computed 79 place invariants in 11 ms
[2022-06-02 20:16:42] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2022-06-02 20:16:42] [INFO ] [Real]Absence check using 65 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-02 20:16:42] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-02 20:16:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:16:42] [INFO ] After 10ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:16:42] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:16:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 9 ms returned sat
[2022-06-02 20:16:42] [INFO ] [Nat]Absence check using 65 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-02 20:16:43] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:16:43] [INFO ] After 24ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:16:43] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-06-02 20:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-06-02 20:16:43] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-02 20:16:43] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 48111 ms.

BK_STOP 1654201003246

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-18"
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-18, 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 r024-tall-165251918600463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 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 ;