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.r482-tall-171624201900433.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 DES-PT-20b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201900433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 91K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717179931090

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:25:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 18:25:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:25:32] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-31 18:25:32] [INFO ] Transformed 360 places.
[2024-05-31 18:25:32] [INFO ] Transformed 311 transitions.
[2024-05-31 18:25:32] [INFO ] Found NUPN structural information;
[2024-05-31 18:25:32] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 194 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 8 ms.
RANDOM walk for 40000 steps (341 resets) in 1746 ms. (22 steps per ms) remains 69/273 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
// Phase 1: matrix 311 rows 360 cols
[2024-05-31 18:25:33] [INFO ] Computed 65 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 20/89 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 199/288 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 199/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 71/359 variables, 25/352 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 71/423 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 1/360 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (OVERLAPS) 311/671 variables, 360/785 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/671 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 16 (OVERLAPS) 0/671 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 785 constraints, problems are : Problem set: 0 solved, 69 unsolved in 4297 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 20/89 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 199/288 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 199/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-31 18:25:38] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 71/359 variables, 25/353 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 71/424 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 4 ms to minimize.
[2024-05-31 18:25:39] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 1/360 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-31 18:25:40] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-31 18:25:40] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-31 18:25:40] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-31 18:25:41] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:25:41] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
[2024-05-31 18:25:41] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 3 ms to minimize.
[2024-05-31 18:25:41] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-31 18:25:41] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 17 (OVERLAPS) 311/671 variables, 360/796 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/671 variables, 69/865 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/671 variables, and 865 constraints, problems are : Problem set: 0 solved, 69 unsolved in 5017 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 11/11 constraints]
After SMT, in 9411ms problems are : Problem set: 0 solved, 69 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 354 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 354 transition count 284
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 333 transition count 284
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 333 transition count 275
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 324 transition count 275
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 305 transition count 256
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 305 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 305 transition count 255
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 304 transition count 255
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 289 transition count 240
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 289 transition count 240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 289 transition count 225
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 287 transition count 224
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 287 transition count 221
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 284 transition count 221
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 207 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 205 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 205 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 204 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 203 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 202 transition count 144
Applied a total of 319 rules in 124 ms. Remains 202 /360 variables (removed 158) and now considering 144/311 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 202/360 places, 144/311 transitions.
RANDOM walk for 4000000 steps (190930 resets) in 30286 ms. (132 steps per ms) remains 62/69 properties
BEST_FIRST walk for 400004 steps (3587 resets) in 1109 ms. (360 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3671 resets) in 985 ms. (405 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3746 resets) in 1000 ms. (399 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3733 resets) in 761 ms. (524 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3636 resets) in 1039 ms. (384 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3702 resets) in 935 ms. (427 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3605 resets) in 1039 ms. (384 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3648 resets) in 1150 ms. (347 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3684 resets) in 931 ms. (429 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3658 resets) in 1048 ms. (381 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3732 resets) in 946 ms. (422 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3676 resets) in 758 ms. (527 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3700 resets) in 740 ms. (539 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3661 resets) in 745 ms. (536 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3648 resets) in 928 ms. (430 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3690 resets) in 980 ms. (407 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3734 resets) in 1031 ms. (387 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3704 resets) in 1097 ms. (364 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3653 resets) in 939 ms. (425 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3630 resets) in 943 ms. (423 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3663 resets) in 1073 ms. (372 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3687 resets) in 1067 ms. (374 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3605 resets) in 1070 ms. (373 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3660 resets) in 1036 ms. (385 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3663 resets) in 947 ms. (421 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3601 resets) in 756 ms. (528 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3758 resets) in 741 ms. (539 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3551 resets) in 731 ms. (546 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3609 resets) in 737 ms. (542 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3710 resets) in 736 ms. (542 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3590 resets) in 721 ms. (554 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3539 resets) in 713 ms. (560 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3565 resets) in 915 ms. (436 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3697 resets) in 738 ms. (541 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3630 resets) in 923 ms. (432 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3624 resets) in 756 ms. (528 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3566 resets) in 894 ms. (446 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3654 resets) in 789 ms. (506 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3634 resets) in 708 ms. (564 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3614 resets) in 1001 ms. (399 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3684 resets) in 1016 ms. (393 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3625 resets) in 984 ms. (406 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3704 resets) in 1029 ms. (388 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3637 resets) in 1080 ms. (370 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3699 resets) in 941 ms. (424 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3623 resets) in 1055 ms. (378 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3691 resets) in 978 ms. (408 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3622 resets) in 1098 ms. (363 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3719 resets) in 1053 ms. (379 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3649 resets) in 1037 ms. (385 steps per ms) remains 62/62 properties
// Phase 1: matrix 144 rows 202 cols
[2024-05-31 18:26:06] [INFO ] Computed 64 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 23/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 38/123 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 35/158 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 25/183 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 7/190 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 140/330 variables, 190/249 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (OVERLAPS) 14/344 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (OVERLAPS) 2/346 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 19 (OVERLAPS) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 266 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3043 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 23/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 38/123 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 35/158 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-31 18:26:10] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:26:10] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 25/183 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 7/190 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 140/330 variables, 190/251 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 48/299 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (OVERLAPS) 14/344 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 14/327 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-31 18:26:12] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/344 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-31 18:26:12] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-31 18:26:12] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/344 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 21 (OVERLAPS) 2/346 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/346 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-31 18:26:13] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/346 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-31 18:26:14] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/346 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-31 18:26:16] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/346 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/346 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-31 18:26:18] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-31 18:26:18] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/346 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/346 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-31 18:26:22] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/346 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/346 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 31 (OVERLAPS) 0/346 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 339 constraints, problems are : Problem set: 0 solved, 62 unsolved in 17214 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 11/11 constraints]
After SMT, in 20280ms problems are : Problem set: 0 solved, 62 unsolved
Fused 62 Parikh solutions to 61 different solutions.
Parikh walk visited 1 properties in 10465 ms.
Support contains 61 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 202 /202 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 202/202 places, 144/144 transitions.
RANDOM walk for 4000000 steps (191506 resets) in 32627 ms. (122 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (3755 resets) in 1364 ms. (293 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (3614 resets) in 1368 ms. (292 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400003 steps (3692 resets) in 1349 ms. (296 steps per ms) remains 60/61 properties
BEST_FIRST walk for 400003 steps (3680 resets) in 1270 ms. (314 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3675 resets) in 1324 ms. (301 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3603 resets) in 1359 ms. (294 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3716 resets) in 1289 ms. (310 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3650 resets) in 1302 ms. (306 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3613 resets) in 1326 ms. (301 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3625 resets) in 1307 ms. (305 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3767 resets) in 1285 ms. (311 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3681 resets) in 1288 ms. (310 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400001 steps (3664 resets) in 1272 ms. (314 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3638 resets) in 1276 ms. (313 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3619 resets) in 1275 ms. (313 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3584 resets) in 1279 ms. (312 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3705 resets) in 1285 ms. (311 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3686 resets) in 1229 ms. (325 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3642 resets) in 1287 ms. (310 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400001 steps (3549 resets) in 1235 ms. (323 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3669 resets) in 1275 ms. (313 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400001 steps (3690 resets) in 1310 ms. (305 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3634 resets) in 1379 ms. (289 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3592 resets) in 1311 ms. (304 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3671 resets) in 1273 ms. (313 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3635 resets) in 1239 ms. (322 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3673 resets) in 1313 ms. (304 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3627 resets) in 1263 ms. (316 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3646 resets) in 1265 ms. (315 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3628 resets) in 1291 ms. (309 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3691 resets) in 1303 ms. (306 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3609 resets) in 1304 ms. (306 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3640 resets) in 1248 ms. (320 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3675 resets) in 1256 ms. (318 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3593 resets) in 1239 ms. (322 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3644 resets) in 1252 ms. (319 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3626 resets) in 1229 ms. (325 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3644 resets) in 1263 ms. (316 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3623 resets) in 1264 ms. (316 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3663 resets) in 1266 ms. (315 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3665 resets) in 1258 ms. (317 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3660 resets) in 1288 ms. (310 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3633 resets) in 1330 ms. (300 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3685 resets) in 1345 ms. (297 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3625 resets) in 1286 ms. (310 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3662 resets) in 1279 ms. (312 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3567 resets) in 1340 ms. (298 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3567 resets) in 1279 ms. (312 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3638 resets) in 1266 ms. (315 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3624 resets) in 1198 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3675 resets) in 1004 ms. (398 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3713 resets) in 884 ms. (451 steps per ms) remains 60/60 properties
Finished probabilistic random walk after 370523 steps, run visited all 60 properties in 2518 ms. (steps per millisecond=147 )
Probabilistic random walk after 370523 steps, saw 94386 distinct states, run finished after 2522 ms. (steps per millisecond=146 ) properties seen :60
Able to resolve query StableMarking after proving 274 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 95691 ms.
ITS solved all properties within timeout

BK_STOP 1717180027986

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 StableMarking -timeout 180 -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="DES-PT-20b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DES-PT-20b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r482-tall-171624201900433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;