Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455700148.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K 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 1717269560414

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:19:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:19:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:19:21] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-06-01 19:19:21] [INFO ] Transformed 752 places.
[2024-06-01 19:19:21] [INFO ] Transformed 1572 transitions.
[2024-06-01 19:19:21] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 279 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40001 steps (9 resets) in 2429 ms. (16 steps per ms) remains 22/752 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (9 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
[2024-06-01 19:19:23] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-06-01 19:19:23] [INFO ] Computed 54 invariants in 78 ms
[2024-06-01 19:19:23] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 97/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/121 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 575/696 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 14/710 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/710 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 40/750 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1392/2142 variables, 750/803 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2142 variables, 120/923 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2142 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 2/2144 variables, 2/925 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2144 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 926 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4077 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 97/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/121 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 575/696 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 241 places in 522 ms of which 41 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 428 places in 710 ms of which 10 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 437 places in 343 ms of which 11 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 430 places in 356 ms of which 4 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 373 places in 280 ms of which 4 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 437 places in 303 ms of which 5 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 380 places in 289 ms of which 4 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 421 places in 291 ms of which 4 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 430 places in 284 ms of which 4 ms to minimize.
SMT process timed out in 9533ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 182 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 342 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 542 place count 480 transition count 1142
Applied a total of 542 rules in 244 ms. Remains 480 /752 variables (removed 272) and now considering 1142/1412 (removed 270) transitions.
Running 1140 sub problems to find dead transitions.
[2024-06-01 19:19:32] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2024-06-01 19:19:33] [INFO ] Computed 52 invariants in 43 ms
[2024-06-01 19:19:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:19:44] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:19:45] [INFO ] Deduced a trap composed of 89 places in 201 ms of which 3 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 312 places in 214 ms of which 3 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 288 places in 263 ms of which 3 ms to minimize.
[2024-06-01 19:19:47] [INFO ] Deduced a trap composed of 286 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:19:48] [INFO ] Deduced a trap composed of 206 places in 283 ms of which 3 ms to minimize.
[2024-06-01 19:19:48] [INFO ] Deduced a trap composed of 239 places in 191 ms of which 3 ms to minimize.
[2024-06-01 19:19:50] [INFO ] Deduced a trap composed of 178 places in 292 ms of which 4 ms to minimize.
[2024-06-01 19:19:50] [INFO ] Deduced a trap composed of 170 places in 244 ms of which 3 ms to minimize.
[2024-06-01 19:19:50] [INFO ] Deduced a trap composed of 193 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1602 variables, and 70 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 193 places in 303 ms of which 3 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 262 places in 285 ms of which 3 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 278 places in 276 ms of which 5 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 166 places in 234 ms of which 3 ms to minimize.
[2024-06-01 19:20:07] [INFO ] Deduced a trap composed of 169 places in 235 ms of which 3 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 169 places in 254 ms of which 6 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 208 places in 283 ms of which 2 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 182 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1602 variables, and 78 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/480 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 28/28 constraints]
After SMT, in 42921ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 42942ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43205 ms. Remains : 480/752 places, 1142/1412 transitions.
RANDOM walk for 4000000 steps (1341 resets) in 48209 ms. (82 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (48 resets) in 1929 ms. (207 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (60 resets) in 2074 ms. (192 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (53 resets) in 1999 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 2473 ms. (161 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400000 steps (54 resets) in 2242 ms. (178 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (33 resets) in 1898 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (58 resets) in 2102 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (61 resets) in 1991 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (47 resets) in 2773 ms. (144 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (57 resets) in 1947 ms. (205 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (52 resets) in 1906 ms. (209 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (66 resets) in 2094 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (54 resets) in 2176 ms. (183 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (60 resets) in 1978 ms. (202 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (56 resets) in 2578 ms. (155 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (64 resets) in 1996 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (48 resets) in 1981 ms. (201 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (46 resets) in 2518 ms. (158 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (48 resets) in 1973 ms. (202 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (62 resets) in 2781 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (52 resets) in 2412 ms. (165 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (40 resets) in 2095 ms. (190 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 3005132 steps, run timeout after 87001 ms. (steps per millisecond=34 ) properties seen :0 out of 22
Probabilistic random walk after 3005132 steps, saw 1850189 distinct states, run finished after 87007 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-01 19:22:11] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 19:22:11] [INFO ] Invariant cache hit.
[2024-06-01 19:22:11] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 19/427 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 50/477 variables, 28/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/478 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1600 variables, 478/529 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1600 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1600 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 2/1602 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1602 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1602 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/1602 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1602/1602 variables, and 652 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2936 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 19:22:17] [INFO ] Deduced a trap composed of 245 places in 235 ms of which 3 ms to minimize.
[2024-06-01 19:22:17] [INFO ] Deduced a trap composed of 206 places in 206 ms of which 3 ms to minimize.
[2024-06-01 19:22:17] [INFO ] Deduced a trap composed of 214 places in 187 ms of which 4 ms to minimize.
[2024-06-01 19:22:17] [INFO ] Deduced a trap composed of 206 places in 190 ms of which 3 ms to minimize.
[2024-06-01 19:22:18] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 3 ms to minimize.
[2024-06-01 19:22:18] [INFO ] Deduced a trap composed of 223 places in 192 ms of which 3 ms to minimize.
[2024-06-01 19:22:18] [INFO ] Deduced a trap composed of 217 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:22:18] [INFO ] Deduced a trap composed of 226 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:22:18] [INFO ] Deduced a trap composed of 211 places in 208 ms of which 3 ms to minimize.
[2024-06-01 19:22:19] [INFO ] Deduced a trap composed of 209 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:22:19] [INFO ] Deduced a trap composed of 199 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:22:19] [INFO ] Deduced a trap composed of 206 places in 192 ms of which 2 ms to minimize.
[2024-06-01 19:22:19] [INFO ] Deduced a trap composed of 218 places in 193 ms of which 2 ms to minimize.
[2024-06-01 19:22:19] [INFO ] Deduced a trap composed of 215 places in 195 ms of which 2 ms to minimize.
[2024-06-01 19:22:20] [INFO ] Deduced a trap composed of 222 places in 169 ms of which 2 ms to minimize.
[2024-06-01 19:22:20] [INFO ] Deduced a trap composed of 254 places in 228 ms of which 3 ms to minimize.
[2024-06-01 19:22:20] [INFO ] Deduced a trap composed of 209 places in 198 ms of which 3 ms to minimize.
[2024-06-01 19:22:20] [INFO ] Deduced a trap composed of 218 places in 182 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 19/427 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 50/477 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 19:22:22] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 3 ms to minimize.
[2024-06-01 19:22:22] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:22:22] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:22:22] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:22:22] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:22:22] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:22:22] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:22:22] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:22:22] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 19:22:23] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1/478 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 1122/1600 variables, 478/557 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1600 variables, 120/677 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1600/1602 variables, and 699 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 478/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 28/28 constraints]
After SMT, in 47968ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 30 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 480/480 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 29 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-06-01 19:22:59] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-06-01 19:23:00] [INFO ] Invariant cache hit.
[2024-06-01 19:23:00] [INFO ] Implicit Places using invariants in 756 ms returned [3, 58, 120, 171, 248, 276, 333, 364, 372, 429]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 763 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/480 places, 1142/1142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 461 transition count 1133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 461 transition count 1133
Applied a total of 18 rules in 39 ms. Remains 461 /470 variables (removed 9) and now considering 1133/1142 (removed 9) transitions.
[2024-06-01 19:23:00] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
// Phase 1: matrix 1113 rows 461 cols
[2024-06-01 19:23:00] [INFO ] Computed 42 invariants in 24 ms
[2024-06-01 19:23:01] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-06-01 19:23:01] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 19:23:01] [INFO ] Invariant cache hit.
[2024-06-01 19:23:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 19:23:11] [INFO ] Implicit Places using invariants and state equation in 9623 ms returned []
Implicit Place search using SMT with State Equation took 10252 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/480 places, 1133/1142 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11084 ms. Remains : 461/480 places, 1133/1142 transitions.
RANDOM walk for 4000000 steps (1404 resets) in 49666 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (62 resets) in 1832 ms. (218 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (52 resets) in 2257 ms. (177 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (55 resets) in 1856 ms. (215 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (65 resets) in 2653 ms. (150 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (43 resets) in 2754 ms. (145 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (69 resets) in 2655 ms. (150 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (54 resets) in 1881 ms. (212 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (58 resets) in 1842 ms. (217 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (49 resets) in 1883 ms. (212 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (58 resets) in 2460 ms. (162 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (51 resets) in 1835 ms. (217 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (52 resets) in 1875 ms. (213 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (52 resets) in 2474 ms. (161 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (62 resets) in 2291 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (68 resets) in 1906 ms. (209 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (51 resets) in 2722 ms. (146 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (48 resets) in 1847 ms. (216 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (61 resets) in 2080 ms. (192 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (42 resets) in 1845 ms. (216 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (50 resets) in 2433 ms. (164 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (46 resets) in 2758 ms. (144 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (60 resets) in 1891 ms. (211 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 3518138 steps, run timeout after 96001 ms. (steps per millisecond=36 ) properties seen :0 out of 22
Probabilistic random walk after 3518138 steps, saw 1830272 distinct states, run finished after 96001 ms. (steps per millisecond=36 ) properties seen :0
[2024-06-01 19:25:19] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 19:25:19] [INFO ] Invariant cache hit.
[2024-06-01 19:25:19] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 57/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/459 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1113/1572 variables, 459/500 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1572 variables, 120/620 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1572 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 2/1574 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1574 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1574 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/1574 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 623 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2509 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 57/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 19:25:22] [INFO ] Deduced a trap composed of 150 places in 192 ms of which 2 ms to minimize.
[2024-06-01 19:25:22] [INFO ] Deduced a trap composed of 225 places in 153 ms of which 2 ms to minimize.
[2024-06-01 19:25:23] [INFO ] Deduced a trap composed of 225 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:25:23] [INFO ] Deduced a trap composed of 233 places in 187 ms of which 3 ms to minimize.
[2024-06-01 19:25:23] [INFO ] Deduced a trap composed of 199 places in 159 ms of which 2 ms to minimize.
[2024-06-01 19:25:23] [INFO ] Deduced a trap composed of 231 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:25:23] [INFO ] Deduced a trap composed of 227 places in 187 ms of which 3 ms to minimize.
[2024-06-01 19:25:24] [INFO ] Deduced a trap composed of 218 places in 197 ms of which 3 ms to minimize.
[2024-06-01 19:25:24] [INFO ] Deduced a trap composed of 216 places in 204 ms of which 3 ms to minimize.
[2024-06-01 19:25:24] [INFO ] Deduced a trap composed of 219 places in 182 ms of which 2 ms to minimize.
[2024-06-01 19:25:24] [INFO ] Deduced a trap composed of 224 places in 186 ms of which 3 ms to minimize.
[2024-06-01 19:25:24] [INFO ] Deduced a trap composed of 230 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:25:25] [INFO ] Deduced a trap composed of 238 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:25:25] [INFO ] Deduced a trap composed of 220 places in 173 ms of which 2 ms to minimize.
[2024-06-01 19:25:25] [INFO ] Deduced a trap composed of 228 places in 168 ms of which 2 ms to minimize.
[2024-06-01 19:25:25] [INFO ] Deduced a trap composed of 234 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:25:25] [INFO ] Deduced a trap composed of 228 places in 164 ms of which 2 ms to minimize.
[2024-06-01 19:25:25] [INFO ] Deduced a trap composed of 230 places in 171 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 19:25:26] [INFO ] Deduced a trap composed of 264 places in 223 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 10/418 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 40/458 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-01 19:25:27] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:25:27] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:25:27] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:25:27] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:25:27] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:25:27] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:25:27] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:25:27] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:25:27] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1/459 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 1113/1572 variables, 459/528 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1572 variables, 120/648 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1572/1574 variables, and 670 constraints, problems are : Problem set: 0 solved, 22 unsolved in 75010 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 459/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 28/28 constraints]
After SMT, in 77538ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 52 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 461/461 places, 1133/1133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 37 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
[2024-06-01 19:26:37] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 19:26:37] [INFO ] Invariant cache hit.
[2024-06-01 19:26:37] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-06-01 19:26:37] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 19:26:37] [INFO ] Invariant cache hit.
[2024-06-01 19:26:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 19:26:48] [INFO ] Implicit Places using invariants and state equation in 10288 ms returned []
Implicit Place search using SMT with State Equation took 10787 ms to find 0 implicit places.
[2024-06-01 19:26:48] [INFO ] Redundant transitions in 72 ms returned []
Running 1131 sub problems to find dead transitions.
[2024-06-01 19:26:48] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 19:26:48] [INFO ] Invariant cache hit.
[2024-06-01 19:26:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:26:57] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:26:58] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:26:58] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:26:58] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:26:58] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:26:58] [INFO ] Deduced a trap composed of 97 places in 197 ms of which 2 ms to minimize.
[2024-06-01 19:26:59] [INFO ] Deduced a trap composed of 96 places in 197 ms of which 3 ms to minimize.
[2024-06-01 19:27:02] [INFO ] Deduced a trap composed of 271 places in 231 ms of which 3 ms to minimize.
[2024-06-01 19:27:02] [INFO ] Deduced a trap composed of 270 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:27:05] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 3 ms to minimize.
[2024-06-01 19:27:05] [INFO ] Deduced a trap composed of 181 places in 212 ms of which 3 ms to minimize.
[2024-06-01 19:27:05] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 4 ms to minimize.
[2024-06-01 19:27:05] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 19:27:07] [INFO ] Deduced a trap composed of 184 places in 255 ms of which 3 ms to minimize.
[2024-06-01 19:27:07] [INFO ] Deduced a trap composed of 182 places in 227 ms of which 3 ms to minimize.
[2024-06-01 19:27:11] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 3 ms to minimize.
[2024-06-01 19:27:13] [INFO ] Deduced a trap composed of 245 places in 261 ms of which 2 ms to minimize.
[2024-06-01 19:27:13] [INFO ] Deduced a trap composed of 204 places in 251 ms of which 3 ms to minimize.
[2024-06-01 19:27:14] [INFO ] Deduced a trap composed of 179 places in 271 ms of which 3 ms to minimize.
[2024-06-01 19:27:15] [INFO ] Deduced a trap composed of 172 places in 251 ms of which 3 ms to minimize.
[2024-06-01 19:27:16] [INFO ] Deduced a trap composed of 188 places in 244 ms of which 3 ms to minimize.
[2024-06-01 19:27:16] [INFO ] Deduced a trap composed of 190 places in 213 ms of which 3 ms to minimize.
[2024-06-01 19:27:16] [INFO ] Deduced a trap composed of 206 places in 249 ms of which 3 ms to minimize.
[2024-06-01 19:27:17] [INFO ] Deduced a trap composed of 185 places in 188 ms of which 3 ms to minimize.
[2024-06-01 19:27:17] [INFO ] Deduced a trap composed of 202 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:27:17] [INFO ] Deduced a trap composed of 172 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:27:17] [INFO ] Deduced a trap composed of 181 places in 179 ms of which 2 ms to minimize.
[2024-06-01 19:27:18] [INFO ] Deduced a trap composed of 173 places in 177 ms of which 2 ms to minimize.
[2024-06-01 19:27:19] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 2 ms to minimize.
[2024-06-01 19:27:19] [INFO ] Deduced a trap composed of 275 places in 178 ms of which 2 ms to minimize.
[2024-06-01 19:27:19] [INFO ] Deduced a trap composed of 196 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:27:19] [INFO ] Deduced a trap composed of 275 places in 199 ms of which 2 ms to minimize.
[2024-06-01 19:27:19] [INFO ] Deduced a trap composed of 270 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1574 variables, and 80 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1131/1131 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 40/80 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 19:27:36] [INFO ] Deduced a trap composed of 240 places in 228 ms of which 3 ms to minimize.
[2024-06-01 19:27:36] [INFO ] Deduced a trap composed of 203 places in 254 ms of which 3 ms to minimize.
[2024-06-01 19:27:36] [INFO ] Deduced a trap composed of 186 places in 210 ms of which 3 ms to minimize.
[2024-06-01 19:27:37] [INFO ] Deduced a trap composed of 167 places in 213 ms of which 3 ms to minimize.
[2024-06-01 19:27:39] [INFO ] Deduced a trap composed of 227 places in 267 ms of which 3 ms to minimize.
[2024-06-01 19:27:39] [INFO ] Deduced a trap composed of 194 places in 269 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1574 variables, and 86 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1131 constraints, Known Traps: 46/46 constraints]
After SMT, in 62185ms problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 62203ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73110 ms. Remains : 461/461 places, 1133/1133 transitions.
RANDOM walk for 400000 steps (144 resets) in 6673 ms. (59 steps per ms) remains 22/22 properties
Running SMT prover for 22 properties.
[2024-06-01 19:27:52] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 19:27:52] [INFO ] Invariant cache hit.
[2024-06-01 19:27:52] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 19:27:52] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 13 ms returned sat
[2024-06-01 19:27:53] [INFO ] After 1192ms SMT Verify possible using state equation in real domain returned unsat :2 sat :20
[2024-06-01 19:27:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 19:27:54] [INFO ] After 500ms SMT Verify possible using 120 Read/Feed constraints in real domain returned unsat :2 sat :20
TRAPS : Iteration 0
[2024-06-01 19:27:55] [INFO ] After 1626ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:20
[2024-06-01 19:27:55] [INFO ] After 2915ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:20
[2024-06-01 19:27:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-01 19:27:55] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 13 ms returned sat
[2024-06-01 19:28:18] [INFO ] After 22671ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :20
[2024-06-01 19:28:24] [INFO ] After 6054ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :2 sat :20
TRAPS : Iteration 0
[2024-06-01 19:28:46] [INFO ] After 28081ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
[2024-06-01 19:28:47] [INFO ] After 52245ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 565964 ms.
ITS solved all properties within timeout

BK_STOP 1717270127621

--------------------
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="PolyORBLF-PT-S02J04T10"
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 PolyORBLF-PT-S02J04T10, 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 r518-tajo-171654455700148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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