Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914000551.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000551
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 148K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591163161231

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:46:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:46:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:46:02] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2020-06-03 05:46:02] [INFO ] Transformed 593 places.
[2020-06-03 05:46:02] [INFO ] Transformed 536 transitions.
[2020-06-03 05:46:02] [INFO ] Found NUPN structural information;
[2020-06-03 05:46:02] [INFO ] Parsed PT model containing 593 places and 536 transitions in 128 ms.
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 70 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 528 rows 585 cols
[2020-06-03 05:46:02] [INFO ] Computed 95 place invariants in 26 ms
[2020-06-03 05:46:03] [INFO ] [Real]Absence check using 57 positive place invariants in 65 ms returned sat
[2020-06-03 05:46:03] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 25 ms returned sat
[2020-06-03 05:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:04] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2020-06-03 05:46:04] [INFO ] Deduced a trap composed of 35 places in 232 ms
[2020-06-03 05:46:04] [INFO ] Deduced a trap composed of 16 places in 171 ms
[2020-06-03 05:46:04] [INFO ] Deduced a trap composed of 17 places in 185 ms
[2020-06-03 05:46:05] [INFO ] Deduced a trap composed of 21 places in 197 ms
[2020-06-03 05:46:05] [INFO ] Deduced a trap composed of 25 places in 172 ms
[2020-06-03 05:46:05] [INFO ] Deduced a trap composed of 15 places in 160 ms
[2020-06-03 05:46:05] [INFO ] Deduced a trap composed of 124 places in 159 ms
[2020-06-03 05:46:05] [INFO ] Deduced a trap composed of 123 places in 153 ms
[2020-06-03 05:46:05] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2020-06-03 05:46:06] [INFO ] Deduced a trap composed of 18 places in 140 ms
[2020-06-03 05:46:06] [INFO ] Deduced a trap composed of 12 places in 178 ms
[2020-06-03 05:46:06] [INFO ] Deduced a trap composed of 44 places in 198 ms
[2020-06-03 05:46:06] [INFO ] Deduced a trap composed of 36 places in 167 ms
[2020-06-03 05:46:06] [INFO ] Deduced a trap composed of 26 places in 164 ms
[2020-06-03 05:46:07] [INFO ] Deduced a trap composed of 128 places in 169 ms
[2020-06-03 05:46:07] [INFO ] Deduced a trap composed of 33 places in 159 ms
[2020-06-03 05:46:07] [INFO ] Deduced a trap composed of 43 places in 165 ms
[2020-06-03 05:46:07] [INFO ] Deduced a trap composed of 53 places in 151 ms
[2020-06-03 05:46:07] [INFO ] Deduced a trap composed of 44 places in 142 ms
[2020-06-03 05:46:08] [INFO ] Deduced a trap composed of 47 places in 131 ms
[2020-06-03 05:46:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s100 s101 s102 s155 s161 s163 s164 s165 s166 s170 s171 s172 s173 s174 s191 s197 s350 s351 s352 s366 s371 s376 s380 s381 s382 s487 s488 s491 s492 s514 s516 s526 s554 s557 s561 s570) 0)") while checking expression at index 0
[2020-06-03 05:46:08] [INFO ] [Real]Absence check using 57 positive place invariants in 36 ms returned sat
[2020-06-03 05:46:08] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 20 ms returned sat
[2020-06-03 05:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:08] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2020-06-03 05:46:09] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2020-06-03 05:46:09] [INFO ] Deduced a trap composed of 19 places in 162 ms
[2020-06-03 05:46:09] [INFO ] Deduced a trap composed of 15 places in 128 ms
[2020-06-03 05:46:09] [INFO ] Deduced a trap composed of 36 places in 157 ms
[2020-06-03 05:46:09] [INFO ] Deduced a trap composed of 37 places in 143 ms
[2020-06-03 05:46:09] [INFO ] Deduced a trap composed of 50 places in 131 ms
[2020-06-03 05:46:10] [INFO ] Deduced a trap composed of 38 places in 154 ms
[2020-06-03 05:46:10] [INFO ] Deduced a trap composed of 25 places in 151 ms
[2020-06-03 05:46:10] [INFO ] Deduced a trap composed of 125 places in 148 ms
[2020-06-03 05:46:10] [INFO ] Deduced a trap composed of 18 places in 127 ms
[2020-06-03 05:46:10] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-06-03 05:46:10] [INFO ] Deduced a trap composed of 24 places in 155 ms
[2020-06-03 05:46:11] [INFO ] Deduced a trap composed of 25 places in 147 ms
[2020-06-03 05:46:11] [INFO ] Deduced a trap composed of 28 places in 157 ms
[2020-06-03 05:46:11] [INFO ] Deduced a trap composed of 29 places in 148 ms
[2020-06-03 05:46:11] [INFO ] Deduced a trap composed of 37 places in 173 ms
[2020-06-03 05:46:11] [INFO ] Deduced a trap composed of 45 places in 153 ms
[2020-06-03 05:46:12] [INFO ] Deduced a trap composed of 26 places in 146 ms
[2020-06-03 05:46:12] [INFO ] Deduced a trap composed of 36 places in 171 ms
[2020-06-03 05:46:12] [INFO ] Deduced a trap composed of 120 places in 180 ms
[2020-06-03 05:46:13] [INFO ] Deduced a trap composed of 38 places in 759 ms
[2020-06-03 05:46:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s39 s40 s206 s207 s208 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s296 s299 s301 s302 s303 s400 s401 s402) 0)") while checking expression at index 1
[2020-06-03 05:46:13] [INFO ] [Real]Absence check using 57 positive place invariants in 64 ms returned sat
[2020-06-03 05:46:13] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 28 ms returned sat
[2020-06-03 05:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:14] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2020-06-03 05:46:14] [INFO ] Deduced a trap composed of 14 places in 169 ms
[2020-06-03 05:46:14] [INFO ] Deduced a trap composed of 8 places in 187 ms
[2020-06-03 05:46:14] [INFO ] Deduced a trap composed of 18 places in 174 ms
[2020-06-03 05:46:14] [INFO ] Deduced a trap composed of 16 places in 171 ms
[2020-06-03 05:46:15] [INFO ] Deduced a trap composed of 21 places in 169 ms
[2020-06-03 05:46:15] [INFO ] Deduced a trap composed of 13 places in 155 ms
[2020-06-03 05:46:15] [INFO ] Deduced a trap composed of 35 places in 160 ms
[2020-06-03 05:46:15] [INFO ] Deduced a trap composed of 15 places in 140 ms
[2020-06-03 05:46:15] [INFO ] Deduced a trap composed of 17 places in 139 ms
[2020-06-03 05:46:15] [INFO ] Deduced a trap composed of 21 places in 136 ms
[2020-06-03 05:46:16] [INFO ] Deduced a trap composed of 25 places in 154 ms
[2020-06-03 05:46:16] [INFO ] Deduced a trap composed of 24 places in 151 ms
[2020-06-03 05:46:16] [INFO ] Deduced a trap composed of 132 places in 139 ms
[2020-06-03 05:46:16] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-03 05:46:16] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2020-06-03 05:46:17] [INFO ] Deduced a trap composed of 121 places in 160 ms
[2020-06-03 05:46:17] [INFO ] Deduced a trap composed of 14 places in 153 ms
[2020-06-03 05:46:17] [INFO ] Deduced a trap composed of 32 places in 150 ms
[2020-06-03 05:46:17] [INFO ] Deduced a trap composed of 129 places in 158 ms
[2020-06-03 05:46:17] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-06-03 05:46:17] [INFO ] Deduced a trap composed of 33 places in 144 ms
[2020-06-03 05:46:18] [INFO ] Deduced a trap composed of 126 places in 161 ms
[2020-06-03 05:46:18] [INFO ] Deduced a trap composed of 34 places in 144 ms
[2020-06-03 05:46:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s155 s161 s163 s169 s170 s171 s172 s191 s197 s375 s376 s377 s380 s381 s382 s514 s516 s523 s530 s531 s557 s561 s570) 0)") while checking expression at index 2
[2020-06-03 05:46:18] [INFO ] [Real]Absence check using 57 positive place invariants in 34 ms returned sat
[2020-06-03 05:46:18] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 20 ms returned sat
[2020-06-03 05:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:18] [INFO ] [Real]Absence check using state equation in 445 ms returned unsat
[2020-06-03 05:46:18] [INFO ] [Real]Absence check using 57 positive place invariants in 34 ms returned sat
[2020-06-03 05:46:18] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 19 ms returned sat
[2020-06-03 05:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:19] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2020-06-03 05:46:19] [INFO ] Deduced a trap composed of 8 places in 155 ms
[2020-06-03 05:46:19] [INFO ] Deduced a trap composed of 16 places in 153 ms
[2020-06-03 05:46:20] [INFO ] Deduced a trap composed of 14 places in 150 ms
[2020-06-03 05:46:20] [INFO ] Deduced a trap composed of 121 places in 170 ms
[2020-06-03 05:46:20] [INFO ] Deduced a trap composed of 15 places in 169 ms
[2020-06-03 05:46:20] [INFO ] Deduced a trap composed of 28 places in 154 ms
[2020-06-03 05:46:20] [INFO ] Deduced a trap composed of 12 places in 169 ms
[2020-06-03 05:46:21] [INFO ] Deduced a trap composed of 15 places in 168 ms
[2020-06-03 05:46:21] [INFO ] Deduced a trap composed of 25 places in 166 ms
[2020-06-03 05:46:21] [INFO ] Deduced a trap composed of 34 places in 162 ms
[2020-06-03 05:46:21] [INFO ] Deduced a trap composed of 51 places in 163 ms
[2020-06-03 05:46:21] [INFO ] Deduced a trap composed of 132 places in 187 ms
[2020-06-03 05:46:22] [INFO ] Deduced a trap composed of 19 places in 158 ms
[2020-06-03 05:46:22] [INFO ] Deduced a trap composed of 16 places in 94 ms
[2020-06-03 05:46:22] [INFO ] Deduced a trap composed of 19 places in 82 ms
[2020-06-03 05:46:22] [INFO ] Deduced a trap composed of 22 places in 82 ms
[2020-06-03 05:46:22] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2020-06-03 05:46:22] [INFO ] Deduced a trap composed of 35 places in 81 ms
[2020-06-03 05:46:22] [INFO ] Deduced a trap composed of 33 places in 78 ms
[2020-06-03 05:46:22] [INFO ] Deduced a trap composed of 45 places in 79 ms
[2020-06-03 05:46:23] [INFO ] Deduced a trap composed of 39 places in 110 ms
[2020-06-03 05:46:23] [INFO ] Deduced a trap composed of 55 places in 81 ms
[2020-06-03 05:46:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 22 trap constraints in 3525 ms
[2020-06-03 05:46:23] [INFO ] [Real]Absence check using 57 positive place invariants in 38 ms returned sat
[2020-06-03 05:46:23] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 24 ms returned sat
[2020-06-03 05:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:24] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2020-06-03 05:46:24] [INFO ] Deduced a trap composed of 14 places in 272 ms
[2020-06-03 05:46:24] [INFO ] Deduced a trap composed of 11 places in 168 ms
[2020-06-03 05:46:24] [INFO ] Deduced a trap composed of 21 places in 216 ms
[2020-06-03 05:46:25] [INFO ] Deduced a trap composed of 44 places in 219 ms
[2020-06-03 05:46:25] [INFO ] Deduced a trap composed of 22 places in 293 ms
[2020-06-03 05:46:25] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2020-06-03 05:46:25] [INFO ] Deduced a trap composed of 32 places in 170 ms
[2020-06-03 05:46:26] [INFO ] Deduced a trap composed of 36 places in 194 ms
[2020-06-03 05:46:26] [INFO ] Deduced a trap composed of 128 places in 204 ms
[2020-06-03 05:46:26] [INFO ] Deduced a trap composed of 39 places in 186 ms
[2020-06-03 05:46:26] [INFO ] Deduced a trap composed of 144 places in 183 ms
[2020-06-03 05:46:26] [INFO ] Deduced a trap composed of 124 places in 168 ms
[2020-06-03 05:46:27] [INFO ] Deduced a trap composed of 28 places in 364 ms
[2020-06-03 05:46:27] [INFO ] Deduced a trap composed of 139 places in 330 ms
[2020-06-03 05:46:28] [INFO ] Deduced a trap composed of 130 places in 427 ms
[2020-06-03 05:46:28] [INFO ] Deduced a trap composed of 46 places in 165 ms
[2020-06-03 05:46:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s155 s156 s157 s158 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s180 s181 s189 s190 s191 s197 s198 s199 s375 s376 s377 s516 s570) 0)") while checking expression at index 5
[2020-06-03 05:46:28] [INFO ] [Real]Absence check using 57 positive place invariants in 36 ms returned sat
[2020-06-03 05:46:28] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 22 ms returned sat
[2020-06-03 05:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:29] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2020-06-03 05:46:29] [INFO ] Deduced a trap composed of 8 places in 169 ms
[2020-06-03 05:46:29] [INFO ] Deduced a trap composed of 11 places in 125 ms
[2020-06-03 05:46:29] [INFO ] Deduced a trap composed of 107 places in 162 ms
[2020-06-03 05:46:30] [INFO ] Deduced a trap composed of 16 places in 318 ms
[2020-06-03 05:46:30] [INFO ] Deduced a trap composed of 23 places in 144 ms
[2020-06-03 05:46:30] [INFO ] Deduced a trap composed of 19 places in 126 ms
[2020-06-03 05:46:30] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2020-06-03 05:46:30] [INFO ] Deduced a trap composed of 27 places in 71 ms
[2020-06-03 05:46:30] [INFO ] Deduced a trap composed of 35 places in 100 ms
[2020-06-03 05:46:30] [INFO ] Deduced a trap composed of 39 places in 78 ms
[2020-06-03 05:46:30] [INFO ] Deduced a trap composed of 20 places in 94 ms
[2020-06-03 05:46:31] [INFO ] Deduced a trap composed of 31 places in 138 ms
[2020-06-03 05:46:31] [INFO ] Deduced a trap composed of 31 places in 136 ms
[2020-06-03 05:46:31] [INFO ] Deduced a trap composed of 31 places in 99 ms
[2020-06-03 05:46:31] [INFO ] Deduced a trap composed of 33 places in 171 ms
[2020-06-03 05:46:31] [INFO ] Deduced a trap composed of 40 places in 76 ms
[2020-06-03 05:46:31] [INFO ] Deduced a trap composed of 21 places in 135 ms
[2020-06-03 05:46:31] [INFO ] Deduced a trap composed of 37 places in 117 ms
[2020-06-03 05:46:32] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2910 ms
[2020-06-03 05:46:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:46:32] [INFO ] [Nat]Absence check using 57 positive place invariants in 80 ms returned sat
[2020-06-03 05:46:32] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 28 ms returned sat
[2020-06-03 05:46:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:33] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2020-06-03 05:46:33] [INFO ] Deduced a trap composed of 129 places in 322 ms
[2020-06-03 05:46:33] [INFO ] Deduced a trap composed of 15 places in 395 ms
[2020-06-03 05:46:34] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2020-06-03 05:46:34] [INFO ] Deduced a trap composed of 21 places in 154 ms
[2020-06-03 05:46:34] [INFO ] Deduced a trap composed of 132 places in 324 ms
[2020-06-03 05:46:34] [INFO ] Deduced a trap composed of 11 places in 161 ms
[2020-06-03 05:46:34] [INFO ] Deduced a trap composed of 135 places in 154 ms
[2020-06-03 05:46:35] [INFO ] Deduced a trap composed of 24 places in 277 ms
[2020-06-03 05:46:35] [INFO ] Deduced a trap composed of 16 places in 315 ms
[2020-06-03 05:46:36] [INFO ] Deduced a trap composed of 23 places in 318 ms
[2020-06-03 05:46:36] [INFO ] Deduced a trap composed of 37 places in 160 ms
[2020-06-03 05:46:36] [INFO ] Deduced a trap composed of 36 places in 389 ms
[2020-06-03 05:46:36] [INFO ] Deduced a trap composed of 153 places in 262 ms
[2020-06-03 05:46:37] [INFO ] Deduced a trap composed of 148 places in 165 ms
[2020-06-03 05:46:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s46 s47 s49 s50 s53 s54 s67 s68 s106 s107 s108 s134 s135 s136 s140 s141 s142 s146 s147 s148 s155 s156 s158 s162 s167 s168 s172 s173 s174 s180 s181 s189 s190 s198 s199 s218 s219 s220 s224 s225 s226 s271 s281 s301 s311 s316 s321 s326 s335 s337 s340 s342 s345 s346 s347 s351 s356 s361 s371 s376 s386 s391 s411 s415 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s458 s459 s460 s461 s464 s465 s468 s469 s470 s471 s480 s481 s487 s488 s491 s492 s493 s494 s495 s496 s497 s498 s505 s506 s511 s512 s514 s516 s518 s520 s523 s526 s532 s533 s534 s535 s536 s537 s538 s539 s544 s545 s550 s551 s564 s567 s576 s582) 0)") while checking expression at index 6
[2020-06-03 05:46:37] [INFO ] [Real]Absence check using 57 positive place invariants in 79 ms returned sat
[2020-06-03 05:46:37] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 32 ms returned sat
[2020-06-03 05:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:38] [INFO ] [Real]Absence check using state equation in 968 ms returned sat
[2020-06-03 05:46:38] [INFO ] Deduced a trap composed of 8 places in 157 ms
[2020-06-03 05:46:38] [INFO ] Deduced a trap composed of 15 places in 204 ms
[2020-06-03 05:46:38] [INFO ] Deduced a trap composed of 18 places in 179 ms
[2020-06-03 05:46:39] [INFO ] Deduced a trap composed of 15 places in 158 ms
[2020-06-03 05:46:39] [INFO ] Deduced a trap composed of 15 places in 506 ms
[2020-06-03 05:46:39] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-06-03 05:46:39] [INFO ] Deduced a trap composed of 43 places in 128 ms
[2020-06-03 05:46:40] [INFO ] Deduced a trap composed of 34 places in 196 ms
[2020-06-03 05:46:40] [INFO ] Deduced a trap composed of 19 places in 208 ms
[2020-06-03 05:46:40] [INFO ] Deduced a trap composed of 22 places in 106 ms
[2020-06-03 05:46:40] [INFO ] Deduced a trap composed of 16 places in 97 ms
[2020-06-03 05:46:40] [INFO ] Deduced a trap composed of 35 places in 122 ms
[2020-06-03 05:46:40] [INFO ] Deduced a trap composed of 29 places in 106 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 39 places in 88 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 26 places in 121 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 31 places in 84 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 24 places in 84 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 30 places in 89 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 26 places in 91 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 33 places in 56 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 46 places in 54 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 46 places in 61 ms
[2020-06-03 05:46:41] [INFO ] Deduced a trap composed of 40 places in 60 ms
[2020-06-03 05:46:42] [INFO ] Deduced a trap composed of 33 places in 93 ms
[2020-06-03 05:46:42] [INFO ] Deduced a trap composed of 43 places in 60 ms
[2020-06-03 05:46: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 closed (> (+ s0 s1 s32 s33 s35 s36 s39 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s267 s281 s286 s296 s324 s326 s327 s328 s395 s396 s397 s401 s466 s467 s507 s508 s534 s535) 0)") while checking expression at index 7
[2020-06-03 05:46:42] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned unsat
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 29 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 306 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 573 transition count 398
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 252 place count 452 transition count 398
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 252 place count 452 transition count 318
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 173 rules applied. Total rules applied 425 place count 359 transition count 318
Symmetric choice reduction at 2 with 70 rule applications. Total rules 495 place count 359 transition count 318
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 70 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 635 place count 289 transition count 248
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 635 place count 289 transition count 243
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 647 place count 282 transition count 243
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 817 place count 196 transition count 159
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 2 with 2 rules applied. Total rules applied 819 place count 195 transition count 163
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 821 place count 195 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 823 place count 193 transition count 161
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 826 place count 193 transition count 161
Applied a total of 826 rules in 105 ms. Remains 193 /585 variables (removed 392) and now considering 161/528 (removed 367) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/585 places, 161/528 transitions.
Incomplete random walk after 1000000 steps, including 24662 resets, run finished after 2080 ms. (steps per millisecond=480 ) properties seen :[1, 1, 0, 0, 1, 1]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 5075 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties seen :[1, 0]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 5937 resets, run finished after 1104 ms. (steps per millisecond=905 ) properties seen :[0]
// Phase 1: matrix 161 rows 193 cols
[2020-06-03 05:46:46] [INFO ] Computed 73 place invariants in 3 ms
[2020-06-03 05:46:46] [INFO ] [Real]Absence check using 52 positive place invariants in 25 ms returned sat
[2020-06-03 05:46:46] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 8 ms returned sat
[2020-06-03 05:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:46] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 05:46:46] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-06-03 05:46:46] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:46:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:46:46] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2020-06-03 05:46:46] [INFO ] [Nat]Absence check using 52 positive and 21 generalized place invariants in 12 ms returned sat
[2020-06-03 05:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:46:46] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2020-06-03 05:46:46] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2020-06-03 05:46:47] [INFO ] Deduced a trap composed of 5 places in 101 ms
[2020-06-03 05:46:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 112 ms
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

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-13"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-13, 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 r182-oct2-158987914000551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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