Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r333-tall-171679077600047.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is RingSingleMessageInMbox-PT-d0m080, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077600047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 23:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 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 RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716792519156

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 06:48:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 06:48:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:48:40] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-27 06:48:40] [INFO ] Transformed 385 places.
[2024-05-27 06:48:40] [INFO ] Transformed 59 transitions.
[2024-05-27 06:48:40] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8511 resets) in 1745 ms. (22 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (188 resets) in 72 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (183 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (316 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (196 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (500 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (309 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (187 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (171 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (219 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (205 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (384 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (243 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (377 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (180 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (187 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 399717 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 15
Probabilistic random walk after 399717 steps, saw 156490 distinct states, run finished after 3010 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 59 rows 56 cols
[2024-05-27 06:48:44] [INFO ] Computed 5 invariants in 19 ms
[2024-05-27 06:48:44] [INFO ] State equation strengthened by 27 read => feed constraints.
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-11 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-02 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-06 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-12 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-04 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-15 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 9 unsolved
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-03 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-08 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 1/56 variables, 1/5 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 7 unsolved
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-01 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-07 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-09 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-10 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 59/115 variables, 56/61 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 27/88 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/88 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/88 constraints. Problems are: Problem set: 12 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 88 constraints, problems are : Problem set: 12 solved, 3 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 56/56 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/43 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/56 variables, 3/5 constraints. Problems are: Problem set: 12 solved, 3 unsolved
[2024-05-27 06:48:44] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 7 ms to minimize.
[2024-05-27 06:48:44] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-00 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-13 is UNSAT
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/7 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 59/115 variables, 56/63 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 27/90 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/91 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/91 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/91 constraints. Problems are: Problem set: 14 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 91 constraints, problems are : Problem set: 14 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 56/56 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 684ms problems are : Problem set: 14 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 22 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 59/59 transitions.
Graph (complete) has 148 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 51 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 51 transition count 56
Applied a total of 7 rules in 26 ms. Remains 51 /56 variables (removed 5) and now considering 56/59 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 51/56 places, 56/59 transitions.
RANDOM walk for 40000 steps (8570 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2612 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3633815 steps, run timeout after 3001 ms. (steps per millisecond=1210 ) properties seen :0 out of 1
Probabilistic random walk after 3633815 steps, saw 1395482 distinct states, run finished after 3001 ms. (steps per millisecond=1210 ) properties seen :0
// Phase 1: matrix 56 rows 51 cols
[2024-05-27 06:48:48] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 06:48:48] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/100 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 22/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/107 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/100 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 22/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/107 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/107 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 22 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 51/51 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-27 06:48:48] [INFO ] Invariant cache hit.
[2024-05-27 06:48:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-27 06:48:48] [INFO ] Invariant cache hit.
[2024-05-27 06:48:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-27 06:48:48] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-27 06:48:48] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-27 06:48:48] [INFO ] Invariant cache hit.
[2024-05-27 06:48:48] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 4 (OVERLAPS) 56/107 variables, 51/54 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 24/78 constraints. Problems are: Problem set: 5 solved, 50 unsolved
[2024-05-27 06:48:49] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/79 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/79 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/79 constraints. Problems are: Problem set: 5 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 79 constraints, problems are : Problem set: 5 solved, 50 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 2/48 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 3/51 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 56/107 variables, 51/55 constraints. Problems are: Problem set: 5 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 24/79 constraints. Problems are: Problem set: 5 solved, 50 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 50/129 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/129 constraints. Problems are: Problem set: 7 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/129 constraints. Problems are: Problem set: 7 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 129 constraints, problems are : Problem set: 7 solved, 48 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 50/55 constraints, Known Traps: 1/1 constraints]
After SMT, in 1898ms problems are : Problem set: 7 solved, 48 unsolved
Search for dead transitions found 7 dead transitions in 1899ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/51 places, 49/56 transitions.
Graph (complete) has 120 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 1 rules in 8 ms. Remains 48 /51 variables (removed 3) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 48 cols
[2024-05-27 06:48:50] [INFO ] Computed 5 invariants in 2 ms
[2024-05-27 06:48:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-27 06:48:50] [INFO ] Invariant cache hit.
[2024-05-27 06:48:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 06:48:50] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/51 places, 49/56 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2100 ms. Remains : 48/51 places, 49/56 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
RANDOM walk for 40000 steps (8630 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2722 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3906096 steps, run timeout after 3001 ms. (steps per millisecond=1301 ) properties seen :0 out of 1
Probabilistic random walk after 3906096 steps, saw 1500284 distinct states, run finished after 3001 ms. (steps per millisecond=1301 ) properties seen :0
// Phase 1: matrix 49 rows 45 cols
[2024-05-27 06:48:53] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 06:48:53] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/84 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/94 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/94 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/84 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/94 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/94 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 19 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 49/49 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 45/45 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 49/49 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-05-27 06:48:53] [INFO ] Invariant cache hit.
[2024-05-27 06:48:53] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-27 06:48:53] [INFO ] Invariant cache hit.
[2024-05-27 06:48:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 06:48:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-27 06:48:54] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-27 06:48:54] [INFO ] Invariant cache hit.
[2024-05-27 06:48:54] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/94 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 22/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/94 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 22/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 48/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 117 constraints, problems are : Problem set: 0 solved, 48 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1188ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1189ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1274 ms. Remains : 45/45 places, 49/49 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 103 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 44 transition count 47
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 44 transition count 44
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 41 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 40 transition count 43
Applied a total of 11 rules in 13 ms. Remains 40 /45 variables (removed 5) and now considering 43/49 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 40 cols
[2024-05-27 06:48:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 06:48:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-27 06:48:55] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 06:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 06:48:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-27 06:48:55] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 06:48:55] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 06:48:55] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 121 ms.
[2024-05-27 06:48:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-27 06:48:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 45 places, 49 transitions and 190 arcs took 3 ms.
[2024-05-27 06:48:55] [INFO ] Flatten gal took : 21 ms
Total runtime 15267 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RingSingleMessageInMbox-PT-d0m080

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 45
TRANSITIONS: 49
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 604
MODEL NAME: /home/mcc/execution/411/model
45 places, 49 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA RingSingleMessageInMbox-PT-d0m080-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716792536411

--------------------
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="RingSingleMessageInMbox-PT-d0m080"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is RingSingleMessageInMbox-PT-d0m080, 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 r333-tall-171679077600047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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