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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K 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.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 125K 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 1717361859051

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-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:57:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 20:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:57:40] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-02 20:57:40] [INFO ] Transformed 169 places.
[2024-06-02 20:57:40] [INFO ] Transformed 508 transitions.
[2024-06-02 20:57:40] [INFO ] Found NUPN structural information;
[2024-06-02 20:57:40] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1889 arcs in 190 ms.
Structural test allowed to assert that 14 places are NOT stable. Took 8 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
RANDOM walk for 40000 steps (1065 resets) in 2708 ms. (14 steps per ms) remains 36/155 properties
BEST_FIRST walk for 4003 steps (20 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (26 resets) in 41 ms. (95 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (21 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (23 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (21 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (23 resets) in 52 ms. (75 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (18 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (21 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (18 resets) in 18 ms. (210 steps per ms) remains 32/36 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (20 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (20 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (18 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (20 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (21 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (20 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
[2024-06-02 20:57:41] [INFO ] Flow matrix only has 402 transitions (discarded 38 similar events)
// Phase 1: matrix 402 rows 169 cols
[2024-06-02 20:57:41] [INFO ] Computed 10 invariants in 19 ms
[2024-06-02 20:57:41] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 107/139 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 107/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 27/166 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 27/176 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 401/567 variables, 166/342 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 57/399 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 3/570 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 1/571 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/571 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 0/571 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 406 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1698 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 107/139 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 107/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 20:57:43] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 11 ms to minimize.
[2024-06-02 20:57:43] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 2 ms to minimize.
[2024-06-02 20:57:43] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 27/166 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 27/179 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 20:57:44] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:57:44] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:57:44] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 20:57:44] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 401/567 variables, 166/349 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 57/406 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/567 variables, 32/438 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 3/570 variables, 3/441 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/570 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 20:57:46] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/570 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/570 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 19 (OVERLAPS) 1/571 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 20:57:47] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/571 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/571 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 447 constraints, problems are : Problem set: 0 solved, 32 unsolved in 5011 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 9/9 constraints]
After SMT, in 6794ms problems are : Problem set: 0 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 440/440 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 169 transition count 437
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 169 transition count 431
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 163 transition count 431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 160 transition count 437
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 160 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 36 place count 160 transition count 422
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 160 transition count 427
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 50 place count 156 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 57 place count 156 transition count 414
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 156 transition count 414
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 155 transition count 413
Applied a total of 62 rules in 111 ms. Remains 155 /169 variables (removed 14) and now considering 413/440 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 155/169 places, 413/440 transitions.
RANDOM walk for 4000000 steps (128176 resets) in 15708 ms. (254 steps per ms) remains 6/32 properties
BEST_FIRST walk for 4000001 steps (27427 resets) in 2898 ms. (1379 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000002 steps (27191 resets) in 2639 ms. (1515 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000004 steps (27271 resets) in 2456 ms. (1628 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (27357 resets) in 2572 ms. (1554 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (24775 resets) in 3346 ms. (1195 steps per ms) remains 3/4 properties
[2024-06-02 20:57:57] [INFO ] Flow matrix only has 376 transitions (discarded 37 similar events)
// Phase 1: matrix 376 rows 155 cols
[2024-06-02 20:57:57] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:57:57] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 79/82 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 240/322 variables, 82/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 117/439 variables, 23/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 23/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 36/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/440 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 80/520 variables, 41/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 41/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/521 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/521 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/521 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 9/530 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/530 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/530 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/530 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/531 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/531 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/531 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/531 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 376 constraints, problems are : Problem set: 0 solved, 3 unsolved in 309 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 155/155 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 79/82 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 240/322 variables, 82/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 117/439 variables, 23/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 23/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 36/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 80/520 variables, 41/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 41/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/521 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/521 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/521 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 9/530 variables, 6/369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/530 variables, 6/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/530 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/530 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1/531 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/531 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/531 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/531 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 379 constraints, problems are : Problem set: 0 solved, 3 unsolved in 429 ms.
Refiners :[Domain max(s): 155/155 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 155/155 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 750ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 290 ms.
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 413/413 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 416
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 152 transition count 414
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 150 transition count 412
Applied a total of 12 rules in 30 ms. Remains 150 /155 variables (removed 5) and now considering 412/413 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 150/155 places, 412/413 transitions.
RANDOM walk for 4000000 steps (128350 resets) in 8911 ms. (448 steps per ms) remains 1/3 properties
BEST_FIRST walk for 4000004 steps (27615 resets) in 2128 ms. (1878 steps per ms) remains 1/1 properties
[2024-06-02 20:58:01] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 150 cols
[2024-06-02 20:58:01] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 20:58:01] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 38/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/158 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 187/345 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 18/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/346 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 159/505 variables, 79/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 79/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 38/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 18/523 variables, 12/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/523 variables, 12/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/523 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/523 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/525 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/525 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/525 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 38/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/158 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 187/345 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 18/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/346 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/346 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 159/505 variables, 79/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 79/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 38/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/505 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 18/523 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/523 variables, 12/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/523 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/523 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/525 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/525 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/525 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 412/412 transitions.
Applied a total of 0 rules in 10 ms. Remains 150 /150 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 150/150 places, 412/412 transitions.
RANDOM walk for 3167925 steps (101624 resets) in 7884 ms. (401 steps per ms) remains 0/1 properties
Able to resolve query StableMarking after proving 156 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 24869 ms.
ITS solved all properties within timeout

BK_STOP 1717361885104

--------------------
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-12"
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-12, 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-171734907700163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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