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.r025-smll-171620165900087.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AutoFlight-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620165900087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 48K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716270604764

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 05:50:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 05:50:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 05:50:07] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-05-21 05:50:07] [INFO ] Transformed 206 places.
[2024-05-21 05:50:07] [INFO ] Transformed 204 transitions.
[2024-05-21 05:50:07] [INFO ] Found NUPN structural information;
[2024-05-21 05:50:07] [INFO ] Parsed PT model containing 206 places and 204 transitions and 478 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (351 resets) in 3199 ms. (12 steps per ms) remains 9/16 properties
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (47 resets) in 372 ms. (107 steps per ms) remains 8/9 properties
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 814 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (68 resets) in 630 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (43 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (44 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (42 resets) in 129 ms. (307 steps per ms) remains 7/8 properties
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (43 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (44 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (61 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
// Phase 1: matrix 204 rows 206 cols
[2024-05-21 05:50:09] [INFO ] Computed 16 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 78/200 variables, 14/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 78/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 6/206 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 204/410 variables, 206/428 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/410 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 428 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1713 ms.
Refiners :[Domain max(s): 206/206 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AutoFlight-PT-02b-ReachabilityFireability-2024-05 is UNSAT
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutoFlight-PT-02b-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 78/200 variables, 14/137 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 78/215 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-21 05:50:12] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 65 ms to minimize.
[2024-05-21 05:50:12] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 2/217 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/217 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AutoFlight-PT-02b-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 6/206 variables, 1/218 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 6/224 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 05:50:12] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 4 ms to minimize.
[2024-05-21 05:50:12] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
[2024-05-21 05:50:13] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 4 ms to minimize.
[2024-05-21 05:50:13] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-05-21 05:50:13] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-21 05:50:13] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 6/230 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 05:50:13] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/231 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/231 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 204/410 variables, 206/437 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 4/441 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 05:50:14] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 3 ms to minimize.
[2024-05-21 05:50:14] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 05:50:14] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 3/444 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 05:50:15] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 4 ms to minimize.
[2024-05-21 05:50:15] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 2/446 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 05:50:15] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 4 ms to minimize.
[2024-05-21 05:50:15] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-21 05:50:16] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 3/449 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-21 05:50:16] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-21 05:50:16] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 451 constraints, problems are : Problem set: 3 solved, 4 unsolved in 5015 ms.
Refiners :[Domain max(s): 206/206 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 19/19 constraints]
After SMT, in 6881ms problems are : Problem set: 3 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 204/204 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 206 transition count 187
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 37 rules applied. Total rules applied 54 place count 189 transition count 167
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 73 place count 170 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 73 place count 170 transition count 156
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 95 place count 159 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 101 place count 153 transition count 150
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 153 transition count 150
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 129 place count 142 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 142 transition count 132
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 142 transition count 129
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 142 place count 139 transition count 129
Applied a total of 142 rules in 150 ms. Remains 139 /206 variables (removed 67) and now considering 129/204 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 139/206 places, 129/204 transitions.
RANDOM walk for 40000 steps (521 resets) in 491 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (77 resets) in 273 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (73 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (75 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (74 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 484964 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 4
Probabilistic random walk after 484964 steps, saw 75529 distinct states, run finished after 3007 ms. (steps per millisecond=161 ) properties seen :0
// Phase 1: matrix 129 rows 139 cols
[2024-05-21 05:50:20] [INFO ] Computed 16 invariants in 2 ms
[2024-05-21 05:50:20] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/131 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/139 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/268 variables, 139/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 1/1 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, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 54/131 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 05:50:20] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 05:50:20] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 8/139 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 05:50:21] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-21 05:50:21] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 3 ms to minimize.
[2024-05-21 05:50:21] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-21 05:50:21] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-21 05:50:21] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 05:50:21] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-21 05:50:21] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 05:50:21] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 129/268 variables, 139/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 05:50:22] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/268 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 171 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1957 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 2320ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2230 ms.
Support contains 66 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 129/129 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 139 transition count 128
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 5 place count 138 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 135 transition count 125
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 135 transition count 122
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 132 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 128 transition count 118
Applied a total of 22 rules in 22 ms. Remains 128 /139 variables (removed 11) and now considering 118/129 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 128/139 places, 118/129 transitions.
RANDOM walk for 40000 steps (597 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (85 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (81 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (82 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 876128 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 3
Probabilistic random walk after 876128 steps, saw 155851 distinct states, run finished after 3002 ms. (steps per millisecond=291 ) properties seen :0
// Phase 1: matrix 118 rows 128 cols
[2024-05-21 05:50:28] [INFO ] Computed 16 invariants in 4 ms
[2024-05-21 05:50:28] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/120 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/128 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 118/246 variables, 128/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 145 constraints, problems are : Problem set: 0 solved, 3 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 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/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/120 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 05:50:28] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-05-21 05:50:28] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-21 05:50:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/128 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 05:50:28] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 3 ms to minimize.
[2024-05-21 05:50:28] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-21 05:50:28] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-05-21 05:50:28] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 05:50:28] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 05:50:29] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-05-21 05:50:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 118/246 variables, 128/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 158 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1171 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 1413ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 664 ms.
Support contains 63 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 117
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 127 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 126 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 125 transition count 115
Applied a total of 6 rules in 26 ms. Remains 125 /128 variables (removed 3) and now considering 115/118 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 125/128 places, 115/118 transitions.
RANDOM walk for 40000 steps (592 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (82 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 969006 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 2
Probabilistic random walk after 969006 steps, saw 173207 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
// Phase 1: matrix 115 rows 125 cols
[2024-05-21 05:50:33] [INFO ] Computed 16 invariants in 2 ms
[2024-05-21 05:50:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/117 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/125 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 115/240 variables, 125/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 142 constraints, problems are : Problem set: 0 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 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/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/117 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 05:50:33] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-21 05:50:33] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-05-21 05:50:33] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-21 05:50:33] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 05:50:33] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-21 05:50:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/125 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 3 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 3 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 05:50:34] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 115/240 variables, 125/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 161 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1530 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 1809ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 84 ms.
Support contains 36 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 115/115 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 125 transition count 110
Reduce places removed 5 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 120 transition count 103
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 113 transition count 102
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 25 place count 113 transition count 96
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 37 place count 107 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 106 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 106 transition count 95
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 51 place count 100 transition count 89
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 100 transition count 83
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 63 place count 94 transition count 83
Applied a total of 63 rules in 43 ms. Remains 94 /125 variables (removed 31) and now considering 83/115 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 94/125 places, 83/115 transitions.
RANDOM walk for 40000 steps (384 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 12812 steps (27 resets) in 62 ms. (203 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 28078 ms.
ITS solved all properties within timeout

BK_STOP 1716270635406

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-02b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutoFlight-PT-02b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620165900087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02b.tgz
mv AutoFlight-PT-02b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;