fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r514-smll-171654416900163
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
615.659 85002.00 223201.00 236.50 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.r514-smll-171654416900163.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 Peterson-PT-3, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r514-smll-171654416900163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717244593545

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:23:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 12:23:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:23:16] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-06-01 12:23:16] [INFO ] Transformed 244 places.
[2024-06-01 12:23:16] [INFO ] Transformed 332 transitions.
[2024-06-01 12:23:16] [INFO ] Found NUPN structural information;
[2024-06-01 12:23:16] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 421 ms.
RANDOM walk for 40000 steps (8 resets) in 3950 ms. (10 steps per ms) remains 78/244 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
[2024-06-01 12:23:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 12:23:18] [INFO ] Computed 15 invariants in 20 ms
[2024-06-01 12:23:18] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 152/226 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 152/232 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 2/228 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 308/540 variables, 232/476 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 57/533 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (OVERLAPS) 12/552 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 560 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5066 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 152/226 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 152/232 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-01 12:23:24] [INFO ] Deduced a trap composed of 97 places in 268 ms of which 53 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 2/228 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 4/232 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-01 12:23:27] [INFO ] Deduced a trap composed of 49 places in 282 ms of which 15 ms to minimize.
[2024-06-01 12:23:27] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 3 ms to minimize.
[2024-06-01 12:23:28] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 11 ms to minimize.
[2024-06-01 12:23:28] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
SMT process timed out in 10233ms, After SMT, problems are : Problem set: 0 solved, 74 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 244 transition count 276
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 188 transition count 276
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 112 place count 188 transition count 239
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 186 place count 151 transition count 239
Applied a total of 186 rules in 66 ms. Remains 151 /244 variables (removed 93) and now considering 239/332 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 151/244 places, 239/332 transitions.
RANDOM walk for 4000000 steps (8 resets) in 35751 ms. (111 steps per ms) remains 67/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1024 ms. (390 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1114 ms. (358 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1014 ms. (394 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1346 ms. (296 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1067 ms. (374 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 898 ms. (444 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 700 ms. (570 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 786 ms. (508 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 715 ms. (558 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 946 ms. (422 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 931 ms. (429 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 690 ms. (578 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 691 ms. (578 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 690 ms. (578 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 685 ms. (583 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 699 ms. (571 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 758 ms. (527 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 687 ms. (581 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 950 ms. (420 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1125 ms. (355 steps per ms) remains 67/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 919 ms. (434 steps per ms) remains 63/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 809 ms. (493 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 873 ms. (457 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 774 ms. (516 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 655 ms. (609 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 658 ms. (606 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 659 ms. (606 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 669 ms. (597 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 681 ms. (586 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 663 ms. (602 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 677 ms. (589 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 679 ms. (588 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 679 ms. (588 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 683 ms. (584 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 692 ms. (577 steps per ms) remains 59/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 713 ms. (560 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 852 ms. (468 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 787 ms. (507 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 911 ms. (438 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 811 ms. (492 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 671 ms. (595 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 668 ms. (597 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 662 ms. (603 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 659 ms. (606 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 670 ms. (596 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 668 ms. (597 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 652 ms. (612 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 648 ms. (616 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 649 ms. (615 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 646 ms. (618 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 633 ms. (630 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 645 ms. (619 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 658 ms. (606 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 646 ms. (618 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 647 ms. (617 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 647 ms. (617 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 672 ms. (594 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 646 ms. (618 steps per ms) remains 58/58 properties
[2024-06-01 12:23:52] [INFO ] Flow matrix only has 215 transitions (discarded 24 similar events)
// Phase 1: matrix 215 rows 151 cols
[2024-06-01 12:23:52] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 12:23:52] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 73/131 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 73/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 4/135 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 4/139 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 215/354 variables, 139/290 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 57/347 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 12/366 variables, 12/359 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 12/371 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/366 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 18 (OVERLAPS) 0/366 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 374 constraints, problems are : Problem set: 0 solved, 58 unsolved in 4493 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 73/131 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 73/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 4/135 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 4/139 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:23:58] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 4 ms to minimize.
[2024-06-01 12:23:58] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 12:23:58] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:23:58] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 4 ms to minimize.
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 21 ms to minimize.
[2024-06-01 12:23:59] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 215/354 variables, 139/296 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 57/353 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 58/411 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 16 (OVERLAPS) 12/366 variables, 12/423 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/366 variables, 12/435 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 3/438 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:24:01] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 3 ms to minimize.
[2024-06-01 12:24:01] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 2 ms to minimize.
[2024-06-01 12:24:01] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-06-01 12:24:01] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-06-01 12:24:01] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:24:02] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-06-01 12:24:03] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:24:05] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:24:05] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-06-01 12:24:05] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 3 ms to minimize.
[2024-06-01 12:24:05] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 3 ms to minimize.
[2024-06-01 12:24:05] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-06-01 12:24:05] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 4 ms to minimize.
[2024-06-01 12:24:05] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 3 ms to minimize.
[2024-06-01 12:24:06] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-06-01 12:24:06] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 4 ms to minimize.
[2024-06-01 12:24:06] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:24:06] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-06-01 12:24:06] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
[2024-06-01 12:24:06] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:24:06] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:24:07] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:24:07] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:24:07] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:24:07] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 18/476 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:24:09] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:24:09] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 4 ms to minimize.
[2024-06-01 12:24:09] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:24:09] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/366 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-01 12:24:11] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/366 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/366 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 24 (OVERLAPS) 0/366 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 481 constraints, problems are : Problem set: 0 solved, 58 unsolved in 20218 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 49/49 constraints]
After SMT, in 24760ms problems are : Problem set: 0 solved, 58 unsolved
Parikh walk visited 11 properties in 3019 ms.
Support contains 47 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 239/239 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 151 transition count 226
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 138 transition count 226
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 26 place count 138 transition count 221
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 133 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 129 transition count 217
Applied a total of 44 rules in 27 ms. Remains 129 /151 variables (removed 22) and now considering 217/239 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 129/151 places, 217/239 transitions.
RANDOM walk for 4000000 steps (8 resets) in 26163 ms. (152 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 597 ms. (668 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 588 ms. (679 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 590 ms. (676 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 587 ms. (680 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 590 ms. (676 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 588 ms. (679 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 586 ms. (681 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 590 ms. (676 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 709 ms. (563 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 593 ms. (673 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 592 ms. (674 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 593 ms. (673 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 594 ms. (672 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 592 ms. (674 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 590 ms. (676 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 598 ms. (667 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 596 ms. (670 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 621 ms. (643 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 597 ms. (668 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 596 ms. (670 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 597 ms. (668 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 594 ms. (672 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 594 ms. (672 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 593 ms. (673 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 597 ms. (668 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 594 ms. (672 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 601 ms. (664 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 596 ms. (670 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 597 ms. (668 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 596 ms. (670 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 613 ms. (651 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 590 ms. (676 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 594 ms. (672 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 595 ms. (671 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 590 ms. (676 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 591 ms. (675 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 598 ms. (667 steps per ms) remains 47/47 properties
Finished probabilistic random walk after 381975 steps, run visited all 47 properties in 2585 ms. (steps per millisecond=147 )
Probabilistic random walk after 381975 steps, saw 76568 distinct states, run finished after 2592 ms. (steps per millisecond=147 ) properties seen :47
Able to resolve query StableMarking after proving 244 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 82753 ms.
ITS solved all properties within timeout

BK_STOP 1717244678547

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r514-smll-171654416900163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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