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-171683761800766.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-004B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761800766
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.2K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 49K 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-004B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-004B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717263382132

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-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:36:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:36:23] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-06-01 17:36:23] [INFO ] Transformed 163 places.
[2024-06-01 17:36:23] [INFO ] Transformed 183 transitions.
[2024-06-01 17:36:23] [INFO ] Found NUPN structural information;
[2024-06-01 17:36:23] [INFO ] Parsed PT model containing 163 places and 183 transitions and 576 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (211 resets) in 1060 ms. (37 steps per ms) remains 2/9 properties
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (34 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (38 resets) in 470 ms. (84 steps per ms) remains 1/2 properties
FORMULA ShieldRVs-PT-004B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 183 rows 163 cols
[2024-06-01 17:36:24] [INFO ] Computed 17 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/72 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/163 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 91/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 183/346 variables, 163/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 343 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 163/163 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/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/72 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:36:24] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 9 ms to minimize.
[2024-06-01 17:36:24] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 91/163 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 91/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:36:24] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-06-01 17:36:24] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-06-01 17:36:24] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 17:36:24] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:36:24] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-06-01 17:36:24] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 183/346 variables, 163/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:36:25] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 6/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/346 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 363 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1139 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 183/183 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 163 transition count 169
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 149 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 148 transition count 168
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 30 place count 148 transition count 148
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 70 place count 128 transition count 148
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 94 place count 104 transition count 124
Iterating global reduction 3 with 24 rules applied. Total rules applied 118 place count 104 transition count 124
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 118 place count 104 transition count 114
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 138 place count 94 transition count 114
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 192 place count 67 transition count 87
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 202 place count 67 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 66 transition count 86
Applied a total of 203 rules in 58 ms. Remains 66 /163 variables (removed 97) and now considering 86/183 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 66/163 places, 86/183 transitions.
RANDOM walk for 40000 steps (544 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (117 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2988163 steps, run timeout after 3001 ms. (steps per millisecond=995 ) properties seen :0 out of 1
Probabilistic random walk after 2988163 steps, saw 516384 distinct states, run finished after 3005 ms. (steps per millisecond=994 ) properties seen :0
// Phase 1: matrix 86 rows 66 cols
[2024-06-01 17:36:28] [INFO ] Computed 17 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/105 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 45/150 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/152 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/105 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 45/150 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:36:28] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:36:28] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/152 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/152 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/152 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 89 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 391ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 66/66 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-06-01 17:36:29] [INFO ] Invariant cache hit.
[2024-06-01 17:36:29] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 17:36:29] [INFO ] Invariant cache hit.
[2024-06-01 17:36:29] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-01 17:36:29] [INFO ] Redundant transitions in 13 ms returned []
Running 82 sub problems to find dead transitions.
[2024-06-01 17:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:36:29] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 3/66 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 8 ms to minimize.
[2024-06-01 17:36:30] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:36:31] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:32] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:36:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:36:32] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:36:32] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:32] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 86/152 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:36:32] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 17:36:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:33] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:36:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:36:33] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:36:33] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:36:33] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:36:33] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:36:33] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 7/152 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:33] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:34] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:36:34] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:36:34] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:36:34] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:36:34] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/152 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/152 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:35] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:36:35] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:36:35] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:36:35] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/152 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:35] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 23 (OVERLAPS) 0/152 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 164 constraints, problems are : Problem set: 0 solved, 82 unsolved in 6897 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 62/73 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 3/66 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 86/152 variables, 66/164 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 82/246 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:36:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:36:37] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:38] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:38] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:36:39] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 252 constraints, problems are : Problem set: 0 solved, 82 unsolved in 6701 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 87/87 constraints]
After SMT, in 13640ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 13642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13804 ms. Remains : 66/66 places, 86/86 transitions.
[2024-06-01 17:36:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-01 17:36:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 86 transitions and 389 arcs took 3 ms.
[2024-06-01 17:36:43] [INFO ] Flatten gal took : 35 ms
Total runtime 19909 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-004B-ReachabilityCardinality-2024-01

BK_STOP 1717263403390

--------------------
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-004B-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/856/inv_0_
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-004B"
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-004B, 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-171683761800766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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