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-158987914100559.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-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.1K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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 156K 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-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 1591164013294

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:00:15] [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 06:00:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:00:15] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-06-03 06:00:15] [INFO ] Transformed 624 places.
[2020-06-03 06:00:15] [INFO ] Transformed 564 transitions.
[2020-06-03 06:00:15] [INFO ] Found NUPN structural information;
[2020-06-03 06:00:15] [INFO ] Parsed PT model containing 624 places and 564 transitions in 118 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 68 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1]
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 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 12 resets, run finished after 12 ms. (steps per millisecond=833 ) 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 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 11 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 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 11 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 11 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 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 556 rows 616 cols
[2020-06-03 06:00:15] [INFO ] Computed 99 place invariants in 24 ms
[2020-06-03 06:00:16] [INFO ] [Real]Absence check using 60 positive place invariants in 28 ms returned unsat
[2020-06-03 06:00:16] [INFO ] [Real]Absence check using 60 positive place invariants in 44 ms returned sat
[2020-06-03 06:00:16] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 31 ms returned sat
[2020-06-03 06:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:17] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2020-06-03 06:00:17] [INFO ] Deduced a trap composed of 23 places in 144 ms
[2020-06-03 06:00:17] [INFO ] Deduced a trap composed of 21 places in 109 ms
[2020-06-03 06:00:17] [INFO ] Deduced a trap composed of 23 places in 113 ms
[2020-06-03 06:00:17] [INFO ] Deduced a trap composed of 19 places in 108 ms
[2020-06-03 06:00:17] [INFO ] Deduced a trap composed of 35 places in 122 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 49 places in 99 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 29 places in 100 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 56 places in 100 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 19 places in 88 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 21 places in 80 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 17 places in 73 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 14 places in 78 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 39 places in 79 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 63 places in 74 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 35 places in 68 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 66 places in 67 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 31 places in 55 ms
[2020-06-03 06:00:19] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2060 ms
[2020-06-03 06:00:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:19] [INFO ] [Nat]Absence check using 60 positive place invariants in 54 ms returned sat
[2020-06-03 06:00:19] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 22 ms returned sat
[2020-06-03 06:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:20] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 17 places in 184 ms
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 30 places in 154 ms
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 20 places in 74 ms
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 17 places in 75 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 14 places in 78 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 33 places in 73 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 39 places in 73 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 67 places in 73 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 35 places in 70 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 64 places in 71 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 67 places in 73 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 68 places in 70 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 72 places in 65 ms
[2020-06-03 06:00:21] [INFO ] Deduced a trap composed of 32 places in 57 ms
[2020-06-03 06:00:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1762 ms
[2020-06-03 06:00:22] [INFO ] Computed and/alt/rep : 555/2453/555 causal constraints in 36 ms.
[2020-06-03 06:00:23] [INFO ] Added : 267 causal constraints over 54 iterations in 1956 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 06:00:24] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2020-06-03 06:00:24] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 34 ms returned sat
[2020-06-03 06:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:24] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2020-06-03 06:00:25] [INFO ] Deduced a trap composed of 13 places in 200 ms
[2020-06-03 06:00:25] [INFO ] Deduced a trap composed of 22 places in 213 ms
[2020-06-03 06:00:25] [INFO ] Deduced a trap composed of 18 places in 192 ms
[2020-06-03 06:00:25] [INFO ] Deduced a trap composed of 140 places in 193 ms
[2020-06-03 06:00:26] [INFO ] Deduced a trap composed of 41 places in 231 ms
[2020-06-03 06:00:26] [INFO ] Deduced a trap composed of 16 places in 198 ms
[2020-06-03 06:00:26] [INFO ] Deduced a trap composed of 41 places in 202 ms
[2020-06-03 06:00:26] [INFO ] Deduced a trap composed of 13 places in 382 ms
[2020-06-03 06:00:27] [INFO ] Deduced a trap composed of 138 places in 198 ms
[2020-06-03 06:00:27] [INFO ] Deduced a trap composed of 36 places in 194 ms
[2020-06-03 06:00:27] [INFO ] Deduced a trap composed of 21 places in 197 ms
[2020-06-03 06:00:27] [INFO ] Deduced a trap composed of 20 places in 175 ms
[2020-06-03 06:00:27] [INFO ] Deduced a trap composed of 23 places in 182 ms
[2020-06-03 06:00:28] [INFO ] Deduced a trap composed of 37 places in 338 ms
[2020-06-03 06:00:28] [INFO ] Deduced a trap composed of 36 places in 195 ms
[2020-06-03 06:00:28] [INFO ] Deduced a trap composed of 26 places in 317 ms
[2020-06-03 06:00:29] [INFO ] Deduced a trap composed of 29 places in 186 ms
[2020-06-03 06:00:29] [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 s49 s52 s53 s54 s55 s56 s57 s63 s64 s222 s223 s224 s243 s246 s284 s285 s286 s328 s333 s338 s428 s433 s573 s574 s577 s578) 0)") while checking expression at index 2
[2020-06-03 06:00:29] [INFO ] [Real]Absence check using 60 positive place invariants in 132 ms returned sat
[2020-06-03 06:00:29] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 52 ms returned sat
[2020-06-03 06:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:30] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2020-06-03 06:00:30] [INFO ] Deduced a trap composed of 142 places in 341 ms
[2020-06-03 06:00:30] [INFO ] Deduced a trap composed of 37 places in 255 ms
[2020-06-03 06:00:31] [INFO ] Deduced a trap composed of 26 places in 201 ms
[2020-06-03 06:00:31] [INFO ] Deduced a trap composed of 20 places in 199 ms
[2020-06-03 06:00:31] [INFO ] Deduced a trap composed of 28 places in 198 ms
[2020-06-03 06:00:31] [INFO ] Deduced a trap composed of 17 places in 195 ms
[2020-06-03 06:00:32] [INFO ] Deduced a trap composed of 22 places in 198 ms
[2020-06-03 06:00:32] [INFO ] Deduced a trap composed of 28 places in 196 ms
[2020-06-03 06:00:32] [INFO ] Deduced a trap composed of 21 places in 189 ms
[2020-06-03 06:00:32] [INFO ] Deduced a trap composed of 18 places in 201 ms
[2020-06-03 06:00:32] [INFO ] Deduced a trap composed of 21 places in 190 ms
[2020-06-03 06:00:33] [INFO ] Deduced a trap composed of 124 places in 191 ms
[2020-06-03 06:00:33] [INFO ] Deduced a trap composed of 137 places in 196 ms
[2020-06-03 06:00:33] [INFO ] Deduced a trap composed of 41 places in 189 ms
[2020-06-03 06:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 3317 ms
[2020-06-03 06:00:33] [INFO ] [Real]Absence check using 60 positive place invariants in 63 ms returned sat
[2020-06-03 06:00:33] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 34 ms returned sat
[2020-06-03 06:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:34] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2020-06-03 06:00:34] [INFO ] Deduced a trap composed of 13 places in 213 ms
[2020-06-03 06:00:35] [INFO ] Deduced a trap composed of 137 places in 199 ms
[2020-06-03 06:00:35] [INFO ] Deduced a trap composed of 140 places in 205 ms
[2020-06-03 06:00:35] [INFO ] Deduced a trap composed of 15 places in 198 ms
[2020-06-03 06:00:35] [INFO ] Deduced a trap composed of 19 places in 257 ms
[2020-06-03 06:00:36] [INFO ] Deduced a trap composed of 15 places in 340 ms
[2020-06-03 06:00:36] [INFO ] Deduced a trap composed of 23 places in 227 ms
[2020-06-03 06:00:36] [INFO ] Deduced a trap composed of 13 places in 185 ms
[2020-06-03 06:00:36] [INFO ] Deduced a trap composed of 12 places in 177 ms
[2020-06-03 06:00:37] [INFO ] Deduced a trap composed of 148 places in 172 ms
[2020-06-03 06:00:37] [INFO ] Deduced a trap composed of 25 places in 193 ms
[2020-06-03 06:00:37] [INFO ] Deduced a trap composed of 19 places in 181 ms
[2020-06-03 06:00:37] [INFO ] Deduced a trap composed of 19 places in 180 ms
[2020-06-03 06:00:37] [INFO ] Deduced a trap composed of 22 places in 195 ms
[2020-06-03 06:00:38] [INFO ] Deduced a trap composed of 22 places in 595 ms
[2020-06-03 06:00:38] [INFO ] Deduced a trap composed of 7 places in 304 ms
[2020-06-03 06:00:38] [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 s243 s244 s245 s246) 0)") while checking expression at index 4
[2020-06-03 06:00:39] [INFO ] [Real]Absence check using 60 positive place invariants in 70 ms returned sat
[2020-06-03 06:00:39] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 24 ms returned sat
[2020-06-03 06:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:39] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2020-06-03 06:00:39] [INFO ] Deduced a trap composed of 128 places in 202 ms
[2020-06-03 06:00:40] [INFO ] Deduced a trap composed of 14 places in 187 ms
[2020-06-03 06:00:40] [INFO ] Deduced a trap composed of 14 places in 182 ms
[2020-06-03 06:00:40] [INFO ] Deduced a trap composed of 11 places in 180 ms
[2020-06-03 06:00:40] [INFO ] Deduced a trap composed of 15 places in 183 ms
[2020-06-03 06:00:41] [INFO ] Deduced a trap composed of 18 places in 182 ms
[2020-06-03 06:00:41] [INFO ] Deduced a trap composed of 18 places in 278 ms
[2020-06-03 06:00:44] [INFO ] Deduced a trap composed of 16 places in 2815 ms
[2020-06-03 06:00:44] [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 s11 s159 s312 s313 s314) 0)") while checking expression at index 5
[2020-06-03 06:00:44] [INFO ] [Real]Absence check using 60 positive place invariants in 82 ms returned sat
[2020-06-03 06:00:44] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 47 ms returned sat
[2020-06-03 06:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:45] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2020-06-03 06:00:45] [INFO ] Deduced a trap composed of 12 places in 385 ms
[2020-06-03 06:00:46] [INFO ] Deduced a trap composed of 131 places in 341 ms
[2020-06-03 06:00:46] [INFO ] Deduced a trap composed of 16 places in 255 ms
[2020-06-03 06:00:46] [INFO ] Deduced a trap composed of 21 places in 536 ms
[2020-06-03 06:00:47] [INFO ] Deduced a trap composed of 19 places in 359 ms
[2020-06-03 06:00:47] [INFO ] Deduced a trap composed of 33 places in 173 ms
[2020-06-03 06:00:47] [INFO ] Deduced a trap composed of 19 places in 327 ms
[2020-06-03 06:00:48] [INFO ] Deduced a trap composed of 48 places in 160 ms
[2020-06-03 06:00:48] [INFO ] Deduced a trap composed of 144 places in 159 ms
[2020-06-03 06:00:49] [INFO ] Deduced a trap composed of 22 places in 1264 ms
[2020-06-03 06:00:49] [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 s11 s70 s71 s159 s293 s297 s298 s299 s343 s542 s543) 0)") while checking expression at index 6
[2020-06-03 06:00:49] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2020-06-03 06:00:49] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2020-06-03 06:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:50] [INFO ] [Real]Absence check using state equation in 800 ms returned unsat
[2020-06-03 06:00:50] [INFO ] [Real]Absence check using 60 positive place invariants in 90 ms returned sat
[2020-06-03 06:00:50] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 2 ms returned unsat
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 25800 steps, including 198 resets, run finished after 123 ms. (steps per millisecond=209 ) properties seen :[1, 0, 0, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 22 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 332 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 57 ms
Free SCC test removed 6 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.35 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Iterating post reduction 0 with 134 rules applied. Total rules applied 136 place count 604 transition count 421
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 262 place count 478 transition count 421
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 262 place count 478 transition count 331
Deduced a syphon composed of 90 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 2 with 193 rules applied. Total rules applied 455 place count 375 transition count 331
Symmetric choice reduction at 2 with 80 rule applications. Total rules 535 place count 375 transition count 331
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 80 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 695 place count 295 transition count 251
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 695 place count 295 transition count 242
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 716 place count 283 transition count 242
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 888 place count 197 transition count 156
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 890 place count 196 transition count 160
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 892 place count 196 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 894 place count 194 transition count 158
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 895 place count 194 transition count 158
Applied a total of 895 rules in 276 ms. Remains 194 /616 variables (removed 422) and now considering 158/556 (removed 398) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/616 places, 158/556 transitions.
Incomplete random walk after 1000000 steps, including 25815 resets, run finished after 2435 ms. (steps per millisecond=410 ) properties seen :[1, 1, 1, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 2919 steps, including 24 resets, run visited all 1 properties in 6 ms. (steps per millisecond=486 )
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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-14"
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-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 r182-oct2-158987914100559"
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 ;