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.r528-tall-171683762000854.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 ltsminxred
Input is ShieldRVs-PT-050A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000854
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 320K 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 ShieldRVs-PT-050A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717270817129

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:40:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:40:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:40:18] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-06-01 19:40:18] [INFO ] Transformed 703 places.
[2024-06-01 19:40:18] [INFO ] Transformed 953 transitions.
[2024-06-01 19:40:18] [INFO ] Found NUPN structural information;
[2024-06-01 19:40:18] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (57 resets) in 2500 ms. (15 steps per ms) remains 5/14 properties
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 598 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 908 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 4/5 properties
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
// Phase 1: matrix 953 rows 703 cols
[2024-06-01 19:40:20] [INFO ] Computed 201 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 172/249 variables, 67/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 172/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 454/703 variables, 134/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 454/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 953/1656 variables, 703/1607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1656/1656 variables, and 1607 constraints, problems are : Problem set: 0 solved, 4 unsolved in 930 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 703/703 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/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ShieldRVs-PT-050A-ReachabilityCardinality-2024-12 is UNSAT
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 172/249 variables, 67/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 172/316 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 454/703 variables, 134/450 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 454/904 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 19:40:21] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 22 ms to minimize.
[2024-06-01 19:40:21] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 5 ms to minimize.
[2024-06-01 19:40:21] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:40:22] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:40:22] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 10 ms to minimize.
[2024-06-01 19:40:22] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:40:22] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 14 ms to minimize.
[2024-06-01 19:40:22] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:40:22] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:40:22] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:40:22] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/924 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:40:23] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 4/928 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 953/1656 variables, 703/1631 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1656 variables, 3/1634 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 19:40:24] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:40:26] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:40:26] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1656/1656 variables, and 1644 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5010 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 34/34 constraints]
After SMT, in 6069ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 87 times.
Drop transitions (Partial Free agglomeration) removed 87 transitions
Iterating global reduction 0 with 87 rules applied. Total rules applied 89 place count 702 transition count 952
Applied a total of 89 rules in 180 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 702/703 places, 952/953 transitions.
RANDOM walk for 40000 steps (64 resets) in 559 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 227874 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 227874 steps, saw 50194 distinct states, run finished after 3005 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 952 rows 702 cols
[2024-06-01 19:40:29] [INFO ] Computed 201 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 143/203 variables, 55/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 143/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 499/702 variables, 146/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 499/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 3 unsolved in 610 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 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/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 143/203 variables, 55/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 143/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 499/702 variables, 146/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 499/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:40:30] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:40:30] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:40:31] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:40:31] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:40:31] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:40:31] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 3 ms to minimize.
[2024-06-01 19:40:31] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:40:31] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:40:31] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:40:31] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:40:31] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:40:32] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 3/926 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 952/1654 variables, 702/1628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1654 variables, 3/1631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:40:33] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:40:33] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:40:33] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:40:34] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:40:34] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:40:34] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:40:34] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:40:34] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:40:34] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:40:34] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:40:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:40:34] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 12/1643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:40:35] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:40:35] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:40:35] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:40:35] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1654 variables, 4/1647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1654 variables, 0/1647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:40:36] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/1654 variables, 1/1648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:40:36] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1654 variables, 1/1649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1654 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1654 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1649 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6520 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 41/41 constraints]
After SMT, in 7178ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1109 ms.
Support contains 58 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 128 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (64 resets) in 370 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 231408 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 231408 steps, saw 50919 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-06-01 19:40:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 141/199 variables, 54/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 141/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 503/702 variables, 147/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 503/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 2 unsolved in 482 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 141/199 variables, 54/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 141/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 503/702 variables, 147/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 503/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:40:42] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:40:42] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-06-01 19:40:42] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-06-01 19:40:42] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:40:42] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:40:42] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:40:42] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:40:43] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:40:43] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:40:43] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:40:43] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:40:43] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:40:43] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:40:43] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:40:43] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:40:43] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 16/919 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 952/1654 variables, 702/1621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1654 variables, 2/1623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:40:44] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:40:44] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:40:44] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:40:45] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:40:45] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:40:45] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:40:45] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:40:45] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:40:45] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:40:45] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:40:45] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:40:46] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:40:46] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:40:46] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:40:46] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:40:46] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:40:46] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-06-01 19:40:46] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:40:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:40:46] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1654 variables, 20/1643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 0/1643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1654 variables, 0/1643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1643 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5513 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 36/36 constraints]
After SMT, in 6018ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1460 ms.
Support contains 58 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 28 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 28 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-06-01 19:40:49] [INFO ] Invariant cache hit.
[2024-06-01 19:40:49] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-06-01 19:40:49] [INFO ] Invariant cache hit.
[2024-06-01 19:40:50] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2024-06-01 19:40:50] [INFO ] Redundant transitions in 139 ms returned []
Running 951 sub problems to find dead transitions.
[2024-06-01 19:40:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-06-01 19:41:18] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:41:18] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:41:18] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 3 ms to minimize.
[2024-06-01 19:41:18] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 3 ms to minimize.
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 3 ms to minimize.
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 4 ms to minimize.
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 3 ms to minimize.
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 3 ms to minimize.
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:41:20] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 4 ms to minimize.
[2024-06-01 19:41:20] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 4 ms to minimize.
[2024-06-01 19:41:20] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:41:20] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 3 ms to minimize.
[2024-06-01 19:41:21] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
SMT process timed out in 30677ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30691ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32032 ms. Remains : 702/702 places, 952/952 transitions.
[2024-06-01 19:41:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-01 19:41:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 702 places, 952 transitions and 4772 arcs took 9 ms.
[2024-06-01 19:41:21] [INFO ] Flatten gal took : 146 ms
Total runtime 63123 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVs-PT-050A-ReachabilityCardinality-2024-01
Could not compute solution for formula : ShieldRVs-PT-050A-ReachabilityCardinality-2024-02

BK_STOP 1717270881637

--------------------
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
mcc2024
rfs formula name ShieldRVs-PT-050A-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/922/inv_0_
rfs formula name ShieldRVs-PT-050A-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/922/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldRVs-PT-050A"
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 ShieldRVs-PT-050A, 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 r528-tall-171683762000854"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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