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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.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 3.0K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 161K 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-17-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591165923316

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:32:05] [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:32:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:32:05] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2020-06-03 06:32:05] [INFO ] Transformed 650 places.
[2020-06-03 06:32:05] [INFO ] Transformed 580 transitions.
[2020-06-03 06:32:05] [INFO ] Found NUPN structural information;
[2020-06-03 06:32:05] [INFO ] Parsed PT model containing 650 places and 580 transitions in 186 ms.
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 66 resets, run finished after 74 ms. (steps per millisecond=135 ) properties seen :[0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-03 TRUE 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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 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 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 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 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 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 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 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 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 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 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 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 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 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 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 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 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 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 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 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, 0, 1, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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, 0, 0, 0, 0]
// Phase 1: matrix 576 rows 646 cols
[2020-06-03 06:32:05] [INFO ] Computed 108 place invariants in 31 ms
[2020-06-03 06:32:06] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2020-06-03 06:32:06] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 28 ms returned sat
[2020-06-03 06:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:07] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2020-06-03 06:32:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:32:07] [INFO ] [Nat]Absence check using 62 positive place invariants in 60 ms returned sat
[2020-06-03 06:32:07] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 25 ms returned sat
[2020-06-03 06:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:08] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 30 places in 259 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 22 places in 216 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 20 places in 225 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 117 places in 163 ms
[2020-06-03 06:32:09] [INFO ] Deduced a trap composed of 16 places in 166 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 135 places in 170 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 22 places in 168 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 13 places in 176 ms
[2020-06-03 06:32:10] [INFO ] Deduced a trap composed of 20 places in 206 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 11 places in 180 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 29 places in 340 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 26 places in 156 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 27 places in 103 ms
[2020-06-03 06:32:11] [INFO ] Deduced a trap composed of 43 places in 102 ms
[2020-06-03 06:32:12] [INFO ] Deduced a trap composed of 26 places in 165 ms
[2020-06-03 06:32:12] [INFO ] Deduced a trap composed of 46 places in 158 ms
[2020-06-03 06:32:12] [INFO ] Deduced a trap composed of 25 places in 165 ms
[2020-06-03 06:32:12] [INFO ] Deduced a trap composed of 26 places in 155 ms
[2020-06-03 06:32:12] [INFO ] Deduced a trap composed of 24 places in 170 ms
[2020-06-03 06:32:12] [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 s214 s215 s216 s223 s296 s297 s298 s416 s421 s479 s480 s481 s585 s586) 0)") while checking expression at index 0
[2020-06-03 06:32:13] [INFO ] [Real]Absence check using 62 positive place invariants in 69 ms returned sat
[2020-06-03 06:32:13] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 46 ms returned sat
[2020-06-03 06:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:14] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2020-06-03 06:32:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:32:14] [INFO ] [Nat]Absence check using 62 positive place invariants in 57 ms returned sat
[2020-06-03 06:32:14] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2020-06-03 06:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:15] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 14 places in 202 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 15 places in 164 ms
[2020-06-03 06:32:15] [INFO ] Deduced a trap composed of 11 places in 167 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 26 places in 161 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 21 places in 179 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 26 places in 164 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 12 places in 168 ms
[2020-06-03 06:32:16] [INFO ] Deduced a trap composed of 20 places in 163 ms
[2020-06-03 06:32:17] [INFO ] Deduced a trap composed of 11 places in 160 ms
[2020-06-03 06:32:17] [INFO ] Deduced a trap composed of 17 places in 171 ms
[2020-06-03 06:32:17] [INFO ] Deduced a trap composed of 122 places in 187 ms
[2020-06-03 06:32:17] [INFO ] Deduced a trap composed of 28 places in 265 ms
[2020-06-03 06:32:17] [INFO ] Deduced a trap composed of 32 places in 99 ms
[2020-06-03 06:32:18] [INFO ] Deduced a trap composed of 26 places in 117 ms
[2020-06-03 06:32:18] [INFO ] Deduced a trap composed of 16 places in 104 ms
[2020-06-03 06:32:18] [INFO ] Deduced a trap composed of 29 places in 121 ms
[2020-06-03 06:32:18] [INFO ] Deduced a trap composed of 17 places in 133 ms
[2020-06-03 06:32:18] [INFO ] Deduced a trap composed of 31 places in 102 ms
[2020-06-03 06:32:18] [INFO ] Deduced a trap composed of 124 places in 162 ms
[2020-06-03 06:32:19] [INFO ] Deduced a trap composed of 127 places in 177 ms
[2020-06-03 06:32:19] [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 s46 s47 s48 s65 s66 s71 s72 s75 s76 s143 s144 s145 s220 s221 s222 s226 s227 s228 s238 s239 s240 s263 s296 s297 s298 s301 s303 s312 s317 s321 s322 s323 s326 s331 s350 s351 s352 s355 s356 s357 s360 s361 s362 s366 s376 s385 s386 s387 s396 s415 s417 s421 s426 s431 s441 s446 s454 s456 s457 s458 s460 s461 s462 s463 s464 s465 s466 s469 s470 s471 s472 s482 s483 s486 s487 s488 s489 s492 s493 s496 s497 s498 s501 s502 s507 s508 s509 s510 s511 s512 s542 s543 s546 s547 s548 s549 s552 s553 s556 s557 s558 s559 s562 s563 s566 s567 s568 s569 s570 s571 s575 s576 s577 s578 s589 s590 s591 s592 s599 s600 s601 s602 s603 s604 s607) 0)") while checking expression at index 1
[2020-06-03 06:32:19] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2020-06-03 06:32:19] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 25 ms returned sat
[2020-06-03 06:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:20] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2020-06-03 06:32:20] [INFO ] Deduced a trap composed of 20 places in 158 ms
[2020-06-03 06:32:20] [INFO ] Deduced a trap composed of 11 places in 183 ms
[2020-06-03 06:32:20] [INFO ] Deduced a trap composed of 10 places in 197 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 21 places in 146 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 11 places in 146 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 28 places in 156 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 8 places in 182 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 36 places in 145 ms
[2020-06-03 06:32:21] [INFO ] Deduced a trap composed of 19 places in 146 ms
[2020-06-03 06:32:22] [INFO ] Deduced a trap composed of 17 places in 92 ms
[2020-06-03 06:32:22] [INFO ] Deduced a trap composed of 11 places in 229 ms
[2020-06-03 06:32:22] [INFO ] Deduced a trap composed of 27 places in 232 ms
[2020-06-03 06:32:22] [INFO ] Deduced a trap composed of 26 places in 229 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 23 places in 215 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 29 places in 217 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 28 places in 200 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 26 places in 203 ms
[2020-06-03 06:32:23] [INFO ] Deduced a trap composed of 21 places in 99 ms
[2020-06-03 06:32:24] [INFO ] Deduced a trap composed of 32 places in 211 ms
[2020-06-03 06:32:24] [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 s220 s221 s222 s246 s247 s251 s252 s253 s259 s262 s316 s317 s318 s426 s431 s436 s441 s446 s451 s456 s492 s493 s496 s497 s498 s589 s590 s593 s594) 0)") while checking expression at index 2
[2020-06-03 06:32:24] [INFO ] [Real]Absence check using 62 positive place invariants in 37 ms returned sat
[2020-06-03 06:32:24] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned unsat
[2020-06-03 06:32:24] [INFO ] [Real]Absence check using 62 positive place invariants in 40 ms returned sat
[2020-06-03 06:32:24] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 31 ms returned sat
[2020-06-03 06:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:25] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2020-06-03 06:32:25] [INFO ] Deduced a trap composed of 19 places in 177 ms
[2020-06-03 06:32:25] [INFO ] Deduced a trap composed of 11 places in 371 ms
[2020-06-03 06:32:26] [INFO ] Deduced a trap composed of 20 places in 288 ms
[2020-06-03 06:32:26] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2020-06-03 06:32:26] [INFO ] Deduced a trap composed of 16 places in 364 ms
[2020-06-03 06:32:27] [INFO ] Deduced a trap composed of 146 places in 366 ms
[2020-06-03 06:32:27] [INFO ] Deduced a trap composed of 120 places in 366 ms
[2020-06-03 06:32:27] [INFO ] Deduced a trap composed of 21 places in 230 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 127 places in 156 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 12 places in 174 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 14 places in 159 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 24 places in 158 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 42 places in 163 ms
[2020-06-03 06:32:28] [INFO ] Deduced a trap composed of 121 places in 167 ms
[2020-06-03 06:32:29] [INFO ] Deduced a trap composed of 37 places in 352 ms
[2020-06-03 06:32: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 s3 s4 s5 s6 s7 s8 s9 s168 s171 s172 s182 s183 s184 s223 s226 s227 s228 s297 s380 s381 s382 s386 s401 s416 s421 s479 s480 s481 s573 s574 s577 s578 s636 s637) 0)") while checking expression at index 4
[2020-06-03 06:32:29] [INFO ] [Real]Absence check using 62 positive place invariants in 71 ms returned sat
[2020-06-03 06:32:29] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 46 ms returned sat
[2020-06-03 06:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:31] [INFO ] [Real]Absence check using state equation in 1861 ms returned sat
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 18 places in 189 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 8 places in 93 ms
[2020-06-03 06:32:31] [INFO ] Deduced a trap composed of 15 places in 91 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 11 places in 89 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 28 places in 89 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 39 places in 87 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 21 places in 95 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 36 places in 99 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 21 places in 83 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 53 places in 134 ms
[2020-06-03 06:32:32] [INFO ] Deduced a trap composed of 22 places in 81 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 19 places in 96 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 22 places in 403 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 36 places in 137 ms
[2020-06-03 06:32:33] [INFO ] Deduced a trap composed of 48 places in 81 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 23 places in 68 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 26 places in 70 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 37 places in 61 ms
[2020-06-03 06:32:34] [INFO ] Deduced a trap composed of 34 places in 73 ms
[2020-06-03 06:32:34] [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 s20 s21 s22 s23 s24 s25 s26 s27 s43 s301 s302 s303 s490 s491) 0)") while checking expression at index 5
[2020-06-03 06:32:34] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2020-06-03 06:32:34] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned unsat
[2020-06-03 06:32:34] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned unsat
[2020-06-03 06:32:34] [INFO ] [Real]Absence check using 62 positive place invariants in 48 ms returned sat
[2020-06-03 06:32:34] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 35 ms returned sat
[2020-06-03 06:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:35] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 11 places in 171 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 14 places in 194 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 8 places in 156 ms
[2020-06-03 06:32:36] [INFO ] Deduced a trap composed of 124 places in 386 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 11 places in 335 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 40 places in 170 ms
[2020-06-03 06:32:37] [INFO ] Deduced a trap composed of 24 places in 356 ms
[2020-06-03 06:32:38] [INFO ] Deduced a trap composed of 21 places in 380 ms
[2020-06-03 06:32:38] [INFO ] Deduced a trap composed of 17 places in 374 ms
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 23 places in 336 ms
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 28 places in 340 ms
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 22 places in 209 ms
[2020-06-03 06:32:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:32:39] [INFO ] Deduced a trap composed of 6 places in 261 ms
[2020-06-03 06:32:39] [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 s254) 0)") while checking expression at index 8
[2020-06-03 06:32:39] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2020-06-03 06:32:39] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-06-03 06:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:40] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2020-06-03 06:32:40] [INFO ] Deduced a trap composed of 16 places in 225 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 11 places in 168 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 17 places in 162 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 122 places in 167 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 23 places in 162 ms
[2020-06-03 06:32:41] [INFO ] Deduced a trap composed of 29 places in 152 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 27 places in 223 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 27 places in 161 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 18 places in 160 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 17 places in 163 ms
[2020-06-03 06:32:42] [INFO ] Deduced a trap composed of 23 places in 146 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 32 places in 162 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 135 places in 145 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 71 places in 278 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 52 places in 150 ms
[2020-06-03 06:32:43] [INFO ] Deduced a trap composed of 157 places in 152 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 54 places in 202 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 147 places in 147 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 163 places in 141 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 157 places in 136 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 141 places in 136 ms
[2020-06-03 06:32:44] [INFO ] Deduced a trap composed of 32 places in 141 ms
[2020-06-03 06:32: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 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s43 s306 s307 s308) 0)") while checking expression at index 9
[2020-06-03 06:32:45] [INFO ] [Real]Absence check using 62 positive place invariants in 39 ms returned sat
[2020-06-03 06:32:45] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 27 ms returned sat
[2020-06-03 06:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:46] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 12 places in 88 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 15 places in 85 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 20 places in 107 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-06-03 06:32:46] [INFO ] Deduced a trap composed of 8 places in 96 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 34 places in 92 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 46 places in 79 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 30 places in 78 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 67 places in 78 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 66 places in 88 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 38 places in 129 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 92 places in 106 ms
[2020-06-03 06:32:47] [INFO ] Deduced a trap composed of 32 places in 36 ms
[2020-06-03 06:32:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1831 ms
[2020-06-03 06:32:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:32:48] [INFO ] [Nat]Absence check using 62 positive place invariants in 49 ms returned sat
[2020-06-03 06:32:48] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2020-06-03 06:32:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:32:49] [INFO ] [Nat]Absence check using state equation in 1127 ms returned sat
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 12 places in 104 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 19 places in 136 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 31 places in 99 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2020-06-03 06:32:49] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 23 places in 98 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 20 places in 87 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 28 places in 99 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 26 places in 79 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 38 places in 77 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 15 places in 76 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 46 places in 77 ms
[2020-06-03 06:32:50] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 21 places in 77 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 26 places in 99 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 15 places in 97 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 45 places in 78 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 39 places in 79 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 44 places in 77 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 38 places in 97 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 58 places in 96 ms
[2020-06-03 06:32:51] [INFO ] Deduced a trap composed of 31 places in 73 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 44 places in 68 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 22 places in 105 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 52 places in 99 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 29 places in 88 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 20 places in 70 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 33 places in 82 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 49 places in 84 ms
[2020-06-03 06:32:52] [INFO ] Deduced a trap composed of 18 places in 68 ms
[2020-06-03 06:32:53] [INFO ] Deduced a trap composed of 48 places in 70 ms
[2020-06-03 06:32:53] [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 s34 s35 s50 s51 s54 s199 s200 s201 s205 s226 s227 s228 s232 s233 s234 s238 s239 s240 s246 s247 s251 s252 s253 s259 s262 s297 s317 s395 s396 s397 s406 s416 s421 s426 s435 s436 s437 s441 s446 s451 s456 s566 s567 s577 s578) 0)") while checking expression at index 10
[2020-06-03 06:32:53] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned unsat
[2020-06-03 06:32:53] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2020-06-03 06:32:53] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned unsat
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 52 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.15 ms
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 642 transition count 484
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 183 place count 551 transition count 484
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 183 place count 551 transition count 361
Deduced a syphon composed of 123 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 444 place count 413 transition count 361
Symmetric choice reduction at 2 with 71 rule applications. Total rules 515 place count 413 transition count 361
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 71 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 657 place count 342 transition count 290
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 657 place count 342 transition count 286
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 666 place count 337 transition count 286
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 851 place count 243 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 852 place count 243 transition count 194
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 854 place count 242 transition count 198
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 858 place count 242 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 859 place count 241 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 860 place count 240 transition count 197
Applied a total of 860 rules in 142 ms. Remains 240 /646 variables (removed 406) and now considering 197/576 (removed 379) transitions.
Finished structural reductions, in 1 iterations. Remains : 240/646 places, 197/576 transitions.
Incomplete random walk after 1000000 steps, including 34375 resets, run finished after 2007 ms. (steps per millisecond=498 ) properties seen :[1, 0, 0, 1, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 7753 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7563 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6990 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties seen :[0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 7466 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4940 resets, run finished after 908 ms. (steps per millisecond=1101 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 197 rows 240 cols
[2020-06-03 06:32:59] [INFO ] Computed 85 place invariants in 3 ms
[2020-06-03 06:33:00] [INFO ] [Real]Absence check using 59 positive place invariants in 47 ms returned sat
[2020-06-03 06:33:00] [INFO ] [Real]Absence check using 59 positive and 26 generalized place invariants in 24 ms returned sat
[2020-06-03 06:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:00] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-06-03 06:33:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-03 06:33:00] [INFO ] [Real]Added 4 Read/Feed constraints in 14 ms returned sat
[2020-06-03 06:33:00] [INFO ] Deduced a trap composed of 5 places in 42 ms
[2020-06-03 06:33:00] [INFO ] Deduced a trap composed of 17 places in 58 ms
[2020-06-03 06:33:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2020-06-03 06:33:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:00] [INFO ] [Nat]Absence check using 59 positive place invariants in 21 ms returned sat
[2020-06-03 06:33:00] [INFO ] [Nat]Absence check using 59 positive and 26 generalized place invariants in 11 ms returned sat
[2020-06-03 06:33:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:00] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2020-06-03 06:33:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 10 ms returned sat
[2020-06-03 06:33:00] [INFO ] Computed and/alt/rep : 194/1038/194 causal constraints in 10 ms.
[2020-06-03 06:33:01] [INFO ] Added : 89 causal constraints over 18 iterations in 427 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 06:33:01] [INFO ] [Real]Absence check using 59 positive place invariants in 18 ms returned sat
[2020-06-03 06:33:01] [INFO ] [Real]Absence check using 59 positive and 26 generalized place invariants in 18 ms returned sat
[2020-06-03 06:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:01] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-06-03 06:33:01] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 5 places in 99 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 49 places in 54 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 54 places in 53 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 15 places in 37 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 50 places in 50 ms
[2020-06-03 06:33:01] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2020-06-03 06:33:02] [INFO ] Deduced a trap composed of 54 places in 56 ms
[2020-06-03 06:33:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 620 ms
[2020-06-03 06:33:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:02] [INFO ] [Nat]Absence check using 59 positive place invariants in 19 ms returned sat
[2020-06-03 06:33:02] [INFO ] [Nat]Absence check using 59 positive and 26 generalized place invariants in 11 ms returned sat
[2020-06-03 06:33:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:02] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2020-06-03 06:33:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 35 ms returned sat
[2020-06-03 06:33:02] [INFO ] Computed and/alt/rep : 194/1038/194 causal constraints in 10 ms.
[2020-06-03 06:33:02] [INFO ] Added : 80 causal constraints over 17 iterations in 336 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-06-03 06:33:02] [INFO ] [Real]Absence check using 59 positive place invariants in 16 ms returned sat
[2020-06-03 06:33:02] [INFO ] [Real]Absence check using 59 positive and 26 generalized place invariants in 8 ms returned sat
[2020-06-03 06:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:02] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-06-03 06:33:02] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 51 places in 337 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 48 places in 91 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 48 places in 70 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 7 places in 61 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 50 places in 63 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 49 places in 64 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 48 places in 64 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 48 places in 64 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 48 places in 63 ms
[2020-06-03 06:33:03] [INFO ] Deduced a trap composed of 49 places in 60 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 51 places in 60 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 48 places in 57 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 15 places in 56 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 16 places in 48 ms
[2020-06-03 06:33:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1302 ms
[2020-06-03 06:33:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:04] [INFO ] [Nat]Absence check using 59 positive place invariants in 18 ms returned sat
[2020-06-03 06:33:04] [INFO ] [Nat]Absence check using 59 positive and 26 generalized place invariants in 12 ms returned sat
[2020-06-03 06:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:04] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2020-06-03 06:33:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 38 ms returned sat
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 52 places in 87 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 50 places in 43 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 52 places in 69 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 55 places in 64 ms
[2020-06-03 06:33:04] [INFO ] Deduced a trap composed of 54 places in 87 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 54 places in 58 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 49 places in 58 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 52 places in 47 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 50 places in 42 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 52 places in 45 ms
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 54 places in 43 ms
[2020-06-03 06:33:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 889 ms
[2020-06-03 06:33:05] [INFO ] Computed and/alt/rep : 194/1038/194 causal constraints in 12 ms.
[2020-06-03 06:33:05] [INFO ] Added : 94 causal constraints over 20 iterations in 507 ms. Result :sat
[2020-06-03 06:33:05] [INFO ] Deduced a trap composed of 55 places in 43 ms
[2020-06-03 06:33:06] [INFO ] Deduced a trap composed of 55 places in 41 ms
[2020-06-03 06:33:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2020-06-03 06:33:06] [INFO ] [Real]Absence check using 59 positive place invariants in 18 ms returned sat
[2020-06-03 06:33:06] [INFO ] [Real]Absence check using 59 positive and 26 generalized place invariants in 12 ms returned sat
[2020-06-03 06:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:06] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-06-03 06:33:06] [INFO ] [Real]Added 4 Read/Feed constraints in 5 ms returned sat
[2020-06-03 06:33:06] [INFO ] Computed and/alt/rep : 194/1038/194 causal constraints in 8 ms.
[2020-06-03 06:33:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:06] [INFO ] [Nat]Absence check using 59 positive place invariants in 19 ms returned sat
[2020-06-03 06:33:06] [INFO ] [Nat]Absence check using 59 positive and 26 generalized place invariants in 25 ms returned sat
[2020-06-03 06:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:06] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-06-03 06:33:06] [INFO ] [Nat]Added 4 Read/Feed constraints in 22 ms returned sat
[2020-06-03 06:33:06] [INFO ] Computed and/alt/rep : 194/1038/194 causal constraints in 9 ms.
[2020-06-03 06:33:07] [INFO ] Added : 86 causal constraints over 18 iterations in 374 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 15000 steps, including 463 resets, run finished after 37 ms. (steps per millisecond=405 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 7700 steps, including 299 resets, run finished after 18 ms. (steps per millisecond=427 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 6900 steps, including 106 resets, run finished after 17 ms. (steps per millisecond=405 ) properties seen :[0, 1, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 8800 steps, including 363 resets, run finished after 20 ms. (steps per millisecond=440 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 18 out of 240 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 240/240 places, 197/197 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 240 transition count 191
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 234 transition count 191
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 12 place count 234 transition count 180
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 219 transition count 180
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 219 transition count 180
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 217 transition count 178
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 79 place count 199 transition count 161
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 199 transition count 161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 198 transition count 160
Applied a total of 81 rules in 24 ms. Remains 198 /240 variables (removed 42) and now considering 160/197 (removed 37) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/240 places, 160/197 transitions.
Incomplete random walk after 1000000 steps, including 60936 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 14507 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 13922 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10490 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties seen :[0, 0, 0]
Finished probabilistic random walk after 11466 steps, run visited all 3 properties in 29 ms. (steps per millisecond=395 )
Probabilistic random walk after 11466 steps, saw 3432 distinct states, run finished after 29 ms. (steps per millisecond=395 ) properties seen :[1, 1, 1]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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-17"
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-17, 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-158987914100583"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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