About the Execution of ITS-Tools for BusinessProcesses-PT-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
413.768 | 36395.00 | 67609.00 | 173.80 | FFFTTTTTFTFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918600479.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600479
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 23:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 23:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 23:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 29 23:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 23:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 29 23:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 192K May 10 09:33 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-20-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1654201028710
Running Version 202205111006
[2022-06-02 20:17:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 20:17:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:17:10] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2022-06-02 20:17:10] [INFO ] Transformed 782 places.
[2022-06-02 20:17:10] [INFO ] Transformed 697 transitions.
[2022-06-02 20:17:10] [INFO ] Found NUPN structural information;
[2022-06-02 20:17:10] [INFO ] Parsed PT model containing 782 places and 697 transitions in 252 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 14 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 51 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 15) seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :5
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 638 rows 719 cols
[2022-06-02 20:17:11] [INFO ] Computed 121 place invariants in 42 ms
[2022-06-02 20:17:11] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-02 20:17:12] [INFO ] [Nat]Absence check using 78 positive place invariants in 31 ms returned sat
[2022-06-02 20:17:12] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 16 ms returned sat
[2022-06-02 20:17:13] [INFO ] After 939ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2022-06-02 20:17:13] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 6 ms to minimize.
[2022-06-02 20:17:13] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2022-06-02 20:17:13] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:17:13] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 13 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2022-06-02 20:17:15] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2022-06-02 20:17:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1846 ms
[2022-06-02 20:17:15] [INFO ] Deduced a trap composed of 70 places in 170 ms of which 1 ms to minimize.
[2022-06-02 20:17:15] [INFO ] Deduced a trap composed of 161 places in 173 ms of which 1 ms to minimize.
[2022-06-02 20:17:15] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 1 ms to minimize.
[2022-06-02 20:17:16] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 1 ms to minimize.
[2022-06-02 20:17:16] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2022-06-02 20:17:16] [INFO ] Deduced a trap composed of 160 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:17:16] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 0 ms to minimize.
[2022-06-02 20:17:17] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 0 ms to minimize.
[2022-06-02 20:17:17] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 0 ms to minimize.
[2022-06-02 20:17:17] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 0 ms to minimize.
[2022-06-02 20:17:17] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:17:17] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:17:18] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2022-06-02 20:17:18] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 1 ms to minimize.
[2022-06-02 20:17:18] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:17:18] [INFO ] Deduced a trap composed of 163 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:17:19] [INFO ] Deduced a trap composed of 175 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:17:19] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 0 ms to minimize.
[2022-06-02 20:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 4081 ms
[2022-06-02 20:17:19] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 0 ms to minimize.
[2022-06-02 20:17:19] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2022-06-02 20:17:19] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2022-06-02 20:17:19] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 4 ms to minimize.
[2022-06-02 20:17:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 534 ms
[2022-06-02 20:17:20] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 0 ms to minimize.
[2022-06-02 20:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-06-02 20:17:20] [INFO ] After 8014ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 376 ms.
[2022-06-02 20:17:20] [INFO ] After 8787ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3074 ms.
Support contains 40 out of 719 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 692 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.6 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 692 transition count 524
Reduce places removed 101 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 111 rules applied. Total rules applied 213 place count 591 transition count 514
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 223 place count 581 transition count 514
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 140 Pre rules applied. Total rules applied 223 place count 581 transition count 374
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 521 place count 423 transition count 374
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 606 place count 338 transition count 289
Iterating global reduction 3 with 85 rules applied. Total rules applied 691 place count 338 transition count 289
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 691 place count 338 transition count 283
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 705 place count 330 transition count 283
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 2 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 889 place count 237 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 893 place count 235 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 897 place count 235 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 898 place count 234 transition count 197
Applied a total of 898 rules in 148 ms. Remains 234 /719 variables (removed 485) and now considering 197/638 (removed 441) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/719 places, 197/638 transitions.
Incomplete random walk after 1000000 steps, including 28023 resets, run finished after 11767 ms. (steps per millisecond=84 ) properties (out of 4) seen :2
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5781 resets, run finished after 2732 ms. (steps per millisecond=366 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6383 resets, run finished after 1559 ms. (steps per millisecond=641 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2022-06-02 20:17:39] [INFO ] Flow matrix only has 196 transitions (discarded 1 similar events)
// Phase 1: matrix 196 rows 234 cols
[2022-06-02 20:17:39] [INFO ] Computed 85 place invariants in 14 ms
[2022-06-02 20:17:40] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:17:40] [INFO ] [Nat]Absence check using 66 positive place invariants in 18 ms returned sat
[2022-06-02 20:17:40] [INFO ] [Nat]Absence check using 66 positive and 19 generalized place invariants in 6 ms returned sat
[2022-06-02 20:17:40] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:17:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-02 20:17:40] [INFO ] After 56ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:17:40] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2022-06-02 20:17:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-06-02 20:17:40] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-06-02 20:17:40] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 51 ms.
Support contains 16 out of 234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 234/234 places, 197/197 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 234 transition count 192
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 229 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 227 transition count 190
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 14 place count 227 transition count 181
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 34 place count 216 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 215 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 215 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 215 transition count 179
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 214 transition count 179
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 58 place count 204 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 204 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 63 place count 202 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 201 transition count 184
Applied a total of 64 rules in 45 ms. Remains 201 /234 variables (removed 33) and now considering 184/197 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/234 places, 184/197 transitions.
Incomplete random walk after 1000000 steps, including 53312 resets, run finished after 2760 ms. (steps per millisecond=362 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 13556 resets, run finished after 1593 ms. (steps per millisecond=627 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21409 steps, run visited all 1 properties in 103 ms. (steps per millisecond=207 )
Probabilistic random walk after 21409 steps, saw 5851 distinct states, run finished after 103 ms. (steps per millisecond=207 ) properties seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 35023 ms.
BK_STOP 1654201065105
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-20"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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-20, 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 r024-tall-165251918600479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 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 '
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 ;