[INFO] QAIRT_SDK_ROOT=/home/boyucwsl/executorch/qairt/2.37.0.250724
[WARN] QNN_SDK_ROOT/SNPE_ROOT set to QAIRT_SDK_ROOT for backwards compatibility and will be deprecated in a future release.
[INFO] QAIRT SDK environment setup complete
[QNN] Using QNN SDK at /home/boyucwsl/executorch/qairt/2.37.0.250724 (from QNN_SDK_ROOT)
[PipelineGraphCollector] Installed patch: prepare_pt2e
[PipelineGraphCollector] Installed patch: convert_pt2e
[PipelineGraphCollector] Installed patch: to_edge_transform_and_lower
[PipelineGraphCollector] Installed ETRecord patches
libquantized_ops_aot_lib is not loaded
The backend_opinfo module couldn't be imported, so the abstract implementation will be used instead. This might be because $QNN_SDK_ROOT/lib/python isn't included in your PYTHONPATH, or the `BackendOpInfo` API isn't available in your QNN SDK version. Note that the `BackendOpInfo` API is supported starting from QNN SDK 2.41 and above.
[PipelineGraphCollector] Installed QNN patch: _ptq_calibrate
[AccuracyLens] Installed patch: get_imagenet_dataset
[AccuracyLens] Installed patch: get_masked_language_model_dataset
[Observatory CLI] Running as module: examples.qualcomm.oss_scripts.albert
PyTorch version 2.11.0+cpu available.
Using parser's config
HTTP Request: HEAD https://huggingface.co/albert/albert-base-v2/resolve/main/tokenizer_config.json "HTTP/1.1 307 Temporary Redirect"
HTTP Request: HEAD https://huggingface.co/api/resolve-cache/models/albert/albert-base-v2/8e2f239c5f8a2c0f253781ca60135db913e5c80c/tokenizer_config.json "HTTP/1.1 200 OK"
HTTP Request: GET https://huggingface.co/api/models/albert/albert-base-v2/tree/main/additional_chat_templates?recursive=false&expand=false "HTTP/1.1 404 Not Found"
HTTP Request: GET https://huggingface.co/api/models/albert/albert-base-v2/tree/main?recursive=true&expand=false "HTTP/1.1 200 OK"
HTTP Request: HEAD https://huggingface.co/albert/albert-base-v2/resolve/main/config.json "HTTP/1.1 307 Temporary Redirect"
HTTP Request: HEAD https://huggingface.co/api/resolve-cache/models/albert/albert-base-v2/8e2f239c5f8a2c0f253781ca60135db913e5c80c/config.json "HTTP/1.1 200 OK"

Loading weights:   0%|          | 0/29 [00:00<?, ?it/s]
Loading weights:   3%|▎         | 1/29 [00:00<00:00, 14665.40it/s, Materializing param=albert.embeddings.LayerNorm.bias]
Loading weights:   3%|▎         | 1/29 [00:00<00:00, 2718.28it/s, Materializing param=albert.embeddings.LayerNorm.bias] 
Loading weights:   7%|▋         | 2/29 [00:00<00:00, 810.65it/s, Materializing param=albert.embeddings.LayerNorm.weight]
Loading weights:   7%|▋         | 2/29 [00:00<00:00, 762.12it/s, Materializing param=albert.embeddings.LayerNorm.weight]
Loading weights:  10%|█         | 3/29 [00:00<00:00, 1067.98it/s, Materializing param=albert.embeddings.position_embeddings.weight]
Loading weights:  10%|█         | 3/29 [00:00<00:00, 1038.88it/s, Materializing param=albert.embeddings.position_embeddings.weight]
Loading weights:  14%|█▍        | 4/29 [00:00<00:00, 896.08it/s, Materializing param=albert.embeddings.token_type_embeddings.weight]
Loading weights:  14%|█▍        | 4/29 [00:00<00:00, 832.91it/s, Materializing param=albert.embeddings.token_type_embeddings.weight]
Loading weights:  17%|█▋        | 5/29 [00:00<00:00, 774.26it/s, Materializing param=albert.embeddings.word_embeddings.weight]      
Loading weights:  17%|█▋        | 5/29 [00:00<00:00, 734.81it/s, Materializing param=albert.embeddings.word_embeddings.weight]
Loading weights:  21%|██        | 6/29 [00:00<00:00, 662.52it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.LayerNorm.bias]
Loading weights:  21%|██        | 6/29 [00:00<00:00, 631.82it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.LayerNorm.bias]
Loading weights:  24%|██▍       | 7/29 [00:00<00:00, 587.19it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.LayerNorm.weight]
Loading weights:  24%|██▍       | 7/29 [00:00<00:00, 513.65it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.LayerNorm.weight]
Loading weights:  28%|██▊       | 8/29 [00:00<00:00, 495.66it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.dense.bias]      
Loading weights:  28%|██▊       | 8/29 [00:00<00:00, 482.54it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.dense.bias]
Loading weights:  31%|███       | 9/29 [00:00<00:00, 509.44it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.dense.weight]
Loading weights:  31%|███       | 9/29 [00:00<00:00, 483.69it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.dense.weight]
Loading weights:  34%|███▍      | 10/29 [00:00<00:00, 517.83it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.key.bias]   
Loading weights:  34%|███▍      | 10/29 [00:00<00:00, 515.90it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.key.bias]
Loading weights:  38%|███▊      | 11/29 [00:00<00:00, 564.81it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.key.weight]
Loading weights:  38%|███▊      | 11/29 [00:00<00:00, 563.23it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.key.weight]
Loading weights:  41%|████▏     | 12/29 [00:00<00:00, 611.08it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.query.bias]
Loading weights:  41%|████▏     | 12/29 [00:00<00:00, 609.12it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.query.bias]
Loading weights:  45%|████▍     | 13/29 [00:00<00:00, 656.35it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.query.weight]
Loading weights:  45%|████▍     | 13/29 [00:00<00:00, 654.27it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.query.weight]
Loading weights:  48%|████▊     | 14/29 [00:00<00:00, 700.85it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.value.bias]  
Loading weights:  48%|████▊     | 14/29 [00:00<00:00, 698.68it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.value.bias]
Loading weights:  52%|█████▏    | 15/29 [00:00<00:00, 744.90it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.value.weight]
Loading weights:  52%|█████▏    | 15/29 [00:00<00:00, 742.63it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.attention.value.weight]
Loading weights:  55%|█████▌    | 16/29 [00:00<00:00, 788.11it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.ffn.bias]              
Loading weights:  55%|█████▌    | 16/29 [00:00<00:00, 785.72it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.ffn.bias]
Loading weights:  59%|█████▊    | 17/29 [00:00<00:00, 831.35it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.ffn.weight]
Loading weights:  59%|█████▊    | 17/29 [00:00<00:00, 829.18it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.ffn.weight]
Loading weights:  62%|██████▏   | 18/29 [00:00<00:00, 873.53it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.ffn_output.bias]
Loading weights:  62%|██████▏   | 18/29 [00:00<00:00, 870.94it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.ffn_output.bias]
Loading weights:  66%|██████▌   | 19/29 [00:00<00:00, 915.07it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.ffn_output.weight]
Loading weights:  66%|██████▌   | 19/29 [00:00<00:00, 912.68it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.ffn_output.weight]
Loading weights:  69%|██████▉   | 20/29 [00:00<00:00, 955.29it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.full_layer_layer_norm.bias]
Loading weights:  69%|██████▉   | 20/29 [00:00<00:00, 951.52it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.full_layer_layer_norm.bias]
Loading weights:  72%|███████▏  | 21/29 [00:00<00:00, 994.97it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.full_layer_layer_norm.weight]
Loading weights:  72%|███████▏  | 21/29 [00:00<00:00, 992.44it/s, Materializing param=albert.encoder.albert_layer_groups.0.albert_layers.0.full_layer_layer_norm.weight]
Loading weights:  76%|███████▌  | 22/29 [00:00<00:00, 1033.82it/s, Materializing param=albert.encoder.embedding_hidden_mapping_in.bias]                                 
Loading weights:  76%|███████▌  | 22/29 [00:00<00:00, 1030.50it/s, Materializing param=albert.encoder.embedding_hidden_mapping_in.bias]
Loading weights:  79%|███████▉  | 23/29 [00:00<00:00, 1073.36it/s, Materializing param=albert.encoder.embedding_hidden_mapping_in.weight]
Loading weights:  79%|███████▉  | 23/29 [00:00<00:00, 1070.68it/s, Materializing param=albert.encoder.embedding_hidden_mapping_in.weight]
Loading weights:  83%|████████▎ | 24/29 [00:00<00:00, 1112.54it/s, Materializing param=predictions.LayerNorm.bias]                       
Loading weights:  83%|████████▎ | 24/29 [00:00<00:00, 1109.91it/s, Materializing param=predictions.LayerNorm.bias]
Loading weights:  86%|████████▌ | 25/29 [00:00<00:00, 1151.99it/s, Materializing param=predictions.LayerNorm.weight]
Loading weights:  86%|████████▌ | 25/29 [00:00<00:00, 1149.34it/s, Materializing param=predictions.LayerNorm.weight]
Loading weights:  90%|████████▉ | 26/29 [00:00<00:00, 1190.33it/s, Materializing param=predictions.bias]            
Loading weights:  90%|████████▉ | 26/29 [00:00<00:00, 1187.10it/s, Materializing param=predictions.bias]
Loading weights:  93%|█████████▎| 27/29 [00:00<00:00, 1227.47it/s, Materializing param=predictions.decoder.bias]
Loading weights:  93%|█████████▎| 27/29 [00:00<00:00, 1224.20it/s, Materializing param=predictions.decoder.bias]
Loading weights:  97%|█████████▋| 28/29 [00:00<00:00, 1264.11it/s, Materializing param=predictions.dense.bias]  
Loading weights:  97%|█████████▋| 28/29 [00:00<00:00, 1260.78it/s, Materializing param=predictions.dense.bias]
Loading weights: 100%|██████████| 29/29 [00:00<00:00, 1300.36it/s, Materializing param=predictions.dense.weight]
Loading weights: 100%|██████████| 29/29 [00:00<00:00, 1296.97it/s, Materializing param=predictions.dense.weight]
Loading weights: 100%|██████████| 29/29 [00:00<00:00, 1290.97it/s, Materializing param=predictions.dense.weight]
The tied weights mapping and config for this model specifies to tie predictions.bias to predictions.decoder.bias, but both are present in the checkpoints, so we will NOT tie them. You should update the config with `tie_word_embeddings=False` to silence this warning
AlbertForMaskedLM LOAD REPORT from: albert/albert-base-v2
Key                  | Status     |  | 
---------------------+------------+--+-
albert.pooler.weight | UNEXPECTED |  | 
albert.pooler.bias   | UNEXPECTED |  | 

