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-171620399900607.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-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399900607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 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 192K 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-20-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717226238421

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:17:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:17:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:17:19] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-01 07:17:19] [INFO ] Transformed 782 places.
[2024-06-01 07:17:19] [INFO ] Transformed 697 transitions.
[2024-06-01 07:17:19] [INFO ] Found NUPN structural information;
[2024-06-01 07:17:19] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 12 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (204 resets) in 1872 ms. (21 steps per ms) remains 10/15 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (37 resets) in 366 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 505 ms. (79 steps per ms) remains 9/10 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (35 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (34 resets) in 174 ms. (228 steps per ms) remains 8/9 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (31 resets) in 1054 ms. (37 steps per ms) remains 7/8 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (31 resets) in 182 ms. (218 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (37 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (37 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
// Phase 1: matrix 638 rows 719 cols
[2024-06-01 07:17:21] [INFO ] Computed 121 invariants in 44 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 465/557 variables, 68/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 465/625 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 40/597 variables, 10/635 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 40/675 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 122/719 variables, 43/718 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 122/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/719 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 638/1357 variables, 719/1559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 1559 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2032 ms.
Refiners :[Domain max(s): 719/719 constraints, Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 465/557 variables, 68/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 465/625 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 27 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 6 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 18 places in 366 ms of which 4 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 7 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 4 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 4 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 4 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 6 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 20/645 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 148 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 149 places in 620 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 163 places in 203 ms of which 3 ms to minimize.
SMT process timed out in 7325ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 696 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 696 transition count 539
Reduce places removed 90 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 101 rules applied. Total rules applied 192 place count 606 transition count 528
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 203 place count 595 transition count 528
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 203 place count 595 transition count 408
Deduced a syphon composed of 120 places in 2 ms
Ensure Unique test removed 14 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 457 place count 461 transition count 408
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 529 place count 389 transition count 336
Iterating global reduction 3 with 72 rules applied. Total rules applied 601 place count 389 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 601 place count 389 transition count 335
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 604 place count 387 transition count 335
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 766 place count 305 transition count 255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 770 place count 303 transition count 262
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 773 place count 303 transition count 262
Applied a total of 773 rules in 170 ms. Remains 303 /719 variables (removed 416) and now considering 262/638 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 303/719 places, 262/638 transitions.
RANDOM walk for 40000 steps (768 resets) in 731 ms. (54 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (147 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (147 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (152 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (137 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (153 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (155 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 728863 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :3 out of 6
Probabilistic random walk after 728863 steps, saw 112915 distinct states, run finished after 3005 ms. (steps per millisecond=242 ) properties seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 07:17:32] [INFO ] Flow matrix only has 261 transitions (discarded 1 similar events)
// Phase 1: matrix 261 rows 303 cols
[2024-06-01 07:17:32] [INFO ] Computed 90 invariants in 8 ms
[2024-06-01 07:17:32] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 123/135 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/238 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 56/294 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/297 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 258/555 variables, 297/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 4/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 9/564 variables, 6/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/564 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 397 constraints, problems are : Problem set: 0 solved, 3 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 303/303 constraints, ReadFeed: 4/4 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 123/135 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 103/238 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 5 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 63 places in 603 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 13/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 56/294 variables, 22/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-20-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 13/193 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/193 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/297 variables, 3/196 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 258/555 variables, 297/493 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/555 variables, 4/497 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/555 variables, 2/499 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/499 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 9/564 variables, 6/505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 2/507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 507 constraints, problems are : Problem set: 1 solved, 2 unsolved in 9591 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 303/303 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 108/108 constraints]
After SMT, in 10105ms problems are : Problem set: 1 solved, 2 unsolved
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 187 ms.
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 262/262 transitions.
Graph (trivial) has 85 edges and 303 vertex of which 5 / 303 are part of one of the 1 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 903 edges and 299 vertex of which 295 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 295 transition count 233
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 276 transition count 233
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 40 place count 276 transition count 209
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 95 place count 245 transition count 209
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 107 place count 233 transition count 197
Iterating global reduction 2 with 12 rules applied. Total rules applied 119 place count 233 transition count 197
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 214 place count 185 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 216 place count 184 transition count 167
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 218 place count 184 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 182 transition count 165
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 182 transition count 165
Applied a total of 221 rules in 101 ms. Remains 182 /303 variables (removed 121) and now considering 165/262 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 182/303 places, 165/262 transitions.
RANDOM walk for 2831 steps (154 resets) in 120 ms. (23 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23627 ms.
ITS solved all properties within timeout

BK_STOP 1717226263376

--------------------
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 ReachabilityFireability -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-20"
export BK_EXAMINATION="ReachabilityFireability"
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-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 r472-tajo-171620399900607"
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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;