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.r021-oct2-158897699200527.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 itstools
Input is BusinessProcesses-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200527
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1589252310107

[2020-05-12 02:58:32] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:58:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:58:32] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2020-05-12 02:58:32] [INFO ] Transformed 518 places.
[2020-05-12 02:58:32] [INFO ] Transformed 471 transitions.
[2020-05-12 02:58:32] [INFO ] Found NUPN structural information;
[2020-05-12 02:58:32] [INFO ] Parsed PT model containing 518 places and 471 transitions in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 471 rows 518 cols
[2020-05-12 02:58:33] [INFO ] Computed 85 place invariants in 23 ms
[2020-05-12 02:58:33] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2020-05-12 02:58:33] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 78 ms returned sat
[2020-05-12 02:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:58:34] [INFO ] [Real]Absence check using state equation in 841 ms returned unsat
[2020-05-12 02:58:34] [INFO ] [Real]Absence check using 48 positive place invariants in 34 ms returned sat
[2020-05-12 02:58:34] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 20 ms returned sat
[2020-05-12 02:58:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:58:35] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2020-05-12 02:58:35] [INFO ] Deduced a trap composed of 8 places in 155 ms
[2020-05-12 02:58:35] [INFO ] Deduced a trap composed of 22 places in 122 ms
[2020-05-12 02:58:35] [INFO ] Deduced a trap composed of 17 places in 139 ms
[2020-05-12 02:58:36] [INFO ] Deduced a trap composed of 18 places in 175 ms
[2020-05-12 02:58:36] [INFO ] Deduced a trap composed of 34 places in 216 ms
[2020-05-12 02:58:36] [INFO ] Deduced a trap composed of 24 places in 80 ms
[2020-05-12 02:58:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1122 ms
[2020-05-12 02:58:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:58:36] [INFO ] [Nat]Absence check using 48 positive place invariants in 69 ms returned sat
[2020-05-12 02:58:36] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 20 ms returned sat
[2020-05-12 02:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:58:37] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2020-05-12 02:58:37] [INFO ] Deduced a trap composed of 8 places in 189 ms
[2020-05-12 02:58:37] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-05-12 02:58:37] [INFO ] Deduced a trap composed of 136 places in 250 ms
[2020-05-12 02:58:38] [INFO ] Deduced a trap composed of 51 places in 306 ms
[2020-05-12 02:58:38] [INFO ] Deduced a trap composed of 15 places in 309 ms
[2020-05-12 02:58:38] [INFO ] Deduced a trap composed of 123 places in 332 ms
[2020-05-12 02:58:39] [INFO ] Deduced a trap composed of 128 places in 306 ms
[2020-05-12 02:58:39] [INFO ] Deduced a trap composed of 28 places in 319 ms
[2020-05-12 02:58:44] [INFO ] Deduced a trap composed of 42 places in 5011 ms
[2020-05-12 02:58: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 s70 s71 s72 s73 s74 s75 s76 s77 s152 s158 s164 s170 s174 s192 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s271 s274 s275 s342 s343 s344 s457 s503) 0)") while checking expression at index 1
[2020-05-12 02:58:44] [INFO ] [Real]Absence check using 48 positive place invariants in 37 ms returned unsat
[2020-05-12 02:58:44] [INFO ] [Real]Absence check using 48 positive place invariants in 287 ms returned sat
[2020-05-12 02:58:45] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 260 ms returned sat
[2020-05-12 02:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:58:45] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2020-05-12 02:58:48] [INFO ] Deduced a trap composed of 33 places in 3330 ms
[2020-05-12 02:58:49] [INFO ] Deduced a trap composed of 10 places in 255 ms
[2020-05-12 02:58:49] [INFO ] Deduced a trap composed of 30 places in 376 ms
[2020-05-12 02:58:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s98 s99 s100 s101 s102 s109 s110 s111 s112 s113 s337 s338 s339 s342 s343 s344 s371) 0)") while checking expression at index 3
[2020-05-12 02:58:49] [INFO ] [Real]Absence check using 48 positive place invariants in 25 ms returned unsat
[2020-05-12 02:58:49] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2020-05-12 02:58:50] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 115 ms returned sat
[2020-05-12 02:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:58:52] [INFO ] [Real]Absence check using state equation in 2287 ms returned sat
[2020-05-12 02:58:52] [INFO ] Deduced a trap composed of 8 places in 350 ms
[2020-05-12 02:58:53] [INFO ] Deduced a trap composed of 15 places in 339 ms
[2020-05-12 02:58:53] [INFO ] Deduced a trap composed of 24 places in 348 ms
[2020-05-12 02:58:54] [INFO ] Deduced a trap composed of 14 places in 703 ms
[2020-05-12 02:58:54] [INFO ] Deduced a trap composed of 24 places in 227 ms
[2020-05-12 02:58:55] [INFO ] Deduced a trap composed of 25 places in 863 ms
[2020-05-12 02:58:55] [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 s84 s282 s283 s284 s298 s424 s425 s432 s433 s480 s481) 0)") while checking expression at index 5
[2020-05-12 02:58:55] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2020-05-12 02:58:55] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 40 ms returned sat
[2020-05-12 02:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:58:56] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2020-05-12 02:58:56] [INFO ] Deduced a trap composed of 10 places in 365 ms
[2020-05-12 02:58:57] [INFO ] Deduced a trap composed of 18 places in 169 ms
[2020-05-12 02:58:57] [INFO ] Deduced a trap composed of 13 places in 169 ms
[2020-05-12 02:58:57] [INFO ] Deduced a trap composed of 32 places in 224 ms
[2020-05-12 02:58:57] [INFO ] Deduced a trap composed of 15 places in 154 ms
[2020-05-12 02:58:57] [INFO ] Deduced a trap composed of 22 places in 173 ms
[2020-05-12 02:58:58] [INFO ] Deduced a trap composed of 60 places in 207 ms
[2020-05-12 02:58:58] [INFO ] Deduced a trap composed of 25 places in 162 ms
[2020-05-12 02:58:58] [INFO ] Deduced a trap composed of 22 places in 224 ms
[2020-05-12 02:58:58] [INFO ] Deduced a trap composed of 40 places in 297 ms
[2020-05-12 02:58:59] [INFO ] Deduced a trap composed of 82 places in 255 ms
[2020-05-12 02:58:59] [INFO ] Deduced a trap composed of 67 places in 148 ms
[2020-05-12 02:58:59] [INFO ] Deduced a trap composed of 61 places in 354 ms
[2020-05-12 02:59:00] [INFO ] Deduced a trap composed of 85 places in 200 ms
[2020-05-12 02:59:00] [INFO ] Deduced a trap composed of 40 places in 458 ms
[2020-05-12 02:59:00] [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 s99 s100 s101 s102 s105 s106 s107 s108 s109 s110 s111 s112 s150 s152 s161 s165 s166 s167 s170 s174 s332 s333 s334 s343 s371 s457 s459 s461 s467 s471 s472 s500 s506 s512) 0)") while checking expression at index 6
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 24 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 271 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 510 transition count 358
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 218 place count 406 transition count 358
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 218 place count 406 transition count 284
Deduced a syphon composed of 74 places in 9 ms
Ensure Unique test removed 10 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 376 place count 322 transition count 284
Symmetric choice reduction at 2 with 62 rule applications. Total rules 438 place count 322 transition count 284
Deduced a syphon composed of 62 places in 14 ms
Reduce places removed 62 places and 62 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 562 place count 260 transition count 222
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 562 place count 260 transition count 216
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 575 place count 253 transition count 216
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 143 rules applied. Total rules applied 718 place count 181 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 720 place count 180 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 722 place count 180 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 724 place count 178 transition count 146
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 729 place count 178 transition count 146
Applied a total of 729 rules in 195 ms. Remains 178 /518 variables (removed 340) and now considering 146/471 (removed 325) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/518 places, 146/471 transitions.
Incomplete random walk after 1000000 steps, including 26993 resets, run finished after 1926 ms. (steps per millisecond=519 ) properties seen :[0, 1, 1, 1]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7282 resets, run finished after 1044 ms. (steps per millisecond=957 ) properties seen :[0]
// Phase 1: matrix 146 rows 178 cols
[2020-05-12 02:59:03] [INFO ] Computed 72 place invariants in 21 ms
[2020-05-12 02:59:03] [INFO ] [Real]Absence check using 45 positive place invariants in 42 ms returned sat
[2020-05-12 02:59:03] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 9 ms returned sat
[2020-05-12 02:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:59:03] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-05-12 02:59:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-05-12 02:59:04] [INFO ] [Real]Added 12 Read/Feed constraints in 7 ms returned sat
[2020-05-12 02:59:04] [INFO ] Deduced a trap composed of 39 places in 148 ms
[2020-05-12 02:59:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2020-05-12 02:59:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:59:04] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2020-05-12 02:59:04] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 10 ms returned sat
[2020-05-12 02:59:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:59:04] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2020-05-12 02:59:04] [INFO ] [Nat]Added 12 Read/Feed constraints in 19 ms returned sat
[2020-05-12 02:59:04] [INFO ] Deduced a trap composed of 38 places in 80 ms
[2020-05-12 02:59:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2020-05-12 02:59:04] [INFO ] Computed and/alt/rep : 144/1985/144 causal constraints in 24 ms.
[2020-05-12 02:59:05] [INFO ] Added : 73 causal constraints over 15 iterations in 613 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
Incomplete Parikh walk after 11400 steps, including 618 resets, run finished after 52 ms. (steps per millisecond=219 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 178 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 178/178 places, 146/146 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 178 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 176 transition count 144
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4 place count 176 transition count 138
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 168 transition count 138
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 168 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 167 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 34 place count 160 transition count 131
Applied a total of 34 rules in 17 ms. Remains 160 /178 variables (removed 18) and now considering 131/146 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/178 places, 131/146 transitions.
Incomplete random walk after 1000000 steps, including 35329 resets, run finished after 2062 ms. (steps per millisecond=484 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 9903 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties seen :[0]
Finished probabilistic random walk after 1230933 steps, run visited all 1 properties in 2051 ms. (steps per millisecond=600 )
Probabilistic random walk after 1230933 steps, saw 287820 distinct states, run finished after 2051 ms. (steps per millisecond=600 ) properties seen :[1]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589252350791

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-10, 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 r021-oct2-158897699200527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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