Notes:
- UNEXPECTED	:can be ignored when loading from different task/architecture; not ok if you expect identical arch.
[AccuracyLens] Captured MLM targets (9 samples)
/home/boyucwsl/.local/share/uv/python/cpython-3.11.14-linux-x86_64-gnu/lib/python3.11/copyreg.py:105: FutureWarning: `isinstance(treespec, LeafSpec)` is deprecated, use `isinstance(treespec, TreeSpec) and treespec.is_leaf()` instead.
  return cls.__new__(cls, *args)
Creating new layout from 537 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 150.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 145
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 145
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 224
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 224
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 246
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 246
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 265
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 265
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 12
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 12
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 123
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 123
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 230
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 230
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 199
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 199
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 150
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 150
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 278
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 278
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 166
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 166
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 108
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 108
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[AccuracyLens] Using backend-captured fallback dataset from PipelineGraphCollectorLens
[AccuracyLens] Auto-configured mlm evaluator with 5 metrics
[Observatory] Collected Exported Float in 7786.7 ms
Creating new layout from 1430 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 252.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 745
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 130
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[Observatory] Collected Annotated Model in 21422.8 ms
Creating new layout from 1430 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 252.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 745
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 130
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[Observatory] Collected Calibrated Model in 22919.5 ms
Creating new layout from 2206 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 350.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1523
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1313
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[Observatory] Collected Quantized Model in 23280.0 ms
[INFO] [Qnn ExecuTorch]: Creating new backend bundle.
[INFO] [Qnn ExecuTorch]: create QNN Logger with log_level 1
Creating new layout from 2206 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 350.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1516
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1329
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[Observatory] Collected Pre-EdgeTransform/forward in 21711.2 ms
/home/boyucwsl/.local/share/uv/python/cpython-3.11.14-linux-x86_64-gnu/lib/python3.11/copyreg.py:105: FutureWarning: `isinstance(treespec, LeafSpec)` is deprecated, use `isinstance(treespec, TreeSpec) and treespec.is_leaf()` instead.
  return cls.__new__(cls, *args)
Op aten.unbind.int was requested for preservation by partitioner.  This request is ignored because it is in a blocklist.
/home/boyucwsl/.local/share/uv/python/cpython-3.11.14-linux-x86_64-gnu/lib/python3.11/copyreg.py:105: FutureWarning: `isinstance(treespec, LeafSpec)` is deprecated, use `isinstance(treespec, TreeSpec) and treespec.is_leaf()` instead.
  return cls.__new__(cls, *args)
Op aten.unbind.int was requested for preservation by partitioner.  This request is ignored because it is in a blocklist.
/home/boyucwsl/.local/share/uv/python/cpython-3.11.14-linux-x86_64-gnu/lib/python3.11/copyreg.py:105: FutureWarning: `isinstance(treespec, LeafSpec)` is deprecated, use `isinstance(treespec, TreeSpec) and treespec.is_leaf()` instead.
  return cls.__new__(cls, *args)
Creating new layout from 2206 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 350.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1516
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1329
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[Observatory] Collected ETRecord Exported/forward in 21364.1 ms
/home/boyucwsl/.local/share/uv/python/cpython-3.11.14-linux-x86_64-gnu/lib/python3.11/copyreg.py:105: FutureWarning: `isinstance(treespec, LeafSpec)` is deprecated, use `isinstance(treespec, TreeSpec) and treespec.is_leaf()` instead.
  return cls.__new__(cls, *args)
Creating new layout from 2232 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 350.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 54
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1087
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[Observatory] Collected ETRecord Edge/forward in 27675.2 ms
/home/boyucwsl/.local/share/uv/python/cpython-3.11.14-linux-x86_64-gnu/lib/python3.11/copyreg.py:105: FutureWarning: `isinstance(treespec, LeafSpec)` is deprecated, use `isinstance(treespec, TreeSpec) and treespec.is_leaf()` instead.
  return cls.__new__(cls, *args)
Creating new layout from 1182 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 150.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 98
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 189
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[Observatory] Collected ETRecord Extra/edge_after_transform/forward in 12413.2 ms
/home/boyucwsl/.local/share/uv/python/cpython-3.11.14-linux-x86_64-gnu/lib/python3.11/copyreg.py:105: FutureWarning: `isinstance(treespec, LeafSpec)` is deprecated, use `isinstance(treespec, TreeSpec) and treespec.is_leaf()` instead.
  return cls.__new__(cls, *args)
Building graph payload model...
Running fast-sugiyama layout...
[FX Graph Viewer] Compiling base graph payload...
[ FX Graph Viewer ] Compiling extension payloads...
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
No quant config is implemented for op, aten.clone.default
No quant config is implemented for op, aten.dropout.default
Building graph payload model...
Running fast-sugiyama layout...
[FX Graph Viewer] Compiling base graph payload...
[ FX Graph Viewer ] Compiling extension payloads...
Quantizing(PTQ) the model...
Building graph payload model...
Running fast-sugiyama layout...
[FX Graph Viewer] Compiling base graph payload...
[ FX Graph Viewer ] Compiling extension payloads...
Building graph payload model...
Running fast-sugiyama layout...
[FX Graph Viewer] Compiling base graph payload...
[ FX Graph Viewer ] Compiling extension payloads...
Building graph payload model...
Running fast-sugiyama layout...
[FX Graph Viewer] Compiling base graph payload...
[ FX Graph Viewer ] Compiling extension payloads...
Building graph payload model...
Running fast-sugiyama layout...
[FX Graph Viewer] Compiling base graph payload...
[ FX Graph Viewer ] Compiling extension payloads...
Building graph payload model...
Running fast-sugiyama layout...
[FX Graph Viewer] Compiling base graph payload...
[ FX Graph Viewer ] Compiling extension payloads...
Building graph payload model...
Running fast-sugiyama layout...
[FX Graph Viewer] Compiling base graph payload...
[ FX Graph Viewer ] Compiling extension payloads...
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | TrueFound 1 subgraphs to be partitioned.
Qnn partitioner will delegate torch mutable buffer with the same I/O address during the runtime, so if your model contains mutable buffer, then you can get the better performance with skip_mutable_buffer=False. If you encounter accuracy issue during the runtime, then please set `skip_mutable_buffer=True` and try again.
/home/boyucwsl/.local/share/uv/python/cpython-3.11.14-linux-x86_64-gnu/lib/python3.11/copyreg.py:105: FutureWarning: `isinstance(treespec, LeafSpec)` is deprecated, use `isinstance(treespec, TreeSpec) and treespec.is_leaf()` instead.
  return cls.__new__(cls, *args)
