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.r472-tajo-171620399800574.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 ltsminxred
Input is BusinessProcesses-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 24K 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 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 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 159K 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-16-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225984972

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:06] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-01 07:13:06] [INFO ] Transformed 638 places.
[2024-06-01 07:13:06] [INFO ] Transformed 578 transitions.
[2024-06-01 07:13:06] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:06] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (266 resets) in 1625 ms. (24 steps per ms) remains 8/12 properties
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (45 resets) in 407 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (44 resets) in 652 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (48 resets) in 809 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (49 resets) in 493 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (39 resets) in 282 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (41 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (48 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (47 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
// Phase 1: matrix 570 rows 630 cols
[2024-06-01 07:13:08] [INFO ] Computed 100 invariants in 47 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 345/539 variables, 62/256 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 345/601 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 1/602 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 91/630 variables, 37/639 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 91/730 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/630 variables, 0/730 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 570/1200 variables, 630/1360 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 1360 constraints, problems are : Problem set: 3 solved, 5 unsolved in 2087 ms.
Refiners :[Domain max(s): 630/630 constraints, Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 414/526 variables, 62/174 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 414/588 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 8 places in 371 ms of which 37 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 130 places in 266 ms of which 4 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 6 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 5 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 115 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 113 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 129 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 15 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 4 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 140 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/608 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 5 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 5 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 15 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 117 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
SMT process timed out in 7409ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 112 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 624 transition count 511
Reduce places removed 58 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 72 rules applied. Total rules applied 131 place count 566 transition count 497
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 145 place count 552 transition count 497
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 145 place count 552 transition count 400
Deduced a syphon composed of 97 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 344 place count 450 transition count 400
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 412 place count 382 transition count 332
Iterating global reduction 3 with 68 rules applied. Total rules applied 480 place count 382 transition count 332
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 480 place count 382 transition count 329
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 487 place count 378 transition count 329
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 599 place count 321 transition count 274
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 600 place count 321 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 601 place count 320 transition count 273
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 603 place count 320 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 604 place count 319 transition count 272
Applied a total of 604 rules in 148 ms. Remains 319 /630 variables (removed 311) and now considering 272/570 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 319/630 places, 272/570 transitions.
RANDOM walk for 40000 steps (725 resets) in 650 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (159 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (159 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (180 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (146 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (159 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 553511 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :1 out of 5
Probabilistic random walk after 553511 steps, saw 94052 distinct states, run finished after 3007 ms. (steps per millisecond=184 ) properties seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 272 rows 319 cols
[2024-06-01 07:13:19] [INFO ] Computed 87 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 151/262 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 54/316 variables, 31/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 272/588 variables, 316/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/591 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/591 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 406 constraints, problems are : Problem set: 0 solved, 4 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 151/262 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:13:19] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 4 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 14/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 54/316 variables, 31/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 272/588 variables, 316/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 16/545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/588 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 17 (OVERLAPS) 3/591 variables, 3/556 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/591 variables, 1/557 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/591 variables, 0/557 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/591 variables, 0/557 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/591 variables, and 557 constraints, problems are : Problem set: 2 solved, 2 unsolved in 14653 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 148/148 constraints]
After SMT, in 15168ms problems are : Problem set: 2 solved, 2 unsolved
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 8633 steps, including 195 resets, run visited all 1 properties in 33 ms. (steps per millisecond=261 )
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 161 ms.
All properties solved without resorting to model-checking.
Total runtime 28320 ms.
ITS solved all properties within timeout

BK_STOP 1717226014638

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-16"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-16, 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 r472-tajo-171620399800574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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