fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r564-tall-171734907700148
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FireWire-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
858.623 127012.00 311749.00 178.00 F normal

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.r564-tall-171734907700148.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 FireWire-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907700148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 100K Jun 2 16:33 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 1717361712885

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:55:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 20:55:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:55:14] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 20:55:14] [INFO ] Transformed 130 places.
[2024-06-02 20:55:14] [INFO ] Transformed 408 transitions.
[2024-06-02 20:55:14] [INFO ] Found NUPN structural information;
[2024-06-02 20:55:14] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 174 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 7 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2199 resets) in 2063 ms. (19 steps per ms) remains 53/120 properties
BEST_FIRST walk for 4003 steps (56 resets) in 51 ms. (76 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (56 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (57 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (50 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (53 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (65 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (63 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (57 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (59 resets) in 16 ms. (235 steps per ms) remains 51/53 properties
BEST_FIRST walk for 4003 steps (40 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (65 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (44 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (59 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (39 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (42 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (56 resets) in 53 ms. (74 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (56 resets) in 30 ms. (129 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (48 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (63 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (56 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (53 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (65 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (48 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (63 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (49 resets) in 10 ms. (363 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (71 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (63 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (56 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (50 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (50 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (48 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (58 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (68 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (58 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (58 resets) in 10 ms. (363 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (65 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (54 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (63 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (73 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (60 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (63 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (56 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (59 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (59 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (51 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (70 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (45 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
[2024-06-02 20:55:15] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 20:55:15] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 20:55:15] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 74/124 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 74/130 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 4/128 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 319/447 variables, 128/264 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 44/308 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 2/449 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 14 (OVERLAPS) 1/450 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 16 (OVERLAPS) 0/450 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 313 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2435 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 74/124 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 74/130 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 20:55:19] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 17 ms to minimize.
[2024-06-02 20:55:19] [INFO ] Deduced a trap composed of 77 places in 225 ms of which 2 ms to minimize.
[2024-06-02 20:55:20] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:55:20] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:55:20] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 1 ms to minimize.
[2024-06-02 20:55:20] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:55:20] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 20:55:20] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 4/128 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 20:55:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 20:55:21] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 12 (OVERLAPS) 319/447 variables, 128/274 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 44/318 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 50/368 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 16 (OVERLAPS) 2/449 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/450 variables, and 372 constraints, problems are : Problem set: 0 solved, 50 unsolved in 5011 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 10/10 constraints]
After SMT, in 7575ms problems are : Problem set: 0 solved, 50 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 349
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 128 transition count 345
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 128 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 128 transition count 343
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 126 transition count 347
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 126 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 25 place count 126 transition count 335
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 125 transition count 334
Applied a total of 26 rules in 64 ms. Remains 125 /130 variables (removed 5) and now considering 334/352 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 125/130 places, 334/352 transitions.
RANDOM walk for 4000000 steps (231162 resets) in 23399 ms. (170 steps per ms) remains 28/50 properties
BEST_FIRST walk for 400002 steps (5639 resets) in 519 ms. (769 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (5609 resets) in 478 ms. (835 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (5624 resets) in 478 ms. (835 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (5586 resets) in 513 ms. (778 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (5708 resets) in 492 ms. (811 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400003 steps (5569 resets) in 456 ms. (875 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5759 resets) in 456 ms. (875 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5582 resets) in 469 ms. (851 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5678 resets) in 459 ms. (869 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5678 resets) in 464 ms. (860 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (5696 resets) in 453 ms. (881 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5679 resets) in 451 ms. (884 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5537 resets) in 454 ms. (879 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5732 resets) in 454 ms. (879 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (5544 resets) in 466 ms. (856 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5660 resets) in 476 ms. (838 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5772 resets) in 466 ms. (856 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5689 resets) in 459 ms. (869 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5605 resets) in 458 ms. (871 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5627 resets) in 464 ms. (860 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (5590 resets) in 461 ms. (865 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5680 resets) in 462 ms. (863 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5500 resets) in 453 ms. (881 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5858 resets) in 467 ms. (854 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5764 resets) in 480 ms. (831 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5638 resets) in 460 ms. (867 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5572 resets) in 451 ms. (884 steps per ms) remains 27/27 properties
[2024-06-02 20:55:34] [INFO ] Flow matrix only has 308 transitions (discarded 26 similar events)
// Phase 1: matrix 308 rows 125 cols
[2024-06-02 20:55:34] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 20:55:34] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 58/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 232/317 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 68/385 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 33/138 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/386 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 45/431 variables, 22/162 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 12/175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 2/433 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (OVERLAPS) 0/433 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 178 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 58/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 20:55:35] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
[2024-06-02 20:55:35] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:55:36] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 20:55:36] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 10 ms to minimize.
[2024-06-02 20:55:36] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 232/317 variables, 85/94 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 68/385 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 33/145 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 25/170 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 1/386 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/386 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 45/431 variables, 22/194 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 12/207 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/431 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (OVERLAPS) 2/433 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/433 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (OVERLAPS) 0/433 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 210 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2633 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints]
After SMT, in 3722ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 7 properties in 927 ms.
Support contains 20 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 334/334 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 336
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 124 transition count 333
Applied a total of 5 rules in 27 ms. Remains 124 /125 variables (removed 1) and now considering 333/334 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 124/125 places, 333/334 transitions.
RANDOM walk for 4000000 steps (232294 resets) in 23395 ms. (170 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (5751 resets) in 473 ms. (843 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (5664 resets) in 486 ms. (821 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (5516 resets) in 461 ms. (865 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (5617 resets) in 577 ms. (692 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400004 steps (5554 resets) in 464 ms. (860 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (5577 resets) in 690 ms. (578 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (5578 resets) in 472 ms. (845 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (5730 resets) in 484 ms. (824 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (5577 resets) in 483 ms. (826 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (5683 resets) in 469 ms. (851 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (5651 resets) in 460 ms. (867 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (5507 resets) in 484 ms. (824 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400003 steps (5568 resets) in 459 ms. (869 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5609 resets) in 443 ms. (900 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5692 resets) in 435 ms. (917 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5675 resets) in 455 ms. (877 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (5751 resets) in 450 ms. (886 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5695 resets) in 458 ms. (871 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (5616 resets) in 440 ms. (907 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5628 resets) in 438 ms. (911 steps per ms) remains 18/18 properties
[2024-06-02 20:55:50] [INFO ] Flow matrix only has 305 transitions (discarded 28 similar events)
// Phase 1: matrix 305 rows 124 cols
[2024-06-02 20:55:50] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:55:50] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 44/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 162/224 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 110/334 variables, 13/78 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 23/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 90/425 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 22/171 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/425 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 4/429 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/429 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/429 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 0/429 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 177 constraints, problems are : Problem set: 0 solved, 18 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 44/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:55:51] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 162/224 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 110/334 variables, 13/82 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 23/105 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 16/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 1/335 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 90/425 variables, 44/167 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 22/191 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 20:55:52] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 4/429 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (OVERLAPS) 0/429 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 198 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 2317ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 549 ms.
Support contains 18 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 333/333 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 123 transition count 331
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 123 transition count 330
Applied a total of 3 rules in 23 ms. Remains 123 /124 variables (removed 1) and now considering 330/333 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 123/124 places, 330/333 transitions.
RANDOM walk for 4000000 steps (231402 resets) in 15903 ms. (251 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5629 resets) in 461 ms. (865 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (5599 resets) in 444 ms. (898 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5678 resets) in 458 ms. (871 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (5646 resets) in 438 ms. (911 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5649 resets) in 438 ms. (911 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5732 resets) in 454 ms. (879 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5484 resets) in 446 ms. (894 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (5569 resets) in 433 ms. (921 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5571 resets) in 441 ms. (904 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5773 resets) in 433 ms. (921 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5739 resets) in 434 ms. (919 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5670 resets) in 428 ms. (932 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5458 resets) in 432 ms. (923 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5626 resets) in 439 ms. (909 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5624 resets) in 432 ms. (923 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5555 resets) in 429 ms. (930 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5730 resets) in 436 ms. (915 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (5588 resets) in 433 ms. (921 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 2992092 steps, run timeout after 18001 ms. (steps per millisecond=166 ) properties seen :3 out of 18
Probabilistic random walk after 2992092 steps, saw 627932 distinct states, run finished after 18006 ms. (steps per millisecond=166 ) properties seen :3
[2024-06-02 20:56:18] [INFO ] Flow matrix only has 302 transitions (discarded 28 similar events)
// Phase 1: matrix 302 rows 123 cols
[2024-06-02 20:56:18] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:56:18] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 46/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 159/220 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 110/330 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 23/100 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/331 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 90/421 variables, 44/146 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 22/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 4/425 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 0/425 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 176 constraints, problems are : Problem set: 0 solved, 15 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 46/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:56:18] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:56:18] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 159/220 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 110/330 variables, 13/81 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 1/331 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 90/421 variables, 44/163 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 22/187 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:56:19] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 4/425 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 0/425 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 194 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1357 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
After SMT, in 1952ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2435 ms.
Support contains 15 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 330/330 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 123/123 places, 330/330 transitions.
RANDOM walk for 4000000 steps (232083 resets) in 14992 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (5741 resets) in 476 ms. (838 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (5581 resets) in 476 ms. (838 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (5565 resets) in 455 ms. (877 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (5713 resets) in 458 ms. (871 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5740 resets) in 439 ms. (909 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (5584 resets) in 450 ms. (886 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5600 resets) in 442 ms. (902 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5690 resets) in 460 ms. (867 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400000 steps (5635 resets) in 443 ms. (900 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5677 resets) in 468 ms. (852 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (5546 resets) in 464 ms. (860 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (5632 resets) in 476 ms. (838 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5769 resets) in 451 ms. (884 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5526 resets) in 439 ms. (909 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5533 resets) in 434 ms. (919 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 2663052 steps, run timeout after 18001 ms. (steps per millisecond=147 ) properties seen :0 out of 15
Probabilistic random walk after 2663052 steps, saw 563577 distinct states, run finished after 18002 ms. (steps per millisecond=147 ) properties seen :0
[2024-06-02 20:56:46] [INFO ] Flow matrix only has 302 transitions (discarded 28 similar events)
[2024-06-02 20:56:46] [INFO ] Invariant cache hit.
[2024-06-02 20:56:46] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 46/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 159/220 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 110/330 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 23/100 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/331 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 90/421 variables, 44/146 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 22/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 4/425 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 0/425 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 176 constraints, problems are : Problem set: 0 solved, 15 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 46/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:56:47] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:56:47] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 159/220 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 110/330 variables, 13/81 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 1/331 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 90/421 variables, 44/163 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 22/187 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:56:48] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 4/425 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/425 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 0/425 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 194 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
After SMT, in 1988ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 4518 ms.
Support contains 15 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 330/330 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 123/123 places, 330/330 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 330/330 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2024-06-02 20:56:53] [INFO ] Flow matrix only has 302 transitions (discarded 28 similar events)
[2024-06-02 20:56:53] [INFO ] Invariant cache hit.
[2024-06-02 20:56:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 20:56:53] [INFO ] Flow matrix only has 302 transitions (discarded 28 similar events)
[2024-06-02 20:56:53] [INFO ] Invariant cache hit.
[2024-06-02 20:56:53] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:56:53] [INFO ] Implicit Places using invariants and state equation in 175 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 254 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 121/123 places, 330/330 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 328
Applied a total of 4 rules in 20 ms. Remains 119 /121 variables (removed 2) and now considering 328/330 (removed 2) transitions.
[2024-06-02 20:56:53] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
// Phase 1: matrix 300 rows 119 cols
[2024-06-02 20:56:53] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:56:53] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:56:53] [INFO ] Flow matrix only has 300 transitions (discarded 28 similar events)
[2024-06-02 20:56:53] [INFO ] Invariant cache hit.
[2024-06-02 20:56:53] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:56:53] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 119/123 places, 328/330 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 524 ms. Remains : 119/123 places, 328/330 transitions.
RANDOM walk for 4000000 steps (230998 resets) in 16185 ms. (247 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5584 resets) in 728 ms. (548 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5648 resets) in 510 ms. (782 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5659 resets) in 845 ms. (472 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5596 resets) in 571 ms. (699 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5612 resets) in 489 ms. (816 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5683 resets) in 499 ms. (800 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (5545 resets) in 504 ms. (792 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5657 resets) in 713 ms. (560 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (5675 resets) in 479 ms. (833 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5754 resets) in 528 ms. (756 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5677 resets) in 475 ms. (840 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5756 resets) in 495 ms. (806 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5490 resets) in 526 ms. (759 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (5621 resets) in 493 ms. (809 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (5662 resets) in 507 ms. (787 steps per ms) remains 15/15 properties
Finished probabilistic random walk after 5140301 steps, run visited all 15 properties in 18037 ms. (steps per millisecond=284 )
Probabilistic random walk after 5140301 steps, saw 1080503 distinct states, run finished after 18043 ms. (steps per millisecond=284 ) properties seen :15
Able to resolve query StableMarking after proving 121 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 125779 ms.
ITS solved all properties within timeout

BK_STOP 1717361839897

--------------------
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 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="FireWire-PT-09"
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 FireWire-PT-09, 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 r564-tall-171734907700148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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