[INFO] [Qnn ExecuTorch]: Initialize Qnn backend parameters for Qnn executorch backend type 2
[INFO] [Qnn ExecuTorch]: Caching: Caching is in SAVE MODE.
[INFO] [Qnn ExecuTorch]: Running level=3 optimization.
Processing Method(0): (1/1)
Visiting: scalar_tensor, scalar_tensor.default
Visiting: scalar_tensor_1, scalar_tensor.default
Visiting: scalar_tensor_2, scalar_tensor.default
Visiting: scalar_tensor_3, scalar_tensor.default
Visiting: scalar_tensor_4, scalar_tensor.default
Visiting: scalar_tensor_5, scalar_tensor.default
Visiting: scalar_tensor_6, scalar_tensor.default
Visiting: scalar_tensor_7, scalar_tensor.default
Visiting: scalar_tensor_8, scalar_tensor.default
Visiting: scalar_tensor_9, scalar_tensor.default
Visiting: scalar_tensor_10, scalar_tensor.default
Visiting: scalar_tensor_11, scalar_tensor.default
Visiting: scalar_tensor_12, scalar_tensor.default
Visiting: scalar_tensor_13, scalar_tensor.default
Visiting: scalar_tensor_14, scalar_tensor.default
Visiting: scalar_tensor_15, scalar_tensor.default
Visiting: scalar_tensor_16, scalar_tensor.default
Visiting: scalar_tensor_17, scalar_tensor.default
Visiting: scalar_tensor_18, scalar_tensor.default
Visiting: scalar_tensor_19, scalar_tensor.default
Visiting: scalar_tensor_20, scalar_tensor.default
Visiting: scalar_tensor_21, scalar_tensor.default
Visiting: scalar_tensor_22, scalar_tensor.default
Visiting: scalar_tensor_23, scalar_tensor.default
Visiting: aten__to_copy_default, aten._to_copy.default
Visiting: aten__to_copy_default_1, aten._to_copy.default
Visiting: aten_where_self, aten.where.self
Visiting: aten_where_self_1, aten.where.self
Visiting: aten_where_self_2, aten.where.self
Visiting: aten_where_self_3, aten.where.self
Visiting: aten_where_self_4, aten.where.self
Visiting: aten_where_self_5, aten.where.self
Visiting: aten_where_self_6, aten.where.self
Visiting: aten_where_self_7, aten.where.self
Visiting: aten_where_self_8, aten.where.self
Visiting: aten_where_self_9, aten.where.self
Visiting: aten_where_self_10, aten.where.self
Visiting: aten_where_self_11, aten.where.self
Visiting: aten_embedding_default, aten.embedding.default
Visiting: aten_view_copy_default_11, aten.view_copy.default
Visiting: aten_view_copy_default_12, aten.view_copy.default
Visiting: aten_view_copy_default_35, aten.view_copy.default
Visiting: aten_view_copy_default_36, aten.view_copy.default
Visiting: aten_view_copy_default_59, aten.view_copy.default
Visiting: aten_view_copy_default_60, aten.view_copy.default
Visiting: aten_view_copy_default_83, aten.view_copy.default
Visiting: aten_view_copy_default_84, aten.view_copy.default
Visiting: aten_view_copy_default_107, aten.view_copy.default
Visiting: aten_view_copy_default_108, aten.view_copy.default
Visiting: aten_view_copy_default_131, aten.view_copy.default
Visiting: aten_view_copy_default_132, aten.view_copy.default
Visiting: aten_view_copy_default_155, aten.view_copy.default
Visiting: aten_view_copy_default_156, aten.view_copy.default
Visiting: aten_view_copy_default_179, aten.view_copy.default
Visiting: aten_view_copy_default_180, aten.view_copy.default
Visiting: aten_view_copy_default_203, aten.view_copy.default
Visiting: aten_view_copy_default_204, aten.view_copy.default
Visiting: aten_view_copy_default_227, aten.view_copy.default
Visiting: aten_view_copy_default_228, aten.view_copy.default
Visiting: aten_view_copy_default_251, aten.view_copy.default
Visiting: aten_view_copy_default_252, aten.view_copy.default
Visiting: aten_view_copy_default_275, aten.view_copy.default
Visiting: aten_view_copy_default_276, aten.view_copy.default
Visiting: aten_slice_copy_tensor, aten.slice_copy.Tensor
Visiting: aten__to_copy_default_39, aten._to_copy.default
Visiting: aten_embedding_default_2, aten.embedding.default
Visiting: aten_gather_default, aten.gather.default
Visiting: aten_embedding_default_1, aten.embedding.default
Visiting: aten_add_tensor, aten.add.Tensor
Visiting: aten_add_tensor_1, aten.add.Tensor
Visiting: aten_native_layer_norm_default, aten.native_layer_norm.default
Visiting: getitem, getitem
Visiting: aten_view_copy_default, aten.view_copy.default
Visiting: aten_linear_default, aten.linear.default
Visiting: aten_view_copy_default_1, aten.view_copy.default
Visiting: aten_view_copy_default_2, aten.view_copy.default
Visiting: aten_view_copy_default_3, aten.view_copy.default
Visiting: aten_view_copy_default_4, aten.view_copy.default
Visiting: aten_linear_default_3, aten.linear.default
Visiting: aten_linear_default_2, aten.linear.default
Visiting: aten_linear_default_1, aten.linear.default
Visiting: aten_view_copy_default_9, aten.view_copy.default
Visiting: aten_view_copy_default_7, aten.view_copy.default
Visiting: aten_view_copy_default_5, aten.view_copy.default
Visiting: aten_view_copy_default_10, aten.view_copy.default
Visiting: aten_view_copy_default_8, aten.view_copy.default
Visiting: aten_permute_copy_default_84, aten.permute_copy.default
Visiting: aten_view_copy_default_6, aten.view_copy.default
Visiting: aten_permute_copy_default_2, aten.permute_copy.default
Visiting: aten_permute_copy_default, aten.permute_copy.default
Visiting: aten_view_copy_default_17, aten.view_copy.default
Visiting: aten__to_copy_default_3, aten._to_copy.default
Visiting: aten_mul_tensor, aten.mul.Tensor
Visiting: aten_mul_tensor_1, aten.mul.Tensor
Visiting: aten_view_copy_default_13, aten.view_copy.default
Visiting: aten_view_copy_default_14, aten.view_copy.default
Visiting: aten__to_copy_default_4, aten._to_copy.default
Visiting: aten_bmm_default, aten.bmm.default
Visiting: aten_view_copy_default_15, aten.view_copy.default
Visiting: aten_add_tensor_2, aten.add.Tensor
Visiting: aten__safe_softmax_default, aten._safe_softmax.default
Visiting: aten_view_copy_default_16, aten.view_copy.default
Visiting: aten_bmm_default_1, aten.bmm.default
Visiting: aten_view_copy_default_18, aten.view_copy.default
Visiting: aten_permute_copy_default_4, aten.permute_copy.default
Visiting: aten__to_copy_default_5, aten._to_copy.default
Visiting: aten_permute_copy_default_85, aten.permute_copy.default
Visiting: aten_view_copy_default_19, aten.view_copy.default
Visiting: aten_view_copy_default_20, aten.view_copy.default
Visiting: aten_linear_default_4, aten.linear.default
Visiting: aten_view_copy_default_21, aten.view_copy.default
Visiting: aten_add_tensor_3, aten.add.Tensor
Visiting: aten_native_layer_norm_default_1, aten.native_layer_norm.default
Visiting: getitem_1, getitem
Visiting: aten_view_copy_default_22, aten.view_copy.default
Visiting: aten_linear_default_5, aten.linear.default
Visiting: aten_view_copy_default_23, aten.view_copy.default
Visiting: aten_gelu_default, aten.gelu.default
Visiting: aten_view_copy_default_24, aten.view_copy.default
Visiting: aten_linear_default_6, aten.linear.default
Visiting: aten_view_copy_default_25, aten.view_copy.default
Visiting: aten_add_tensor_4, aten.add.Tensor
Visiting: aten_native_layer_norm_default_2, aten.native_layer_norm.default
Visiting: getitem_2, getitem
Visiting: aten_view_copy_default_26, aten.view_copy.default
Visiting: aten_view_copy_default_27, aten.view_copy.default
Visiting: aten_view_copy_default_28, aten.view_copy.default
Visiting: aten_linear_default_9, aten.linear.default
Visiting: aten_linear_default_8, aten.linear.default
Visiting: aten_linear_default_7, aten.linear.default
Visiting: aten_view_copy_default_33, aten.view_copy.default
Visiting: aten_view_copy_default_31, aten.view_copy.default
Visiting: aten_view_copy_default_29, aten.view_copy.default
Visiting: aten_view_copy_default_34, aten.view_copy.default
Visiting: aten_view_copy_default_32, aten.view_copy.default
Visiting: aten_permute_copy_default_86, aten.permute_copy.default
Visiting: aten_view_copy_default_30, aten.view_copy.default
Visiting: aten_permute_copy_default_9, aten.permute_copy.default
Visiting: aten_permute_copy_default_7, aten.permute_copy.default
Visiting: aten_view_copy_default_41, aten.view_copy.default
Visiting: aten__to_copy_default_6, aten._to_copy.default
Visiting: aten_mul_tensor_2, aten.mul.Tensor
Visiting: aten_mul_tensor_3, aten.mul.Tensor
Visiting: aten_view_copy_default_37, aten.view_copy.default
Visiting: aten_view_copy_default_38, aten.view_copy.default
Visiting: aten__to_copy_default_7, aten._to_copy.default
Visiting: aten_bmm_default_2, aten.bmm.default
Visiting: aten_view_copy_default_39, aten.view_copy.default
Visiting: aten_add_tensor_5, aten.add.Tensor
Visiting: aten__safe_softmax_default_1, aten._safe_softmax.default
Visiting: aten_view_copy_default_40, aten.view_copy.default
Visiting: aten_bmm_default_3, aten.bmm.default
Visiting: aten_view_copy_default_42, aten.view_copy.default
Visiting: aten_permute_copy_default_11, aten.permute_copy.default
Visiting: aten__to_copy_default_8, aten._to_copy.default
Visiting: aten_permute_copy_default_87, aten.permute_copy.default
Visiting: aten_view_copy_default_43, aten.view_copy.default
Visiting: aten_view_copy_default_44, aten.view_copy.default
Visiting: aten_linear_default_10, aten.linear.default
Visiting: aten_view_copy_default_45, aten.view_copy.default
Visiting: aten_add_tensor_6, aten.add.Tensor
Visiting: aten_native_layer_norm_default_3, aten.native_layer_norm.default
Visiting: getitem_3, getitem
Visiting: aten_view_copy_default_46, aten.view_copy.default
Visiting: aten_linear_default_11, aten.linear.default
Visiting: aten_view_copy_default_47, aten.view_copy.default
Visiting: aten_gelu_default_1, aten.gelu.default
Visiting: aten_view_copy_default_48, aten.view_copy.default
Visiting: aten_linear_default_12, aten.linear.default
Visiting: aten_view_copy_default_49, aten.view_copy.default
Visiting: aten_add_tensor_7, aten.add.Tensor
Visiting: aten_native_layer_norm_default_4, aten.native_layer_norm.default
Visiting: getitem_4, getitem
Visiting: aten_view_copy_default_50, aten.view_copy.default
Visiting: aten_view_copy_default_51, aten.view_copy.default
Visiting: aten_view_copy_default_52, aten.view_copy.default
Visiting: aten_linear_default_15, aten.linear.default
Visiting: aten_linear_default_14, aten.linear.default
Visiting: aten_linear_default_13, aten.linear.default
Visiting: aten_view_copy_default_57, aten.view_copy.default
Visiting: aten_view_copy_default_55, aten.view_copy.default
Visiting: aten_view_copy_default_53, aten.view_copy.default
Visiting: aten_view_copy_default_58, aten.view_copy.default
Visiting: aten_view_copy_default_56, aten.view_copy.default
Visiting: aten_permute_copy_default_88, aten.permute_copy.default
Visiting: aten_view_copy_default_54, aten.view_copy.default
Visiting: aten_permute_copy_default_16, aten.permute_copy.default
Visiting: aten_permute_copy_default_14, aten.permute_copy.default
Visiting: aten_view_copy_default_65, aten.view_copy.default
Visiting: aten__to_copy_default_9, aten._to_copy.default
Visiting: aten_mul_tensor_4, aten.mul.Tensor
Visiting: aten_mul_tensor_5, aten.mul.Tensor
Visiting: aten_view_copy_default_61, aten.view_copy.default
Visiting: aten_view_copy_default_62, aten.view_copy.default
Visiting: aten__to_copy_default_10, aten._to_copy.default
Visiting: aten_bmm_default_4, aten.bmm.default
Visiting: aten_view_copy_default_63, aten.view_copy.default
Visiting: aten_add_tensor_8, aten.add.Tensor
Visiting: aten__safe_softmax_default_2, aten._safe_softmax.default
Visiting: aten_view_copy_default_64, aten.view_copy.default
Visiting: aten_bmm_default_5, aten.bmm.default
Visiting: aten_view_copy_default_66, aten.view_copy.default
Visiting: aten_permute_copy_default_18, aten.permute_copy.default
Visiting: aten__to_copy_default_11, aten._to_copy.default
Visiting: aten_permute_copy_default_89, aten.permute_copy.default
Visiting: aten_view_copy_default_67, aten.view_copy.default
Visiting: aten_view_copy_default_68, aten.view_copy.default
Visiting: aten_linear_default_16, aten.linear.default
Visiting: aten_view_copy_default_69, aten.view_copy.default
Visiting: aten_add_tensor_9, aten.add.Tensor
Visiting: aten_native_layer_norm_default_5, aten.native_layer_norm.default
Visiting: getitem_5, getitem
Visiting: aten_view_copy_default_70, aten.view_copy.default
Visiting: aten_linear_default_17, aten.linear.default
Visiting: aten_view_copy_default_71, aten.view_copy.default
Visiting: aten_gelu_default_2, aten.gelu.default
Visiting: aten_view_copy_default_72, aten.view_copy.default
Visiting: aten_linear_default_18, aten.linear.default
Visiting: aten_view_copy_default_73, aten.view_copy.default
Visiting: aten_add_tensor_10, aten.add.Tensor
Visiting: aten_native_layer_norm_default_6, aten.native_layer_norm.default
Visiting: getitem_6, getitem
Visiting: aten_view_copy_default_74, aten.view_copy.default
Visiting: aten_view_copy_default_75, aten.view_copy.default
Visiting: aten_view_copy_default_76, aten.view_copy.default
Visiting: aten_linear_default_21, aten.linear.default
Visiting: aten_linear_default_20, aten.linear.default
Visiting: aten_linear_default_19, aten.linear.default
Visiting: aten_view_copy_default_81, aten.view_copy.default
Visiting: aten_view_copy_default_79, aten.view_copy.default
Visiting: aten_view_copy_default_77, aten.view_copy.default
Visiting: aten_view_copy_default_82, aten.view_copy.default
Visiting: aten_view_copy_default_80, aten.view_copy.default
Visiting: aten_permute_copy_default_90, aten.permute_copy.default
Visiting: aten_view_copy_default_78, aten.view_copy.default
Visiting: aten_permute_copy_default_23, aten.permute_copy.default
Visiting: aten_permute_copy_default_21, aten.permute_copy.default
Visiting: aten_view_copy_default_89, aten.view_copy.default
Visiting: aten__to_copy_default_12, aten._to_copy.default
Visiting: aten_mul_tensor_6, aten.mul.Tensor
Visiting: aten_mul_tensor_7, aten.mul.Tensor
Visiting: aten_view_copy_default_85, aten.view_copy.default
Visiting: aten_view_copy_default_86, aten.view_copy.default
Visiting: aten__to_copy_default_13, aten._to_copy.default
Visiting: aten_bmm_default_6, aten.bmm.default
Visiting: aten_view_copy_default_87, aten.view_copy.default
Visiting: aten_add_tensor_11, aten.add.Tensor
Visiting: aten__safe_softmax_default_3, aten._safe_softmax.default
Visiting: aten_view_copy_default_88, aten.view_copy.default
Visiting: aten_bmm_default_7, aten.bmm.default
Visiting: aten_view_copy_default_90, aten.view_copy.default
Visiting: aten_permute_copy_default_25, aten.permute_copy.default
Visiting: aten__to_copy_default_14, aten._to_copy.default
Visiting: aten_permute_copy_default_91, aten.permute_copy.default
Visiting: aten_view_copy_default_91, aten.view_copy.default
Visiting: aten_view_copy_default_92, aten.view_copy.default
Visiting: aten_linear_default_22, aten.linear.default
Visiting: aten_view_copy_default_93, aten.view_copy.default
Visiting: aten_add_tensor_12, aten.add.Tensor
Visiting: aten_native_layer_norm_default_7, aten.native_layer_norm.default
Visiting: getitem_7, getitem
Visiting: aten_view_copy_default_94, aten.view_copy.default
Visiting: aten_linear_default_23, aten.linear.default
Visiting: aten_view_copy_default_95, aten.view_copy.default
Visiting: aten_gelu_default_3, aten.gelu.default
Visiting: aten_view_copy_default_96, aten.view_copy.default
Visiting: aten_linear_default_24, aten.linear.default
Visiting: aten_view_copy_default_97, aten.view_copy.default
Visiting: aten_add_tensor_13, aten.add.Tensor
Visiting: aten_native_layer_norm_default_8, aten.native_layer_norm.default
Visiting: getitem_8, getitem
Visiting: aten_view_copy_default_98, aten.view_copy.default
Visiting: aten_view_copy_default_99, aten.view_copy.default
Visiting: aten_view_copy_default_100, aten.view_copy.default
Visiting: aten_linear_default_27, aten.linear.default
Visiting: aten_linear_default_26, aten.linear.default
Visiting: aten_linear_default_25, aten.linear.default
Visiting: aten_view_copy_default_105, aten.view_copy.default
Visiting: aten_view_copy_default_103, aten.view_copy.default
Visiting: aten_view_copy_default_101, aten.view_copy.default
Visiting: aten_view_copy_default_106, aten.view_copy.default
Visiting: aten_view_copy_default_104, aten.view_copy.default
Visiting: aten_permute_copy_default_92, aten.permute_copy.default
Visiting: aten_view_copy_default_102, aten.view_copy.default
Visiting: aten_permute_copy_default_30, aten.permute_copy.default
Visiting: aten_permute_copy_default_28, aten.permute_copy.default
Visiting: aten_view_copy_default_113, aten.view_copy.default
Visiting: aten__to_copy_default_15, aten._to_copy.default
Visiting: aten_mul_tensor_8, aten.mul.Tensor
Visiting: aten_mul_tensor_9, aten.mul.Tensor
Visiting: aten_view_copy_default_109, aten.view_copy.default
Visiting: aten_view_copy_default_110, aten.view_copy.default
Visiting: aten__to_copy_default_16, aten._to_copy.default
Visiting: aten_bmm_default_8, aten.bmm.default
Visiting: aten_view_copy_default_111, aten.view_copy.default
Visiting: aten_add_tensor_14, aten.add.Tensor
Visiting: aten__safe_softmax_default_4, aten._safe_softmax.default
Visiting: aten_view_copy_default_112, aten.view_copy.default
Visiting: aten_bmm_default_9, aten.bmm.default
Visiting: aten_view_copy_default_114, aten.view_copy.default
Visiting: aten_permute_copy_default_32, aten.permute_copy.default
Visiting: aten__to_copy_default_17, aten._to_copy.default
Visiting: aten_permute_copy_default_93, aten.permute_copy.default
Visiting: aten_view_copy_default_115, aten.view_copy.default
Visiting: aten_view_copy_default_116, aten.view_copy.default
Visiting: aten_linear_default_28, aten.linear.default
Visiting: aten_view_copy_default_117, aten.view_copy.default
Visiting: aten_add_tensor_15, aten.add.Tensor
Visiting: aten_native_layer_norm_default_9, aten.native_layer_norm.default
Visiting: getitem_9, getitem
Visiting: aten_view_copy_default_118, aten.view_copy.default
Visiting: aten_linear_default_29, aten.linear.default
Visiting: aten_view_copy_default_119, aten.view_copy.default
Visiting: aten_gelu_default_4, aten.gelu.default
Visiting: aten_view_copy_default_120, aten.view_copy.default
Visiting: aten_linear_default_30, aten.linear.default
Visiting: aten_view_copy_default_121, aten.view_copy.default
Visiting: aten_add_tensor_16, aten.add.Tensor
Visiting: aten_native_layer_norm_default_10, aten.native_layer_norm.default
Visiting: getitem_10, getitem
Visiting: aten_view_copy_default_122, aten.view_copy.default
Visiting: aten_view_copy_default_123, aten.view_copy.default
Visiting: aten_view_copy_default_124, aten.view_copy.default
Visiting: aten_linear_default_33, aten.linear.default
Visiting: aten_linear_default_32, aten.linear.default
Visiting: aten_linear_default_31, aten.linear.default
Visiting: aten_view_copy_default_129, aten.view_copy.default
Visiting: aten_view_copy_default_127, aten.view_copy.default
Visiting: aten_view_copy_default_125, aten.view_copy.default
Visiting: aten_view_copy_default_130, aten.view_copy.default
Visiting: aten_view_copy_default_128, aten.view_copy.default
Visiting: aten_permute_copy_default_94, aten.permute_copy.default
Visiting: aten_view_copy_default_126, aten.view_copy.default
Visiting: aten_permute_copy_default_37, aten.permute_copy.default
Visiting: aten_permute_copy_default_35, aten.permute_copy.default
Visiting: aten_view_copy_default_137, aten.view_copy.default
Visiting: aten__to_copy_default_18, aten._to_copy.default
Visiting: aten_mul_tensor_10, aten.mul.Tensor
Visiting: aten_mul_tensor_11, aten.mul.Tensor
Visiting: aten_view_copy_default_133, aten.view_copy.default
Visiting: aten_view_copy_default_134, aten.view_copy.default
Visiting: aten__to_copy_default_19, aten._to_copy.default
Visiting: aten_bmm_default_10, aten.bmm.default
Visiting: aten_view_copy_default_135, aten.view_copy.default
Visiting: aten_add_tensor_17, aten.add.Tensor
Visiting: aten__safe_softmax_default_5, aten._safe_softmax.default
Visiting: aten_view_copy_default_136, aten.view_copy.default
Visiting: aten_bmm_default_11, aten.bmm.default
Visiting: aten_view_copy_default_138, aten.view_copy.default
Visiting: aten_permute_copy_default_39, aten.permute_copy.default
Visiting: aten__to_copy_default_20, aten._to_copy.default
Visiting: aten_permute_copy_default_95, aten.permute_copy.default
Visiting: aten_view_copy_default_139, aten.view_copy.default
Visiting: aten_view_copy_default_140, aten.view_copy.default
Visiting: aten_linear_default_34, aten.linear.default
Visiting: aten_view_copy_default_141, aten.view_copy.default
Visiting: aten_add_tensor_18, aten.add.Tensor
Visiting: aten_native_layer_norm_default_11, aten.native_layer_norm.default
Visiting: getitem_11, getitem
Visiting: aten_view_copy_default_142, aten.view_copy.default
Visiting: aten_linear_default_35, aten.linear.default
Visiting: aten_view_copy_default_143, aten.view_copy.default
Visiting: aten_gelu_default_5, aten.gelu.default
Visiting: aten_view_copy_default_144, aten.view_copy.default
Visiting: aten_linear_default_36, aten.linear.default
Visiting: aten_view_copy_default_145, aten.view_copy.default
Visiting: aten_add_tensor_19, aten.add.Tensor
Visiting: aten_native_layer_norm_default_12, aten.native_layer_norm.default
Visiting: getitem_12, getitem
Visiting: aten_view_copy_default_146, aten.view_copy.default
Visiting: aten_view_copy_default_147, aten.view_copy.default
Visiting: aten_view_copy_default_148, aten.view_copy.default
Visiting: aten_linear_default_39, aten.linear.default
Visiting: aten_linear_default_38, aten.linear.default
Visiting: aten_linear_default_37, aten.linear.default
Visiting: aten_view_copy_default_153, aten.view_copy.default
Visiting: aten_view_copy_default_151, aten.view_copy.default
Visiting: aten_view_copy_default_149, aten.view_copy.default
Visiting: aten_view_copy_default_154, aten.view_copy.default
Visiting: aten_view_copy_default_152, aten.view_copy.default
Visiting: aten_permute_copy_default_96, aten.permute_copy.default
Visiting: aten_view_copy_default_150, aten.view_copy.default
Visiting: aten_permute_copy_default_44, aten.permute_copy.default
Visiting: aten_permute_copy_default_42, aten.permute_copy.default
Visiting: aten_view_copy_default_161, aten.view_copy.default
Visiting: aten__to_copy_default_21, aten._to_copy.default
Visiting: aten_mul_tensor_12, aten.mul.Tensor
Visiting: aten_mul_tensor_13, aten.mul.Tensor
Visiting: aten_view_copy_default_157, aten.view_copy.default
Visiting: aten_view_copy_default_158, aten.view_copy.default
Visiting: aten__to_copy_default_22, aten._to_copy.default
Visiting: aten_bmm_default_12, aten.bmm.default
Visiting: aten_view_copy_default_159, aten.view_copy.default
Visiting: aten_add_tensor_20, aten.add.Tensor
Visiting: aten__safe_softmax_default_6, aten._safe_softmax.default
Visiting: aten_view_copy_default_160, aten.view_copy.default
Visiting: aten_bmm_default_13, aten.bmm.default
Visiting: aten_view_copy_default_162, aten.view_copy.default
Visiting: aten_permute_copy_default_46, aten.permute_copy.default
Visiting: aten__to_copy_default_23, aten._to_copy.default
Visiting: aten_permute_copy_default_97, aten.permute_copy.default
Visiting: aten_view_copy_default_163, aten.view_copy.default
Visiting: aten_view_copy_default_164, aten.view_copy.default
Visiting: aten_linear_default_40, aten.linear.default
Visiting: aten_view_copy_default_165, aten.view_copy.default
Visiting: aten_add_tensor_21, aten.add.Tensor
Visiting: aten_native_layer_norm_default_13, aten.native_layer_norm.default
Visiting: getitem_13, getitem
Visiting: aten_view_copy_default_166, aten.view_copy.default
Visiting: aten_linear_default_41, aten.linear.default
Visiting: aten_view_copy_default_167, aten.view_copy.default
Visiting: aten_gelu_default_6, aten.gelu.default
Visiting: aten_view_copy_default_168, aten.view_copy.default
Visiting: aten_linear_default_42, aten.linear.default
Visiting: aten_view_copy_default_169, aten.view_copy.default
Visiting: aten_add_tensor_22, aten.add.Tensor
Visiting: aten_native_layer_norm_default_14, aten.native_layer_norm.default
Visiting: getitem_14, getitem
Visiting: aten_view_copy_default_170, aten.view_copy.default
Visiting: aten_view_copy_default_171, aten.view_copy.default
Visiting: aten_view_copy_default_172, aten.view_copy.default
Visiting: aten_linear_default_45, aten.linear.default
Visiting: aten_linear_default_44, aten.linear.default
Visiting: aten_linear_default_43, aten.linear.default
Visiting: aten_view_copy_default_177, aten.view_copy.default
Visiting: aten_view_copy_default_175, aten.view_copy.default
Visiting: aten_view_copy_default_173, aten.view_copy.default
Visiting: aten_view_copy_default_178, aten.view_copy.default
Visiting: aten_view_copy_default_176, aten.view_copy.default
Visiting: aten_permute_copy_default_98, aten.permute_copy.default
Visiting: aten_view_copy_default_174, aten.view_copy.default
Visiting: aten_permute_copy_default_51, aten.permute_copy.default
Visiting: aten_permute_copy_default_49, aten.permute_copy.default
Visiting: aten_view_copy_default_185, aten.view_copy.default
Visiting: aten__to_copy_default_24, aten._to_copy.default
Visiting: aten_mul_tensor_14, aten.mul.Tensor
Visiting: aten_mul_tensor_15, aten.mul.Tensor
Visiting: aten_view_copy_default_181, aten.view_copy.default
Visiting: aten_view_copy_default_182, aten.view_copy.default
Visiting: aten__to_copy_default_25, aten._to_copy.default
Visiting: aten_bmm_default_14, aten.bmm.default
Visiting: aten_view_copy_default_183, aten.view_copy.default
Visiting: aten_add_tensor_23, aten.add.Tensor
Visiting: aten__safe_softmax_default_7, aten._safe_softmax.default
Visiting: aten_view_copy_default_184, aten.view_copy.default
Visiting: aten_bmm_default_15, aten.bmm.default
Visiting: aten_view_copy_default_186, aten.view_copy.default
Visiting: aten_permute_copy_default_53, aten.permute_copy.default
Visiting: aten__to_copy_default_26, aten._to_copy.default
Visiting: aten_permute_copy_default_99, aten.permute_copy.default
Visiting: aten_view_copy_default_187, aten.view_copy.default
Visiting: aten_view_copy_default_188, aten.view_copy.default
Visiting: aten_linear_default_46, aten.linear.default
Visiting: aten_view_copy_default_189, aten.view_copy.default
Visiting: aten_add_tensor_24, aten.add.Tensor
Visiting: aten_native_layer_norm_default_15, aten.native_layer_norm.default
Visiting: getitem_15, getitem
Visiting: aten_view_copy_default_190, aten.view_copy.default
Visiting: aten_linear_default_47, aten.linear.default
Visiting: aten_view_copy_default_191, aten.view_copy.default
Visiting: aten_gelu_default_7, aten.gelu.default
Visiting: aten_view_copy_default_192, aten.view_copy.default
Visiting: aten_linear_default_48, aten.linear.default
Visiting: aten_view_copy_default_193, aten.view_copy.default
Visiting: aten_add_tensor_25, aten.add.Tensor
Visiting: aten_native_layer_norm_default_16, aten.native_layer_norm.default
Visiting: getitem_16, getitem
Visiting: aten_view_copy_default_194, aten.view_copy.default
Visiting: aten_view_copy_default_195, aten.view_copy.default
Visiting: aten_view_copy_default_196, aten.view_copy.default
Visiting: aten_linear_default_51, aten.linear.default
Visiting: aten_linear_default_50, aten.linear.default
Visiting: aten_linear_default_49, aten.linear.default
Visiting: aten_view_copy_default_201, aten.view_copy.default
Visiting: aten_view_copy_default_199, aten.view_copy.default
Visiting: aten_view_copy_default_197, aten.view_copy.default
Visiting: aten_view_copy_default_202, aten.view_copy.default
Visiting: aten_view_copy_default_200, aten.view_copy.default
Visiting: aten_permute_copy_default_100, aten.permute_copy.default
Visiting: aten_view_copy_default_198, aten.view_copy.default
Visiting: aten_permute_copy_default_58, aten.permute_copy.default
Visiting: aten_permute_copy_default_56, aten.permute_copy.default
Visiting: aten_view_copy_default_209, aten.view_copy.default
Visiting: aten__to_copy_default_27, aten._to_copy.default
Visiting: aten_mul_tensor_16, aten.mul.Tensor
Visiting: aten_mul_tensor_17, aten.mul.Tensor
Visiting: aten_view_copy_default_205, aten.view_copy.default
Visiting: aten_view_copy_default_206, aten.view_copy.default
Visiting: aten__to_copy_default_28, aten._to_copy.default
Visiting: aten_bmm_default_16, aten.bmm.default
Visiting: aten_view_copy_default_207, aten.view_copy.default
Visiting: aten_add_tensor_26, aten.add.Tensor
Visiting: aten__safe_softmax_default_8, aten._safe_softmax.default
Visiting: aten_view_copy_default_208, aten.view_copy.default
Visiting: aten_bmm_default_17, aten.bmm.default
Visiting: aten_view_copy_default_210, aten.view_copy.default
Visiting: aten_permute_copy_default_60, aten.permute_copy.default
Visiting: aten__to_copy_default_29, aten._to_copy.default
Visiting: aten_permute_copy_default_101, aten.permute_copy.default
Visiting: aten_view_copy_default_211, aten.view_copy.default
Visiting: aten_view_copy_default_212, aten.view_copy.default
Visiting: aten_linear_default_52, aten.linear.default
Visiting: aten_view_copy_default_213, aten.view_copy.default
Visiting: aten_add_tensor_27, aten.add.Tensor
Visiting: aten_native_layer_norm_default_17, aten.native_layer_norm.default
Visiting: getitem_17, getitem
Visiting: aten_view_copy_default_214, aten.view_copy.default
Visiting: aten_linear_default_53, aten.linear.default
Visiting: aten_view_copy_default_215, aten.view_copy.default
Visiting: aten_gelu_default_8, aten.gelu.default
Visiting: aten_view_copy_default_216, aten.view_copy.default
Visiting: aten_linear_default_54, aten.linear.default
Visiting: aten_view_copy_default_217, aten.view_copy.default
Visiting: aten_add_tensor_28, aten.add.Tensor
Visiting: aten_native_layer_norm_default_18, aten.native_layer_norm.default
Visiting: getitem_18, getitem
Visiting: aten_view_copy_default_218, aten.view_copy.default
Visiting: aten_view_copy_default_219, aten.view_copy.default
Visiting: aten_view_copy_default_220, aten.view_copy.default
Visiting: aten_linear_default_57, aten.linear.default
Visiting: aten_linear_default_56, aten.linear.default
Visiting: aten_linear_default_55, aten.linear.default
Visiting: aten_view_copy_default_225, aten.view_copy.default
Visiting: aten_view_copy_default_223, aten.view_copy.default
Visiting: aten_view_copy_default_221, aten.view_copy.default
Visiting: aten_view_copy_default_226, aten.view_copy.default
Visiting: aten_view_copy_default_224, aten.view_copy.default
Visiting: aten_permute_copy_default_102, aten.permute_copy.default
Visiting: aten_view_copy_default_222, aten.view_copy.default
Visiting: aten_permute_copy_default_65, aten.permute_copy.default
Visiting: aten_permute_copy_default_63, aten.permute_copy.default
Visiting: aten_view_copy_default_233, aten.view_copy.default
Visiting: aten__to_copy_default_30, aten._to_copy.default
Visiting: aten_mul_tensor_18, aten.mul.Tensor
Visiting: aten_mul_tensor_19, aten.mul.Tensor
Visiting: aten_view_copy_default_229, aten.view_copy.default
Visiting: aten_view_copy_default_230, aten.view_copy.default
Visiting: aten__to_copy_default_31, aten._to_copy.default
Visiting: aten_bmm_default_18, aten.bmm.default
Visiting: aten_view_copy_default_231, aten.view_copy.default
Visiting: aten_add_tensor_29, aten.add.Tensor
Visiting: aten__safe_softmax_default_9, aten._safe_softmax.default
Visiting: aten_view_copy_default_232, aten.view_copy.default
Visiting: aten_bmm_default_19, aten.bmm.default
Visiting: aten_view_copy_default_234, aten.view_copy.default
Visiting: aten_permute_copy_default_67, aten.permute_copy.default
Visiting: aten__to_copy_default_32, aten._to_copy.default
Visiting: aten_permute_copy_default_103, aten.permute_copy.default
Visiting: aten_view_copy_default_235, aten.view_copy.default
Visiting: aten_view_copy_default_236, aten.view_copy.default
Visiting: aten_linear_default_58, aten.linear.default
Visiting: aten_view_copy_default_237, aten.view_copy.default
Visiting: aten_add_tensor_30, aten.add.Tensor
Visiting: aten_native_layer_norm_default_19, aten.native_layer_norm.default
Visiting: getitem_19, getitem
Visiting: aten_view_copy_default_238, aten.view_copy.default
Visiting: aten_linear_default_59, aten.linear.default
Visiting: aten_view_copy_default_239, aten.view_copy.default
Visiting: aten_gelu_default_9, aten.gelu.default
Visiting: aten_view_copy_default_240, aten.view_copy.default
Visiting: aten_linear_default_60, aten.linear.default
Visiting: aten_view_copy_default_241, aten.view_copy.default
Visiting: aten_add_tensor_31, aten.add.Tensor
Visiting: aten_native_layer_norm_default_20, aten.native_layer_norm.default
Visiting: getitem_20, getitem
Visiting: aten_view_copy_default_242, aten.view_copy.default
Visiting: aten_view_copy_default_243, aten.view_copy.default
Visiting: aten_view_copy_default_244, aten.view_copy.default
Visiting: aten_linear_default_63, aten.linear.default
Visiting: aten_linear_default_62, aten.linear.default
Visiting: aten_linear_default_61, aten.linear.default
Visiting: aten_view_copy_default_249, aten.view_copy.default
Visiting: aten_view_copy_default_247, aten.view_copy.default
Visiting: aten_view_copy_default_245, aten.view_copy.default
Visiting: aten_view_copy_default_250, aten.view_copy.default
Visiting: aten_view_copy_default_248, aten.view_copy.default
Visiting: aten_permute_copy_default_104, aten.permute_copy.default
Visiting: aten_view_copy_default_246, aten.view_copy.default
Visiting: aten_permute_copy_default_72, aten.permute_copy.default
Visiting: aten_permute_copy_default_70, aten.permute_copy.default
Visiting: aten_view_copy_default_257, aten.view_copy.default
Visiting: aten__to_copy_default_33, aten._to_copy.default
Visiting: aten_mul_tensor_20, aten.mul.Tensor
Visiting: aten_mul_tensor_21, aten.mul.Tensor
Visiting: aten_view_copy_default_253, aten.view_copy.default
Visiting: aten_view_copy_default_254, aten.view_copy.default
Visiting: aten__to_copy_default_34, aten._to_copy.default
Visiting: aten_bmm_default_20, aten.bmm.default
Visiting: aten_view_copy_default_255, aten.view_copy.default
Visiting: aten_add_tensor_32, aten.add.Tensor
Visiting: aten__safe_softmax_default_10, aten._safe_softmax.default
Visiting: aten_view_copy_default_256, aten.view_copy.default
Visiting: aten_bmm_default_21, aten.bmm.default
Visiting: aten_view_copy_default_258, aten.view_copy.default
Visiting: aten_permute_copy_default_74, aten.permute_copy.default
Visiting: aten__to_copy_default_35, aten._to_copy.default
Visiting: aten_permute_copy_default_105, aten.permute_copy.default
Visiting: aten_view_copy_default_259, aten.view_copy.default
Visiting: aten_view_copy_default_260, aten.view_copy.default
Visiting: aten_linear_default_64, aten.linear.default
Visiting: aten_view_copy_default_261, aten.view_copy.default
Visiting: aten_add_tensor_33, aten.add.Tensor
Visiting: aten_native_layer_norm_default_21, aten.native_layer_norm.default
Visiting: getitem_21, getitem
Visiting: aten_view_copy_default_262, aten.view_copy.default
Visiting: aten_linear_default_65, aten.linear.default
Visiting: aten_view_copy_default_263, aten.view_copy.default
Visiting: aten_gelu_default_10, aten.gelu.default
Visiting: aten_view_copy_default_264, aten.view_copy.default
Visiting: aten_linear_default_66, aten.linear.default
Visiting: aten_view_copy_default_265, aten.view_copy.default
Visiting: aten_add_tensor_34, aten.add.Tensor
Visiting: aten_native_layer_norm_default_22, aten.native_layer_norm.default
Visiting: getitem_22, getitem
Visiting: aten_view_copy_default_266, aten.view_copy.default
Visiting: aten_view_copy_default_267, aten.view_copy.default
Visiting: aten_view_copy_default_268, aten.view_copy.default
Visiting: aten_linear_default_69, aten.linear.default
Visiting: aten_linear_default_68, aten.linear.default
Visiting: aten_linear_default_67, aten.linear.default
Visiting: aten_view_copy_default_273, aten.view_copy.default
Visiting: aten_view_copy_default_271, aten.view_copy.default
Visiting: aten_view_copy_default_269, aten.view_copy.default
Visiting: aten_view_copy_default_274, aten.view_copy.default
Visiting: aten_view_copy_default_272, aten.view_copy.default
Visiting: aten_permute_copy_default_106, aten.permute_copy.default
Visiting: aten_view_copy_default_270, aten.view_copy.default
Visiting: aten_permute_copy_default_79, aten.permute_copy.default
Visiting: aten_permute_copy_default_77, aten.permute_copy.default
Visiting: aten_view_copy_default_281, aten.view_copy.default
Visiting: aten__to_copy_default_36, aten._to_copy.default
Visiting: aten_mul_tensor_22, aten.mul.Tensor
Visiting: aten_mul_tensor_23, aten.mul.Tensor
Visiting: aten_view_copy_default_277, aten.view_copy.default
Visiting: aten_view_copy_default_278, aten.view_copy.default
Visiting: aten__to_copy_default_37, aten._to_copy.default
Visiting: aten_bmm_default_22, aten.bmm.default
Visiting: aten_view_copy_default_279, aten.view_copy.default
Visiting: aten_add_tensor_35, aten.add.Tensor
Visiting: aten__safe_softmax_default_11, aten._safe_softmax.default
Visiting: aten_view_copy_default_280, aten.view_copy.default
Visiting: aten_bmm_default_23, aten.bmm.default
Visiting: aten_view_copy_default_282, aten.view_copy.default
Visiting: aten_permute_copy_default_81, aten.permute_copy.default
Visiting: aten__to_copy_default_38, aten._to_copy.default
Visiting: aten_permute_copy_default_107, aten.permute_copy.default
Visiting: aten_view_copy_default_283, aten.view_copy.default
Visiting: aten_view_copy_default_284, aten.view_copy.default
Visiting: aten_linear_default_70, aten.linear.default
Visiting: aten_view_copy_default_285, aten.view_copy.default
Visiting: aten_add_tensor_36, aten.add.Tensor
Visiting: aten_native_layer_norm_default_23, aten.native_layer_norm.default
Visiting: getitem_23, getitem
Visiting: aten_view_copy_default_286, aten.view_copy.default
Visiting: aten_linear_default_71, aten.linear.default
Visiting: aten_view_copy_default_287, aten.view_copy.default
Visiting: aten_gelu_default_11, aten.gelu.default
Visiting: aten_view_copy_default_288, aten.view_copy.default
Visiting: aten_linear_default_72, aten.linear.default
Visiting: aten_view_copy_default_289, aten.view_copy.default
Visiting: aten_add_tensor_37, aten.add.Tensor
Visiting: aten_native_layer_norm_default_24, aten.native_layer_norm.default
Visiting: getitem_24, getitem
Visiting: aten_view_copy_default_290, aten.view_copy.default
Visiting: aten_linear_default_73, aten.linear.default
Visiting: aten_view_copy_default_291, aten.view_copy.default
Visiting: aten_gelu_default_12, aten.gelu.default
Visiting: aten_native_layer_norm_default_25, aten.native_layer_norm.default
Visiting: getitem_25, getitem
Visiting: aten_view_copy_default_292, aten.view_copy.default
Visiting: aten_linear_default_74, aten.linear.default
Visiting: aten_view_copy_default_293, aten.view_copy.default
Visiting: quantized_decomposed_dequantize_per_tensor_tensor, quantized_decomposed.dequantize_per_tensor.tensor

