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

About the Execution of LTSMin+red for ShieldIIPt-PT-050A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1443.399 117505.00 177791.00 325.50 ???T????T??????T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760800322.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPt-PT-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760800322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 23:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 22:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 22:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 265K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-050A-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717238680127

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:44:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:44:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:44:41] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-06-01 10:44:41] [INFO ] Transformed 953 places.
[2024-06-01 10:44:41] [INFO ] Transformed 703 transitions.
[2024-06-01 10:44:41] [INFO ] Found NUPN structural information;
[2024-06-01 10:44:41] [INFO ] Parsed PT model containing 953 places and 703 transitions and 3006 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-050A-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 193 out of 953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 73 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2024-06-01 10:44:41] [INFO ] Computed 451 invariants in 30 ms
[2024-06-01 10:44:42] [INFO ] Implicit Places using invariants in 736 ms returned []
[2024-06-01 10:44:42] [INFO ] Invariant cache hit.
[2024-06-01 10:44:43] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
Running 701 sub problems to find dead transitions.
[2024-06-01 10:44:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/952 variables, 952/952 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/952 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (OVERLAPS) 1/953 variables, 451/1403 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/953 variables, 1/1404 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/1655 variables, and 1404 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30045 ms.
Refiners :[Domain max(s): 953/953 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/953 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/952 variables, 952/952 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/952 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (OVERLAPS) 1/953 variables, 451/1403 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/953 variables, 1/1404 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/953 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (OVERLAPS) 702/1655 variables, 953/2357 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1655 variables, 701/3058 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1655/1655 variables, and 3058 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30026 ms.
Refiners :[Domain max(s): 953/953 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 953/953 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 0/0 constraints]
After SMT, in 60444ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Finished structural reductions in LTL mode , in 1 iterations and 62231 ms. Remains : 953/953 places, 702/702 transitions.
Support contains 193 out of 953 places after structural reductions.
[2024-06-01 10:45:44] [INFO ] Flatten gal took : 151 ms
[2024-06-01 10:45:44] [INFO ] Flatten gal took : 67 ms
[2024-06-01 10:45:44] [INFO ] Input system was already deterministic with 702 transitions.
Support contains 188 out of 953 places (down from 193) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 72 to 71
RANDOM walk for 40000 steps (8 resets) in 2644 ms. (15 steps per ms) remains 52/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
[2024-06-01 10:45:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 143/284 variables, 131/272 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 143/415 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 669/953 variables, 320/735 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 669/1404 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/953 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 702/1655 variables, 953/2357 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1655 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/1655 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1655/1655 variables, and 2357 constraints, problems are : Problem set: 0 solved, 52 unsolved in 4268 ms.
Refiners :[Domain max(s): 953/953 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 953/953 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 143/284 variables, 131/272 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 143/415 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 669/953 variables, 320/735 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 669/1404 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/953 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 702/1655 variables, 953/2357 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1655 variables, 52/2409 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1655/1655 variables, and 2409 constraints, problems are : Problem set: 0 solved, 52 unsolved in 5013 ms.
Refiners :[Domain max(s): 953/953 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 953/953 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 9322ms problems are : Problem set: 0 solved, 52 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 141 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Partial Free-agglomeration rule applied 84 times.
Drop transitions (Partial Free agglomeration) removed 84 transitions
Iterating global reduction 0 with 84 rules applied. Total rules applied 86 place count 952 transition count 701
Applied a total of 86 rules in 153 ms. Remains 952 /953 variables (removed 1) and now considering 701/702 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 952/953 places, 701/702 transitions.
RANDOM walk for 40000 steps (8 resets) in 1731 ms. (23 steps per ms) remains 41/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
// Phase 1: matrix 701 rows 952 cols
[2024-06-01 10:45:56] [INFO ] Computed 451 invariants in 3 ms
[2024-06-01 10:45:56] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 117/234 variables, 109/226 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 117/343 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 718/952 variables, 342/685 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 718/1403 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 701/1653 variables, 952/2355 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 41/2396 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 0/2396 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/1653 variables, 0/2396 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 2396 constraints, problems are : Problem set: 0 solved, 41 unsolved in 3923 ms.
Refiners :[Domain max(s): 952/952 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 952/952 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 117/234 variables, 109/226 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 117/343 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 718/952 variables, 342/685 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 718/1403 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 701/1653 variables, 952/2355 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 41/2396 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 41/2437 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1653 variables, 0/2437 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/1653 variables, 0/2437 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 2437 constraints, problems are : Problem set: 0 solved, 41 unsolved in 11446 ms.
Refiners :[Domain max(s): 952/952 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 952/952 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 15417ms problems are : Problem set: 0 solved, 41 unsolved
Fused 41 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 15810 ms.
Support contains 117 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 701/701 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 952 transition count 701
Applied a total of 5 rules in 97 ms. Remains 952 /952 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 952/952 places, 701/701 transitions.
RANDOM walk for 40000 steps (8 resets) in 780 ms. (51 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
Interrupted probabilistic random walk after 194210 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :40 out of 41
Probabilistic random walk after 194210 steps, saw 191647 distinct states, run finished after 3005 ms. (steps per millisecond=64 ) properties seen :40
// Phase 1: matrix 701 rows 952 cols
[2024-06-01 10:46:31] [INFO ] Computed 451 invariants in 10 ms
[2024-06-01 10:46:31] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 938/952 variables, 445/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 938/1403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 701/1653 variables, 952/2355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 43/2398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 0/2398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1653 variables, 0/2398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 2398 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Domain max(s): 952/952 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 952/952 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 938/952 variables, 445/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 938/1403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 701/1653 variables, 952/2355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 43/2398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 1/2399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1653 variables, 0/2399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1653 variables, 0/2399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 2399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 756 ms.
Refiners :[Domain max(s): 952/952 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 952/952 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1246ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 116657 steps, including 598 resets, run visited all 1 properties in 1092 ms. (steps per millisecond=106 )
Parikh walk visited 1 properties in 1097 ms.
[2024-06-01 10:46:33] [INFO ] Flatten gal took : 50 ms
[2024-06-01 10:46:33] [INFO ] Flatten gal took : 58 ms
[2024-06-01 10:46:33] [INFO ] Input system was already deterministic with 702 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 21 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:34] [INFO ] Flatten gal took : 41 ms
[2024-06-01 10:46:34] [INFO ] Flatten gal took : 43 ms
[2024-06-01 10:46:34] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 22 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:34] [INFO ] Flatten gal took : 37 ms
[2024-06-01 10:46:34] [INFO ] Flatten gal took : 40 ms
[2024-06-01 10:46:34] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 14 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:34] [INFO ] Flatten gal took : 36 ms
[2024-06-01 10:46:34] [INFO ] Flatten gal took : 37 ms
[2024-06-01 10:46:34] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 69 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 951/953 places, 700/702 transitions.
[2024-06-01 10:46:34] [INFO ] Flatten gal took : 39 ms
[2024-06-01 10:46:34] [INFO ] Flatten gal took : 41 ms
[2024-06-01 10:46:34] [INFO ] Input system was already deterministic with 700 transitions.
RANDOM walk for 40000 steps (8 resets) in 624 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 24393 steps, run visited all 1 properties in 247 ms. (steps per millisecond=98 )
Probabilistic random walk after 24393 steps, saw 23557 distinct states, run finished after 251 ms. (steps per millisecond=97 ) properties seen :1
FORMULA ShieldIIPt-PT-050A-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 14 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 34 ms
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 37 ms
[2024-06-01 10:46:35] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 13 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 35 ms
[2024-06-01 10:46:35] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 14 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 35 ms
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:35] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 13 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:35] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 49 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 951/953 places, 700/702 transitions.
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 31 ms
[2024-06-01 10:46:35] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:46:35] [INFO ] Input system was already deterministic with 700 transitions.
RANDOM walk for 40000 steps (8 resets) in 371 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20564 steps, run visited all 1 properties in 206 ms. (steps per millisecond=99 )
Probabilistic random walk after 20564 steps, saw 19778 distinct states, run finished after 207 ms. (steps per millisecond=99 ) properties seen :1
FORMULA ShieldIIPt-PT-050A-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 45 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 951/953 places, 700/702 transitions.
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:36] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 12 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 34 ms
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:36] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 43 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 951/953 places, 700/702 transitions.
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:36] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 43 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 951/953 places, 700/702 transitions.
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:36] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 12 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 31 ms
[2024-06-01 10:46:36] [INFO ] Flatten gal took : 32 ms
[2024-06-01 10:46:37] [INFO ] Input system was already deterministic with 702 transitions.
Starting structural reductions in LTL mode, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 12 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 953/953 places, 702/702 transitions.
[2024-06-01 10:46:37] [INFO ] Flatten gal took : 31 ms
[2024-06-01 10:46:37] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:37] [INFO ] Input system was already deterministic with 702 transitions.
[2024-06-01 10:46:37] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:37] [INFO ] Flatten gal took : 33 ms
[2024-06-01 10:46:37] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 10:46:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 953 places, 702 transitions and 3004 arcs took 6 ms.
Total runtime 116002 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPt-PT-050A-CTLFireability-2023-14

BK_STOP 1717238797632

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/548/ctl_0_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/548/ctl_1_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/548/ctl_2_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/548/ctl_3_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/548/ctl_4_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/548/ctl_5_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/548/ctl_6_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/548/ctl_7_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/548/ctl_8_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/548/ctl_9_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/548/ctl_10_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/548/ctl_11_
ctl formula name ShieldIIPt-PT-050A-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/548/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-050A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760800322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050A.tgz
mv ShieldIIPt-PT-050A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;