Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399800558.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800558
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K May 18 16:42 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-14-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716336108574

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 00:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:01:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:01:50] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-22 00:01:50] [INFO ] Transformed 624 places.
[2024-05-22 00:01:50] [INFO ] Transformed 564 transitions.
[2024-05-22 00:01:50] [INFO ] Found NUPN structural information;
[2024-05-22 00:01:50] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:01:50] [INFO ] Flatten gal took : 190 ms
[2024-05-22 00:01:50] [INFO ] Flatten gal took : 71 ms
[2024-05-22 00:01:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3101901770402046717.gal : 19 ms
[2024-05-22 00:01:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3749357500850499460.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3101901770402046717.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3749357500850499460.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (271 resets) in 2137 ms. (18 steps per ms) remains 9/13 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (46 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality3749357500850499460.prop.
BEST_FIRST walk for 40003 steps (43 resets) in 289 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
Reachability property BusinessProcesses-PT-14-ReachabilityCardinality-2024-00 is true.
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :10 after 19
BEST_FIRST walk for 40004 steps (63 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
Reachability property BusinessProcesses-PT-14-ReachabilityCardinality-2024-12 is true.
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :19 after 28
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :28 after 29
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :29 after 96
Invariant property BusinessProcesses-PT-14-ReachabilityCardinality-2024-02 does not hold.
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :96 after 141
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :141 after 279
BEST_FIRST walk for 40004 steps (48 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :279 after 6.36712e+06
BEST_FIRST walk for 40003 steps (49 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :6.36712e+06 after 5.98834e+17
BEST_FIRST walk for 40003 steps (54 resets) in 473 ms. (84 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (50 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
// Phase 1: matrix 556 rows 616 cols
[2024-05-22 00:01:51] [INFO ] Computed 99 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 417/469 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 417/523 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 24/493 variables, 6/529 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 24/553 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 122/615 variables, 38/591 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 122/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/616 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 556/1172 variables, 616/1331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/1172 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1172/1172 variables, and 1331 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1317 ms.
Refiners :[Domain max(s): 616/616 constraints, Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 616/616 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 417/469 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 417/523 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 22 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:01:53] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:01:54] [INFO ] Deduced a trap composed of 130 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 146 places in 94 ms of which 9 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 148 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 141 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 149 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 20/543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 151 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:01:55] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 140 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 139 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 133 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 135 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 136 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 143 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 138 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:01:56] [INFO ] Deduced a trap composed of 131 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 133 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 8 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 150 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 154 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 144 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 139 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:01:57] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 20/563 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:01:58] [INFO ] Deduced a trap composed of 152 places in 118 ms of which 3 ms to minimize.
SMT process timed out in 6467ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 299 edges and 616 vertex of which 4 / 616 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1256 edges and 613 vertex of which 607 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 607 transition count 447
Reduce places removed 104 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 116 rules applied. Total rules applied 222 place count 503 transition count 435
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 234 place count 491 transition count 435
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 234 place count 491 transition count 349
Deduced a syphon composed of 86 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 418 place count 393 transition count 349
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 486 place count 325 transition count 281
Iterating global reduction 3 with 68 rules applied. Total rules applied 554 place count 325 transition count 281
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 554 place count 325 transition count 277
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 562 place count 321 transition count 277
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 714 place count 244 transition count 202
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 718 place count 244 transition count 198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 722 place count 240 transition count 198
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 728 place count 240 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 729 place count 239 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 730 place count 238 transition count 197
Applied a total of 730 rules in 137 ms. Remains 238 /616 variables (removed 378) and now considering 197/556 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 238/616 places, 197/556 transitions.
RANDOM walk for 40000 steps (655 resets) in 651 ms. (61 steps per ms) remains 4/9 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (120 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (131 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (115 resets) in 112 ms. (354 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
// Phase 1: matrix 197 rows 238 cols
[2024-05-22 00:01:58] [INFO ] Computed 79 invariants in 5 ms
[2024-05-22 00:01:58] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 150/190 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/194 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 39/233 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 196/429 variables, 233/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/434 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/435 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/435 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 318 constraints, problems are : Problem set: 0 solved, 3 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/238 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 150/190 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 4 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 2 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 8 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:01:59] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 2 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 57 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:02:00] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:02:01] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/194 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 55 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 0 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:02] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 51 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 2 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 14/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:02:03] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-14-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-14-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (OVERLAPS) 39/233 variables, 25/172 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/172 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 196/429 variables, 233/405 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/429 variables, 1/406 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/429 variables, 1/407 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/429 variables, 0/407 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/434 variables, 4/411 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/434 variables, 1/412 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/434 variables, 0/412 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/435 variables, 1/413 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:02:04] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-14-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 435/435 variables, and 417 constraints, problems are : Problem set: 3 solved, 0 unsolved in 5392 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 238/238 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 98/98 constraints]
After SMT, in 5703ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 14462 ms.

BK_STOP 1716336124491

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-14"
export BK_EXAMINATION="ReachabilityCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399800558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;