====== DDR bandwidth summary ======
spill_bytes=4153344
fill_bytes=5701632
write_total_bytes=29593600
read_total_bytes=156844032

[INFO] [Qnn ExecuTorch]: Destroy Qnn context
/home/boyucwsl/.local/share/uv/python/cpython-3.11.14-linux-x86_64-gnu/lib/python3.11/copyreg.py:105: FutureWarning: `isinstance(treespec, LeafSpec)` is deprecated, use `isinstance(treespec, TreeSpec) and treespec.is_leaf()` instead.
  return cls.__new__(cls, *args)
Op aten.unbind.int was requested for preservation by partitioner.  This request is ignored because it is in a blocklist.
Creating new layout from 5 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 175.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[Observatory] Collected EdgeProgramManager EP in 11143.4 ms
[INFO] [Qnn ExecuTorch]: Destroy Qnn device
[INFO] [Qnn ExecuTorch]: Destroy Qnn backend
/home/boyucwsl/executorch/exir/tensor.py:83: FutureWarning: guard_size_oblivious will be removed. Consider using explicit unbacked handling     potentially utilizing guard_or_false, guard_or_true, or statically_known_true
  return guard_size_oblivious(self.stride < other.stride)
[PipelineGraphCollector] Uninstalled all patches
[AccuracyLens] Uninstalled all patches
[Observatory] Exported raw data to /home/boyucwsl/Executorch_Observatory_Demo/generated_reports/qualcomm/albert/observatory_report.json
Creating new layout from 537 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 161.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 145
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 145
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 224
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 224
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 246
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 246
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 265
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 265
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 12
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 12
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 123
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 123
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 230
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 230
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 199
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 199
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 150
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 150
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 278
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 278
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 166
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 166
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 108
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 108
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
Creating new layout from 1430 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 252.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 745
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 130
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
Creating new layout from 1430 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 252.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 745
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 130
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
Creating new layout from 2206 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 350.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1523
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1313
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
Creating new layout from 2206 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 350.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1516
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1329
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
Creating new layout from 2206 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 350.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1516
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1329
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
Creating new layout from 2232 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 350.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 54
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 1087
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
Creating new layout from 1182 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 161.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 98
Updating node ranks
Updating outdated cut values
Remove outtdated cut_values, in order to calculate new ones
Calculating cut values of tree edges
updatig low, lim and parent values, starting from: 189
Updating node ranks
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
Creating new layout from 5 edges
Splitting graph into its connected components
Initializing graphs vertex weights
Start building layout
Configuration is: Config { minimum_length: 1, vertex_spacing: 175.0, dummy_vertices: true, dummy_size: 1.0, ranking_type: MinimizeEdgeLength, c_minimization: Median, transpose: true, check_layout: true, encode_edges: false }
Executing phase 0: Cycle Removal
Graph contains no cycle
Executing phase 1: Ranking
Start ranking, ranking type: MinimizeEdgeLength, minimum_length: 1
Initializing ranks via topological sort.
building feasible tree
Trying to build tight tree.
Initializing cut values
Calculating cut values of tree edges
initialzing low, lim and parent values of vertices
Executing phase 2: Crossing Reduction
Inserting dummy vertices for edges spanning more than 1 ranks
Initializing order of vertices in each rank via dfs.
Reducing crossings via bilayer sweep
Didn't improve after 4 sweeps, returning
Executing phase 3: Coordinate Calculation
Creating individual layouts for coordinate calculation
Marking type one conflicts (edge crossings between dummy vertices and non dummy vertices)
creating layouts for vertical direction: Down, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Down, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Right
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
creating layouts for vertical direction: Up, horizontal direction Left
Creating vertical alignments
calculating coordinates for layout.
Placing vertices in blocks.
move blocks as close together as possible
Aligning all layouts to the one with the smallest width
Calculate relative coordinates, by taking average between two medians of absolute x-coordinates for each layout direction
[Observatory] Exported HTML report to /home/boyucwsl/Executorch_Observatory_Demo/generated_reports/qualcomm/albert/observatory_report.html
[Observatory CLI] Reports: html=/home/boyucwsl/Executorch_Observatory_Demo/generated_reports/qualcomm/albert/observatory_report.html json=/home/boyucwsl/Executorch_Observatory_Demo/generated_reports/qualcomm/albert/observatory_report.json (9 records: Exported Float, Annotated Model, Calibrated Model, Quantized Model, Pre-EdgeTransform/forward, ETRecord Exported/forward, ETRecord Edge/forward, ETRecord Extra/edge_after_transform/forward, EdgeProgramManager EP)

