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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 4.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K 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.3K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 159K 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-16-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591165345353

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:22:26] [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:22:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:22:26] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2020-06-03 06:22:26] [INFO ] Transformed 638 places.
[2020-06-03 06:22:26] [INFO ] Transformed 578 transitions.
[2020-06-03 06:22:26] [INFO ] Found NUPN structural information;
[2020-06-03 06:22:26] [INFO ] Parsed PT model containing 638 places and 578 transitions in 110 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 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 67 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 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, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 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, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 570 rows 630 cols
[2020-06-03 06:22:27] [INFO ] Computed 100 place invariants in 23 ms
[2020-06-03 06:22:27] [INFO ] [Real]Absence check using 62 positive place invariants in 56 ms returned sat
[2020-06-03 06:22:27] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 30 ms returned sat
[2020-06-03 06:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:22:28] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2020-06-03 06:22:28] [INFO ] Deduced a trap composed of 16 places in 249 ms
[2020-06-03 06:22:28] [INFO ] Deduced a trap composed of 12 places in 184 ms
[2020-06-03 06:22:29] [INFO ] Deduced a trap composed of 13 places in 538 ms
[2020-06-03 06:22:29] [INFO ] Deduced a trap composed of 118 places in 195 ms
[2020-06-03 06:22:29] [INFO ] Deduced a trap composed of 8 places in 243 ms
[2020-06-03 06:22:30] [INFO ] Deduced a trap composed of 15 places in 473 ms
[2020-06-03 06:22:30] [INFO ] Deduced a trap composed of 16 places in 359 ms
[2020-06-03 06:22:31] [INFO ] Deduced a trap composed of 36 places in 177 ms
[2020-06-03 06:22:31] [INFO ] Deduced a trap composed of 48 places in 155 ms
[2020-06-03 06:22:31] [INFO ] Deduced a trap composed of 22 places in 173 ms
[2020-06-03 06:22:31] [INFO ] Deduced a trap composed of 25 places in 75 ms
[2020-06-03 06:22:31] [INFO ] Deduced a trap composed of 27 places in 37 ms
[2020-06-03 06:22:31] [INFO ] Deduced a trap composed of 44 places in 46 ms
[2020-06-03 06:22:31] [INFO ] Deduced a trap composed of 51 places in 77 ms
[2020-06-03 06:22:32] [INFO ] Deduced a trap composed of 59 places in 80 ms
[2020-06-03 06:22:32] [INFO ] Deduced a trap composed of 19 places in 67 ms
[2020-06-03 06:22:32] [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 s251 s252 s253 s254 s290 s422 s423 s424 s426 s428 s429 s430 s468 s469 s470 s548 s549) 0)") while checking expression at index 0
[2020-06-03 06:22:32] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:22:32] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-06-03 06:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:22:33] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2020-06-03 06:22:33] [INFO ] Deduced a trap composed of 8 places in 369 ms
[2020-06-03 06:22:33] [INFO ] Deduced a trap composed of 18 places in 348 ms
[2020-06-03 06:22:33] [INFO ] Deduced a trap composed of 14 places in 125 ms
[2020-06-03 06:22:34] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-06-03 06:22:34] [INFO ] Deduced a trap composed of 46 places in 119 ms
[2020-06-03 06:22:34] [INFO ] Deduced a trap composed of 39 places in 126 ms
[2020-06-03 06:22:34] [INFO ] Deduced a trap composed of 28 places in 114 ms
[2020-06-03 06:22:34] [INFO ] Deduced a trap composed of 15 places in 125 ms
[2020-06-03 06:22:34] [INFO ] Deduced a trap composed of 46 places in 118 ms
[2020-06-03 06:22:35] [INFO ] Deduced a trap composed of 23 places in 116 ms
[2020-06-03 06:22:35] [INFO ] Deduced a trap composed of 38 places in 121 ms
[2020-06-03 06:22:35] [INFO ] Deduced a trap composed of 47 places in 112 ms
[2020-06-03 06:22:35] [INFO ] Deduced a trap composed of 39 places in 109 ms
[2020-06-03 06:22:35] [INFO ] Deduced a trap composed of 38 places in 112 ms
[2020-06-03 06:22:35] [INFO ] Deduced a trap composed of 41 places in 96 ms
[2020-06-03 06:22:35] [INFO ] Deduced a trap composed of 38 places in 95 ms
[2020-06-03 06:22:35] [INFO ] Deduced a trap composed of 44 places in 98 ms
[2020-06-03 06:22:36] [INFO ] Deduced a trap composed of 60 places in 99 ms
[2020-06-03 06:22:36] [INFO ] Deduced a trap composed of 54 places in 92 ms
[2020-06-03 06:22:36] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2020-06-03 06:22:36] [INFO ] Deduced a trap composed of 45 places in 43 ms
[2020-06-03 06:22:36] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3294 ms
[2020-06-03 06:22:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:22:36] [INFO ] [Nat]Absence check using 62 positive place invariants in 72 ms returned sat
[2020-06-03 06:22:36] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2020-06-03 06:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:22:37] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2020-06-03 06:22:37] [INFO ] Deduced a trap composed of 8 places in 228 ms
[2020-06-03 06:22:37] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-06-03 06:22:37] [INFO ] Deduced a trap composed of 8 places in 190 ms
[2020-06-03 06:22:38] [INFO ] Deduced a trap composed of 15 places in 119 ms
[2020-06-03 06:22:38] [INFO ] Deduced a trap composed of 23 places in 106 ms
[2020-06-03 06:22:38] [INFO ] Deduced a trap composed of 15 places in 94 ms
[2020-06-03 06:22:38] [INFO ] Deduced a trap composed of 36 places in 90 ms
[2020-06-03 06:22:38] [INFO ] Deduced a trap composed of 40 places in 89 ms
[2020-06-03 06:22:38] [INFO ] Deduced a trap composed of 43 places in 93 ms
[2020-06-03 06:22:38] [INFO ] Deduced a trap composed of 54 places in 86 ms
[2020-06-03 06:22:38] [INFO ] Deduced a trap composed of 42 places in 85 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 31 places in 88 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 42 places in 82 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 53 places in 82 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 35 places in 79 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 42 places in 78 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 48 places in 80 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 54 places in 90 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 63 places in 75 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 54 places in 74 ms
[2020-06-03 06:22:39] [INFO ] Deduced a trap composed of 62 places in 73 ms
[2020-06-03 06:22:40] [INFO ] Deduced a trap composed of 30 places in 47 ms
[2020-06-03 06:22:40] [INFO ] Deduced a trap composed of 52 places in 276 ms
[2020-06-03 06:22:40] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2020-06-03 06:22:40] [INFO ] Deduced a trap composed of 45 places in 80 ms
[2020-06-03 06:22:40] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3376 ms
[2020-06-03 06:22:40] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 42 ms.
[2020-06-03 06:22:41] [INFO ] Added : 60 causal constraints over 12 iterations in 715 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 06:22:41] [INFO ] [Real]Absence check using 62 positive place invariants in 49 ms returned unsat
[2020-06-03 06:22:41] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:22:41] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2020-06-03 06:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:22:42] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2020-06-03 06:22:42] [INFO ] Deduced a trap composed of 133 places in 310 ms
[2020-06-03 06:22:43] [INFO ] Deduced a trap composed of 8 places in 186 ms
[2020-06-03 06:22:43] [INFO ] Deduced a trap composed of 14 places in 401 ms
[2020-06-03 06:22:43] [INFO ] Deduced a trap composed of 16 places in 254 ms
[2020-06-03 06:22:43] [INFO ] Deduced a trap composed of 14 places in 188 ms
[2020-06-03 06:22:44] [INFO ] Deduced a trap composed of 11 places in 299 ms
[2020-06-03 06:22:44] [INFO ] Deduced a trap composed of 20 places in 298 ms
[2020-06-03 06:22:45] [INFO ] Deduced a trap composed of 18 places in 795 ms
[2020-06-03 06:22:46] [INFO ] Deduced a trap composed of 31 places in 646 ms
[2020-06-03 06:22:46] [INFO ] Deduced a trap composed of 159 places in 301 ms
[2020-06-03 06:22:47] [INFO ] Deduced a trap composed of 24 places in 871 ms
[2020-06-03 06:22:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s111 s407 s408 s409) 0)") while checking expression at index 3
[2020-06-03 06:22:47] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-06-03 06:22:47] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 21 ms returned sat
[2020-06-03 06:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:22:48] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2020-06-03 06:22:48] [INFO ] Deduced a trap composed of 22 places in 206 ms
[2020-06-03 06:22:48] [INFO ] Deduced a trap composed of 8 places in 108 ms
[2020-06-03 06:22:48] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-06-03 06:22:48] [INFO ] Deduced a trap composed of 15 places in 97 ms
[2020-06-03 06:22:48] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2020-06-03 06:22:49] [INFO ] Deduced a trap composed of 26 places in 109 ms
[2020-06-03 06:22:50] [INFO ] Deduced a trap composed of 40 places in 1040 ms
[2020-06-03 06:22:50] [INFO ] Deduced a trap composed of 33 places in 92 ms
[2020-06-03 06:22:50] [INFO ] Deduced a trap composed of 84 places in 93 ms
[2020-06-03 06:22:50] [INFO ] Deduced a trap composed of 19 places in 104 ms
[2020-06-03 06:22:50] [INFO ] Deduced a trap composed of 14 places in 98 ms
[2020-06-03 06:22:50] [INFO ] Deduced a trap composed of 36 places in 97 ms
[2020-06-03 06:22:50] [INFO ] Deduced a trap composed of 22 places in 100 ms
[2020-06-03 06:22:51] [INFO ] Deduced a trap composed of 44 places in 70 ms
[2020-06-03 06:22:51] [INFO ] Deduced a trap composed of 50 places in 68 ms
[2020-06-03 06:22:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2923 ms
[2020-06-03 06:22:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:22:51] [INFO ] [Nat]Absence check using 62 positive place invariants in 64 ms returned sat
[2020-06-03 06:22:51] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 39 ms returned sat
[2020-06-03 06:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:22:52] [INFO ] [Nat]Absence check using state equation in 1075 ms returned sat
[2020-06-03 06:22:52] [INFO ] Deduced a trap composed of 15 places in 343 ms
[2020-06-03 06:22:53] [INFO ] Deduced a trap composed of 39 places in 439 ms
[2020-06-03 06:22:54] [INFO ] Deduced a trap composed of 39 places in 856 ms
[2020-06-03 06:22:54] [INFO ] Deduced a trap composed of 8 places in 208 ms
[2020-06-03 06:22:54] [INFO ] Deduced a trap composed of 12 places in 189 ms
[2020-06-03 06:22:54] [INFO ] Deduced a trap composed of 16 places in 214 ms
[2020-06-03 06:22:55] [INFO ] Deduced a trap composed of 38 places in 177 ms
[2020-06-03 06:22:55] [INFO ] Deduced a trap composed of 48 places in 172 ms
[2020-06-03 06:22:55] [INFO ] Deduced a trap composed of 40 places in 189 ms
[2020-06-03 06:22:55] [INFO ] Deduced a trap composed of 23 places in 228 ms
[2020-06-03 06:22:55] [INFO ] Deduced a trap composed of 18 places in 169 ms
[2020-06-03 06:22:56] [INFO ] Deduced a trap composed of 39 places in 175 ms
[2020-06-03 06:22:56] [INFO ] Deduced a trap composed of 46 places in 227 ms
[2020-06-03 06:22:56] [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 s125 s126 s130 s169 s174 s175 s176 s177 s180 s181 s182 s183 s184 s185 s186 s187 s188 s208 s209 s210 s211 s212 s213 s397 s398 s399 s403 s408 s525 s526 s559 s561 s602 s603 s612) 0)") while checking expression at index 4
[2020-06-03 06:22:56] [INFO ] [Real]Absence check using 62 positive place invariants in 40 ms returned sat
[2020-06-03 06:22:56] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 5 ms returned unsat
[2020-06-03 06:22:56] [INFO ] [Real]Absence check using 62 positive place invariants in 444 ms returned sat
[2020-06-03 06:22:57] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 100 ms returned sat
[2020-06-03 06:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:22:57] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2020-06-03 06:22:58] [INFO ] Deduced a trap composed of 12 places in 152 ms
[2020-06-03 06:22:58] [INFO ] Deduced a trap composed of 19 places in 288 ms
[2020-06-03 06:22:58] [INFO ] Deduced a trap composed of 15 places in 123 ms
[2020-06-03 06:22:58] [INFO ] Deduced a trap composed of 38 places in 89 ms
[2020-06-03 06:22:58] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-06-03 06:22:59] [INFO ] Deduced a trap composed of 17 places in 182 ms
[2020-06-03 06:22:59] [INFO ] Deduced a trap composed of 35 places in 85 ms
[2020-06-03 06:22:59] [INFO ] Deduced a trap composed of 41 places in 84 ms
[2020-06-03 06:22:59] [INFO ] Deduced a trap composed of 44 places in 91 ms
[2020-06-03 06:22:59] [INFO ] Deduced a trap composed of 36 places in 162 ms
[2020-06-03 06:22:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1655 ms
[2020-06-03 06:22:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:22:59] [INFO ] [Nat]Absence check using 62 positive place invariants in 52 ms returned sat
[2020-06-03 06:22:59] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 26 ms returned sat
[2020-06-03 06:22:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:00] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2020-06-03 06:23:00] [INFO ] Deduced a trap composed of 16 places in 148 ms
[2020-06-03 06:23:00] [INFO ] Deduced a trap composed of 11 places in 104 ms
[2020-06-03 06:23:00] [INFO ] Deduced a trap composed of 15 places in 101 ms
[2020-06-03 06:23:01] [INFO ] Deduced a trap composed of 14 places in 89 ms
[2020-06-03 06:23:01] [INFO ] Deduced a trap composed of 15 places in 140 ms
[2020-06-03 06:23:01] [INFO ] Deduced a trap composed of 17 places in 394 ms
[2020-06-03 06:23:01] [INFO ] Deduced a trap composed of 15 places in 84 ms
[2020-06-03 06:23:01] [INFO ] Deduced a trap composed of 18 places in 83 ms
[2020-06-03 06:23:02] [INFO ] Deduced a trap composed of 24 places in 98 ms
[2020-06-03 06:23:02] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2020-06-03 06:23:02] [INFO ] Deduced a trap composed of 33 places in 74 ms
[2020-06-03 06:23:02] [INFO ] Deduced a trap composed of 34 places in 71 ms
[2020-06-03 06:23:02] [INFO ] Deduced a trap composed of 46 places in 70 ms
[2020-06-03 06:23:02] [INFO ] Deduced a trap composed of 43 places in 40 ms
[2020-06-03 06:23:03] [INFO ] Deduced a trap composed of 35 places in 685 ms
[2020-06-03 06:23:03] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2638 ms
[2020-06-03 06:23:03] [INFO ] Computed and/alt/rep : 569/2553/569 causal constraints in 67 ms.
[2020-06-03 06:23:04] [INFO ] Added : 160 causal constraints over 32 iterations in 1389 ms. Result :(error "Failed to check-sat")
[2020-06-03 06:23:04] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:23:04] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 25 ms returned sat
[2020-06-03 06:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:05] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2020-06-03 06:23:05] [INFO ] Deduced a trap composed of 137 places in 220 ms
[2020-06-03 06:23:06] [INFO ] Deduced a trap composed of 127 places in 236 ms
[2020-06-03 06:23:06] [INFO ] Deduced a trap composed of 16 places in 196 ms
[2020-06-03 06:23:06] [INFO ] Deduced a trap composed of 12 places in 196 ms
[2020-06-03 06:23:06] [INFO ] Deduced a trap composed of 8 places in 200 ms
[2020-06-03 06:23:06] [INFO ] Deduced a trap composed of 14 places in 200 ms
[2020-06-03 06:23:07] [INFO ] Deduced a trap composed of 23 places in 143 ms
[2020-06-03 06:23:07] [INFO ] Deduced a trap composed of 30 places in 183 ms
[2020-06-03 06:23:07] [INFO ] Deduced a trap composed of 29 places in 166 ms
[2020-06-03 06:23:07] [INFO ] Deduced a trap composed of 42 places in 182 ms
[2020-06-03 06:23:07] [INFO ] Deduced a trap composed of 46 places in 169 ms
[2020-06-03 06:23:08] [INFO ] Deduced a trap composed of 19 places in 207 ms
[2020-06-03 06:23:08] [INFO ] Deduced a trap composed of 46 places in 160 ms
[2020-06-03 06:23:08] [INFO ] Deduced a trap composed of 133 places in 195 ms
[2020-06-03 06:23:08] [INFO ] Deduced a trap composed of 22 places in 159 ms
[2020-06-03 06:23:09] [INFO ] Deduced a trap composed of 22 places in 178 ms
[2020-06-03 06:23:09] [INFO ] Deduced a trap composed of 36 places in 157 ms
[2020-06-03 06:23:09] [INFO ] Deduced a trap composed of 45 places in 185 ms
[2020-06-03 06:23:09] [INFO ] Deduced a trap composed of 24 places in 176 ms
[2020-06-03 06:23:09] [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 s12 s13 s14 s15 s16 s17 s18 s19 s111 s407 s408 s409) 0)") while checking expression at index 7
[2020-06-03 06:23:09] [INFO ] [Real]Absence check using 62 positive place invariants in 39 ms returned sat
[2020-06-03 06:23:09] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned unsat
[2020-06-03 06:23:09] [INFO ] [Real]Absence check using 62 positive place invariants in 40 ms returned sat
[2020-06-03 06:23:09] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 7 ms returned unsat
[2020-06-03 06:23:10] [INFO ] [Real]Absence check using 62 positive place invariants in 121 ms returned unsat
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 26 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.15 ms
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 624 transition count 469
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 201 place count 524 transition count 469
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 201 place count 524 transition count 347
Deduced a syphon composed of 122 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 460 place count 387 transition count 347
Symmetric choice reduction at 2 with 83 rule applications. Total rules 543 place count 387 transition count 347
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 83 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 709 place count 304 transition count 264
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 709 place count 304 transition count 255
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 730 place count 292 transition count 255
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 904 place count 205 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 905 place count 205 transition count 167
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 3 with 2 rules applied. Total rules applied 907 place count 204 transition count 171
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 912 place count 204 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 913 place count 203 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 914 place count 202 transition count 170
Applied a total of 914 rules in 145 ms. Remains 202 /630 variables (removed 428) and now considering 170/570 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/630 places, 170/570 transitions.
Incomplete random walk after 1000000 steps, including 74248 resets, run finished after 2083 ms. (steps per millisecond=480 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19104 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19196 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 19131 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19185 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 19140 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 170 rows 202 cols
[2020-06-03 06:23:16] [INFO ] Computed 76 place invariants in 3 ms
[2020-06-03 06:23:16] [INFO ] [Real]Absence check using 54 positive place invariants in 44 ms returned sat
[2020-06-03 06:23:16] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 16 ms returned sat
[2020-06-03 06:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:17] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-06-03 06:23:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 06:23:17] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2020-06-03 06:23:17] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-06-03 06:23:17] [INFO ] Deduced a trap composed of 10 places in 29 ms
[2020-06-03 06:23:17] [INFO ] Deduced a trap composed of 8 places in 32 ms
[2020-06-03 06:23:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 129 ms
[2020-06-03 06:23:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:23:17] [INFO ] [Nat]Absence check using 54 positive place invariants in 31 ms returned sat
[2020-06-03 06:23:17] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 8 ms returned sat
[2020-06-03 06:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:17] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-03 06:23:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2020-06-03 06:23:17] [INFO ] Computed and/alt/rep : 167/807/167 causal constraints in 12 ms.
[2020-06-03 06:23:17] [INFO ] Added : 85 causal constraints over 18 iterations in 355 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 06:23:18] [INFO ] [Real]Absence check using 54 positive place invariants in 48 ms returned sat
[2020-06-03 06:23:18] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 21 ms returned sat
[2020-06-03 06:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:18] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-06-03 06:23:18] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2020-06-03 06:23:18] [INFO ] Deduced a trap composed of 17 places in 30 ms
[2020-06-03 06:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2020-06-03 06:23:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:23:18] [INFO ] [Nat]Absence check using 54 positive place invariants in 16 ms returned sat
[2020-06-03 06:23:18] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 6 ms returned sat
[2020-06-03 06:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:18] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2020-06-03 06:23:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 19 ms returned sat
[2020-06-03 06:23:18] [INFO ] Deduced a trap composed of 41 places in 131 ms
[2020-06-03 06:23:18] [INFO ] Deduced a trap composed of 17 places in 16 ms
[2020-06-03 06:23:18] [INFO ] Deduced a trap composed of 40 places in 43 ms
[2020-06-03 06:23:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2020-06-03 06:23:18] [INFO ] Computed and/alt/rep : 167/807/167 causal constraints in 9 ms.
[2020-06-03 06:23:19] [INFO ] Added : 82 causal constraints over 18 iterations in 324 ms. Result :sat
[2020-06-03 06:23:19] [INFO ] Deduced a trap composed of 42 places in 84 ms
[2020-06-03 06:23:19] [INFO ] Deduced a trap composed of 43 places in 117 ms
[2020-06-03 06:23:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-06-03 06:23:19] [INFO ] [Real]Absence check using 54 positive place invariants in 23 ms returned sat
[2020-06-03 06:23:19] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 10 ms returned sat
[2020-06-03 06:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:19] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-06-03 06:23:19] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2020-06-03 06:23:19] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-06-03 06:23:19] [INFO ] Deduced a trap composed of 44 places in 46 ms
[2020-06-03 06:23:20] [INFO ] Deduced a trap composed of 43 places in 79 ms
[2020-06-03 06:23:20] [INFO ] Deduced a trap composed of 44 places in 59 ms
[2020-06-03 06:23:20] [INFO ] Deduced a trap composed of 42 places in 235 ms
[2020-06-03 06:23:20] [INFO ] Deduced a trap composed of 44 places in 191 ms
[2020-06-03 06:23:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 792 ms
[2020-06-03 06:23:20] [INFO ] [Real]Absence check using 54 positive place invariants in 33 ms returned sat
[2020-06-03 06:23:20] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 6 ms returned sat
[2020-06-03 06:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:20] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2020-06-03 06:23:20] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2020-06-03 06:23:20] [INFO ] Deduced a trap composed of 46 places in 105 ms
[2020-06-03 06:23:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2020-06-03 06:23:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:23:21] [INFO ] [Nat]Absence check using 54 positive place invariants in 84 ms returned sat
[2020-06-03 06:23:21] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 9 ms returned sat
[2020-06-03 06:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:21] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2020-06-03 06:23:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 33 ms returned sat
[2020-06-03 06:23:21] [INFO ] Deduced a trap composed of 42 places in 112 ms
[2020-06-03 06:23:21] [INFO ] Deduced a trap composed of 8 places in 46 ms
[2020-06-03 06:23:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2020-06-03 06:23:21] [INFO ] Computed and/alt/rep : 167/807/167 causal constraints in 7 ms.
[2020-06-03 06:23:21] [INFO ] Added : 98 causal constraints over 21 iterations in 447 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 06:23:22] [INFO ] [Real]Absence check using 54 positive place invariants in 148 ms returned sat
[2020-06-03 06:23:22] [INFO ] [Real]Absence check using 54 positive and 22 generalized place invariants in 21 ms returned sat
[2020-06-03 06:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:23] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2020-06-03 06:23:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:23:23] [INFO ] [Nat]Absence check using 54 positive place invariants in 322 ms returned sat
[2020-06-03 06:23:23] [INFO ] [Nat]Absence check using 54 positive and 22 generalized place invariants in 20 ms returned sat
[2020-06-03 06:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:23:23] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2020-06-03 06:23:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 45 ms returned sat
[2020-06-03 06:23:23] [INFO ] Deduced a trap composed of 10 places in 30 ms
[2020-06-03 06:23:23] [INFO ] Deduced a trap composed of 17 places in 16 ms
[2020-06-03 06:23:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2020-06-03 06:23:23] [INFO ] Computed and/alt/rep : 167/807/167 causal constraints in 11 ms.
[2020-06-03 06:23:24] [INFO ] Added : 78 causal constraints over 17 iterations in 432 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 8400 steps, including 132 resets, run finished after 19 ms. (steps per millisecond=442 ) properties seen :[0, 0, 1, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14600 steps, including 959 resets, run finished after 31 ms. (steps per millisecond=470 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 9200 steps, including 601 resets, run finished after 22 ms. (steps per millisecond=418 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 10200 steps, including 682 resets, run finished after 23 ms. (steps per millisecond=443 ) properties seen :[0, 0] could not realise parikh vector
Support contains 8 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 170/170 transitions.
Graph (trivial) has 22 edges and 202 vertex of which 2 / 202 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 201 transition count 164
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 197 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 197 transition count 162
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 195 transition count 162
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 195 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 193 transition count 160
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 49 place count 178 transition count 147
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 178 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 176 transition count 145
Applied a total of 53 rules in 27 ms. Remains 176 /202 variables (removed 26) and now considering 145/170 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/202 places, 145/170 transitions.
Finished random walk after 43861 steps, including 1579 resets, run visited all 2 properties in 115 ms. (steps per millisecond=381 )
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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-16"
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-16, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914100575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;