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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.1K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 157K 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-15-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591164638013

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:10:41] [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:10:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:10:41] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2020-06-03 06:10:41] [INFO ] Transformed 630 places.
[2020-06-03 06:10:41] [INFO ] Transformed 566 transitions.
[2020-06-03 06:10:41] [INFO ] Found NUPN structural information;
[2020-06-03 06:10:41] [INFO ] Parsed PT model containing 630 places and 566 transitions in 143 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 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 67 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 1, 0]
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
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]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 562 rows 626 cols
[2020-06-03 06:10:41] [INFO ] Computed 102 place invariants in 40 ms
[2020-06-03 06:10:42] [INFO ] [Real]Absence check using 61 positive place invariants in 110 ms returned sat
[2020-06-03 06:10:42] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 11 ms returned unsat
[2020-06-03 06:10:42] [INFO ] [Real]Absence check using 61 positive place invariants in 48 ms returned sat
[2020-06-03 06:10:42] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 26 ms returned sat
[2020-06-03 06:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:43] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2020-06-03 06:10:44] [INFO ] Deduced a trap composed of 14 places in 585 ms
[2020-06-03 06:10:44] [INFO ] Deduced a trap composed of 11 places in 251 ms
[2020-06-03 06:10:44] [INFO ] Deduced a trap composed of 22 places in 346 ms
[2020-06-03 06:10:45] [INFO ] Deduced a trap composed of 15 places in 541 ms
[2020-06-03 06:10:45] [INFO ] Deduced a trap composed of 24 places in 201 ms
[2020-06-03 06:10:45] [INFO ] Deduced a trap composed of 12 places in 312 ms
[2020-06-03 06:10:46] [INFO ] Deduced a trap composed of 109 places in 265 ms
[2020-06-03 06:10:46] [INFO ] Deduced a trap composed of 12 places in 196 ms
[2020-06-03 06:10:46] [INFO ] Deduced a trap composed of 17 places in 231 ms
[2020-06-03 06:10:47] [INFO ] Deduced a trap composed of 123 places in 329 ms
[2020-06-03 06:10:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:10:47] [INFO ] Deduced a trap composed of 6 places in 366 ms
[2020-06-03 06:10: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 s246) 0)") while checking expression at index 1
[2020-06-03 06:10:47] [INFO ] [Real]Absence check using 61 positive place invariants in 55 ms returned sat
[2020-06-03 06:10:47] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 26 ms returned sat
[2020-06-03 06:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:48] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2020-06-03 06:10:48] [INFO ] Deduced a trap composed of 12 places in 231 ms
[2020-06-03 06:10:49] [INFO ] Deduced a trap composed of 8 places in 242 ms
[2020-06-03 06:10:49] [INFO ] Deduced a trap composed of 22 places in 204 ms
[2020-06-03 06:10:49] [INFO ] Deduced a trap composed of 20 places in 197 ms
[2020-06-03 06:10:49] [INFO ] Deduced a trap composed of 29 places in 205 ms
[2020-06-03 06:10:49] [INFO ] Deduced a trap composed of 21 places in 193 ms
[2020-06-03 06:10:50] [INFO ] Deduced a trap composed of 119 places in 186 ms
[2020-06-03 06:10:50] [INFO ] Deduced a trap composed of 23 places in 180 ms
[2020-06-03 06:10:50] [INFO ] Deduced a trap composed of 29 places in 190 ms
[2020-06-03 06:10:50] [INFO ] Deduced a trap composed of 16 places in 175 ms
[2020-06-03 06:10:50] [INFO ] Deduced a trap composed of 20 places in 167 ms
[2020-06-03 06:10:51] [INFO ] Deduced a trap composed of 112 places in 173 ms
[2020-06-03 06:10:51] [INFO ] Deduced a trap composed of 119 places in 170 ms
[2020-06-03 06:10:51] [INFO ] Deduced a trap composed of 29 places in 174 ms
[2020-06-03 06:10:51] [INFO ] Deduced a trap composed of 33 places in 168 ms
[2020-06-03 06:10:52] [INFO ] Deduced a trap composed of 17 places in 186 ms
[2020-06-03 06:10:52] [INFO ] Deduced a trap composed of 19 places in 168 ms
[2020-06-03 06:10:52] [INFO ] Deduced a trap composed of 24 places in 181 ms
[2020-06-03 06:10:52] [INFO ] Deduced a trap composed of 25 places in 196 ms
[2020-06-03 06:10:52] [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 s54 s55 s238 s239 s255 s256 s317 s318 s319 s417 s422 s427 s431 s432 s433 s435 s437 s438 s439 s565 s566 s577 s578) 0)") while checking expression at index 2
[2020-06-03 06:10:52] [INFO ] [Real]Absence check using 61 positive place invariants in 41 ms returned sat
[2020-06-03 06:10:52] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 8 ms returned unsat
[2020-06-03 06:10:52] [INFO ] [Real]Absence check using 61 positive place invariants in 40 ms returned sat
[2020-06-03 06:10:52] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 30 ms returned sat
[2020-06-03 06:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:53] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2020-06-03 06:10:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:10:54] [INFO ] [Nat]Absence check using 61 positive place invariants in 53 ms returned sat
[2020-06-03 06:10:54] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 30 ms returned sat
[2020-06-03 06:10:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:54] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2020-06-03 06:10:55] [INFO ] Deduced a trap composed of 22 places in 104 ms
[2020-06-03 06:10:55] [INFO ] Deduced a trap composed of 16 places in 99 ms
[2020-06-03 06:10:55] [INFO ] Deduced a trap composed of 12 places in 102 ms
[2020-06-03 06:10:55] [INFO ] Deduced a trap composed of 21 places in 99 ms
[2020-06-03 06:10:55] [INFO ] Deduced a trap composed of 25 places in 96 ms
[2020-06-03 06:10:55] [INFO ] Deduced a trap composed of 25 places in 96 ms
[2020-06-03 06:10:55] [INFO ] Deduced a trap composed of 32 places in 99 ms
[2020-06-03 06:10:55] [INFO ] Deduced a trap composed of 21 places in 96 ms
[2020-06-03 06:10:56] [INFO ] Deduced a trap composed of 48 places in 98 ms
[2020-06-03 06:10:56] [INFO ] Deduced a trap composed of 53 places in 104 ms
[2020-06-03 06:10:56] [INFO ] Deduced a trap composed of 34 places in 123 ms
[2020-06-03 06:10:56] [INFO ] Deduced a trap composed of 27 places in 451 ms
[2020-06-03 06:10:57] [INFO ] Deduced a trap composed of 18 places in 202 ms
[2020-06-03 06:10:57] [INFO ] Deduced a trap composed of 13 places in 182 ms
[2020-06-03 06:10:57] [INFO ] Deduced a trap composed of 38 places in 520 ms
[2020-06-03 06:10:57] [INFO ] Deduced a trap composed of 31 places in 111 ms
[2020-06-03 06:10:58] [INFO ] Deduced a trap composed of 16 places in 116 ms
[2020-06-03 06:10:58] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3167 ms
[2020-06-03 06:10:58] [INFO ] Computed and/alt/rep : 561/2502/561 causal constraints in 75 ms.
[2020-06-03 06:10:58] [INFO ] Added : 75 causal constraints over 15 iterations in 729 ms. Result :(error "Failed to check-sat")
[2020-06-03 06:10:58] [INFO ] [Real]Absence check using 61 positive place invariants in 40 ms returned sat
[2020-06-03 06:10:59] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2020-06-03 06:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:10:59] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2020-06-03 06:11:00] [INFO ] Deduced a trap composed of 11 places in 213 ms
[2020-06-03 06:11:00] [INFO ] Deduced a trap composed of 16 places in 201 ms
[2020-06-03 06:11:00] [INFO ] Deduced a trap composed of 8 places in 206 ms
[2020-06-03 06:11:00] [INFO ] Deduced a trap composed of 18 places in 211 ms
[2020-06-03 06:11:00] [INFO ] Deduced a trap composed of 27 places in 209 ms
[2020-06-03 06:11:01] [INFO ] Deduced a trap composed of 17 places in 206 ms
[2020-06-03 06:11:01] [INFO ] Deduced a trap composed of 13 places in 171 ms
[2020-06-03 06:11:01] [INFO ] Deduced a trap composed of 24 places in 186 ms
[2020-06-03 06:11:01] [INFO ] Deduced a trap composed of 28 places in 175 ms
[2020-06-03 06:11:02] [INFO ] Deduced a trap composed of 19 places in 190 ms
[2020-06-03 06:11:02] [INFO ] Deduced a trap composed of 24 places in 175 ms
[2020-06-03 06:11:02] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-06-03 06:11:02] [INFO ] Deduced a trap composed of 63 places in 175 ms
[2020-06-03 06:11:02] [INFO ] Deduced a trap composed of 50 places in 161 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 46 places in 171 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 30 places in 83 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 33 places in 68 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 24 places in 66 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 23 places in 63 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 32 places in 76 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 29 places in 61 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 31 places in 63 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 28 places in 75 ms
[2020-06-03 06:11:03] [INFO ] Deduced a trap composed of 36 places in 60 ms
[2020-06-03 06:11:03] [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 s29 s32 s33 s238 s239 s251 s254 s303 s318 s407 s412 s426 s427 s428 s432 s437 s442 s461 s462 s465 s466 s467 s478 s479 s482 s561 s562 s569 s570 s573 s574 s587 s588) 0)") while checking expression at index 5
[2020-06-03 06:11:04] [INFO ] [Real]Absence check using 61 positive place invariants in 17 ms returned unsat
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 16 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1275 edges and 626 vertex of which 622 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 622 transition count 464
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 525 transition count 464
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 133 Pre rules applied. Total rules applied 195 place count 525 transition count 331
Deduced a syphon composed of 133 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 479 place count 374 transition count 331
Symmetric choice reduction at 2 with 81 rule applications. Total rules 560 place count 374 transition count 331
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 81 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 722 place count 293 transition count 250
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 722 place count 293 transition count 243
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 737 place count 285 transition count 243
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 923 place count 191 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 924 place count 191 transition count 150
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 925 place count 191 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 926 place count 190 transition count 149
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 931 place count 190 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 932 place count 189 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 933 place count 188 transition count 148
Applied a total of 933 rules in 168 ms. Remains 188 /626 variables (removed 438) and now considering 148/562 (removed 414) transitions.
Finished structural reductions, in 1 iterations. Remains : 188/626 places, 148/562 transitions.
Incomplete random walk after 1000000 steps, including 63114 resets, run finished after 2619 ms. (steps per millisecond=381 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16357 resets, run finished after 1307 ms. (steps per millisecond=765 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16389 resets, run finished after 970 ms. (steps per millisecond=1030 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16352 resets, run finished after 1046 ms. (steps per millisecond=956 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16377 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties seen :[0, 0, 0, 0]
Finished probabilistic random walk after 675 steps, run visited all 4 properties in 8 ms. (steps per millisecond=84 )
Probabilistic random walk after 675 steps, saw 237 distinct states, run finished after 8 ms. (steps per millisecond=84 ) properties seen :[1, 1, 1, 1]
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-04 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-15"
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-15, 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-158987914100567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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