[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.gelu.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten._safe_softmax.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.bmm.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.mul.Tensor | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.where.self | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.permute_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.linear.default | True
[QNN Partitioner Op Support]: aten.view_copy.default | True
[QNN Partitioner Op Support]: aten.native_layer_norm.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.embedding.default | True
[QNN Partitioner Op Support]: aten.add.Tensor | True
[QNN Partitioner Op Support]: aten.embedding.default | True
[QNN Partitioner Op Support]: aten.embedding.default | True
[QNN Partitioner Op Support]: aten.gather.default | True
[QNN Partitioner Op Support]: aten._to_copy.default | True
[QNN Partitioner Op Support]: aten.slice_copy.Tensor | True
[QNN Partitioner Op Support]: aten._to_copy.default | True
[QNN Partitioner Op Support]: aten._to_copy.default | True
Building graph payload model...
Running fast-sugiyama layout...
[FX Graph Viewer] Compiling base graph payload...
[ FX Graph Viewer ] Compiling extension payloads...
Running fast-sugiyama layout...
Running fast-sugiyama layout...
Running fast-sugiyama layout...
Running fast-sugiyama layout...
Running fast-sugiyama layout...
Running fast-sugiyama layout...
Running fast-sugiyama layout...
Running fast-sugiyama layout...
Running fast-sugiyama layout...
$ bash -lc 'source /home/boyucwsl/executorch/qairt/2.37.0.250724/bin/envsetup.sh && python -m executorch.backends.qualcomm.debugger.observatory --output-html /home/boyucwsl/Executorch_Observatory_Demo/generated_reports/qualcomm/albert/observatory_report.html --output-json /home/boyucwsl/Executorch_Observatory_Demo/generated_reports/qualcomm/albert/observatory_report.json --lens_recipe accuracy examples/qualcomm/oss_scripts/albert.py -m SM8650 -b ./build-android --dataset /home/boyucwsl/executorch/wikisent2.txt -H mlgtw-linux -s bebcca9b -a /home/boyucwsl/Executorch_Observatory_Demo/generated_reports/qualcomm/albert/artifacts --seed 1126 --compile_only'