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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 50K 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 ShieldIIPt-PT-003B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717235598228

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:53:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:53:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:53:19] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-01 09:53:19] [INFO ] Transformed 213 places.
[2024-06-01 09:53:19] [INFO ] Transformed 198 transitions.
[2024-06-01 09:53:19] [INFO ] Found NUPN structural information;
[2024-06-01 09:53:19] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 764 ms. (52 steps per ms) remains 2/13 properties
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 363 ms. (109 steps per ms) remains 2/2 properties
// Phase 1: matrix 198 rows 213 cols
[2024-06-01 09:53:20] [INFO ] Computed 28 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 165/182 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 165/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/213 variables, 7/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 31/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 198/411 variables, 213/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 353 ms.
Refiners :[Domain max(s): 213/213 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 213/213 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/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 165/182 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 165/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:53:20] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 9 ms to minimize.
[2024-06-01 09:53:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-06-01 09:53:20] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:53:20] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:53:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/213 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 31/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:53:20] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 198/411 variables, 213/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:53:20] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:53:21] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:53:21] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:53:21] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:53:21] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:53:21] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:53:21] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/411 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 469 constraints, problems are : Problem set: 0 solved, 2 unsolved in 986 ms.
Refiners :[Domain max(s): 213/213 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 1410ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 484 ms.
Support contains 17 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 213 transition count 161
Reduce places removed 37 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 82 place count 176 transition count 153
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 90 place count 168 transition count 153
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 90 place count 168 transition count 141
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 114 place count 156 transition count 141
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 130 place count 140 transition count 125
Iterating global reduction 3 with 16 rules applied. Total rules applied 146 place count 140 transition count 125
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 146 place count 140 transition count 119
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 158 place count 134 transition count 119
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 244 place count 91 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 254 place count 86 transition count 78
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 86 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 259 place count 85 transition count 77
Applied a total of 259 rules in 58 ms. Remains 85 /213 variables (removed 128) and now considering 77/198 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 85/213 places, 77/198 transitions.
RANDOM walk for 40000 steps (8 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/2 properties
FORMULA ShieldIIPt-PT-003B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
// Phase 1: matrix 77 rows 85 cols
[2024-06-01 09:53:22] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 09:53:22] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/55 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/72 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/144 variables, 72/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 11/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/160 variables, 11/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/162 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 85/85 constraints, ReadFeed: 13/13 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/55 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:53:22] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 17/72 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:53:22] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/144 variables, 72/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:53:22] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 16/160 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:53:22] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:53:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/160 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/160 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/162 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/162 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/162 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/162 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 85/85 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 77/77 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 85 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 13 place count 78 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 77 transition count 70
Applied a total of 14 rules in 9 ms. Remains 77 /85 variables (removed 8) and now considering 70/77 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 77/85 places, 70/77 transitions.
RANDOM walk for 40000 steps (9 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2258355 steps, run timeout after 3001 ms. (steps per millisecond=752 ) properties seen :0 out of 1
Probabilistic random walk after 2258355 steps, saw 868831 distinct states, run finished after 3004 ms. (steps per millisecond=751 ) properties seen :0
// Phase 1: matrix 70 rows 77 cols
[2024-06-01 09:53:25] [INFO ] Computed 27 invariants in 2 ms
[2024-06-01 09:53:25] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/68 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/136 variables, 68/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/147 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, ReadFeed: 14/14 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:53:25] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/68 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:53:25] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/136 variables, 68/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/147 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/147 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/147 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/147 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 12 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 77/77 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-01 09:53:25] [INFO ] Invariant cache hit.
[2024-06-01 09:53:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 09:53:25] [INFO ] Invariant cache hit.
[2024-06-01 09:53:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 09:53:26] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-06-01 09:53:26] [INFO ] Redundant transitions in 0 ms returned []
Running 67 sub problems to find dead transitions.
[2024-06-01 09:53:26] [INFO ] Invariant cache hit.
[2024-06-01 09:53:26] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 3/77 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 09:53:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:53:26] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-06-01 09:53:26] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:53:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:53:26] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:53:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 09:53:26] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 70/147 variables, 77/111 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 125 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1799 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 3/77 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 70/147 variables, 77/111 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 14/125 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 67/192 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-01 09:53:28] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (OVERLAPS) 0/147 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 193 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1934 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 77/77 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 8/8 constraints]
After SMT, in 3748ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 3749ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3897 ms. Remains : 77/77 places, 70/70 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 11 edges and 77 vertex of which 2 / 77 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 76 transition count 68
Applied a total of 8 rules in 16 ms. Remains 76 /77 variables (removed 1) and now considering 68/70 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 76 cols
[2024-06-01 09:53:29] [INFO ] Computed 27 invariants in 1 ms
[2024-06-01 09:53:29] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 09:53:29] [INFO ] [Nat]Absence check using 27 positive place invariants in 3 ms returned sat
[2024-06-01 09:53:29] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 09:53:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 09:53:29] [INFO ] After 10ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:53:29] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:53:30] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:53:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 148 ms
TRAPS : Iteration 1
[2024-06-01 09:53:30] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 09:53:30] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 297 ms.
[2024-06-01 09:53:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-01 09:53:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 77 places, 70 transitions and 277 arcs took 3 ms.
[2024-06-01 09:53:30] [INFO ] Flatten gal took : 27 ms
Total runtime 10907 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 : ShieldIIPt-PT-003B-ReachabilityCardinality-2024-10

BK_STOP 1717235610460

--------------------
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 ShieldIIPt-PT-003B-ReachabilityCardinality-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/637/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="ShieldIIPt-PT-003B"
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 ShieldIIPt-PT-003B, 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-171683760600222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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