About the Execution of LTSMin+red for ShieldIIPt-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1533.619 | 177546.00 | 270725.00 | 373.70 | [undef] | Cannot compute |
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-171683760900338.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-100A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760900338
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.5K 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.3K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 13 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 00:03 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 539K 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-100A-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-100A-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717240251160
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-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:10:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:10:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:10:52] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-06-01 11:10:52] [INFO ] Transformed 1903 places.
[2024-06-01 11:10:52] [INFO ] Transformed 1403 transitions.
[2024-06-01 11:10:52] [INFO ] Found NUPN structural information;
[2024-06-01 11:10:52] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 169 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 182 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-06-01 11:10:52] [INFO ] Computed 901 invariants in 34 ms
[2024-06-01 11:10:54] [INFO ] Implicit Places using invariants in 1389 ms returned []
[2024-06-01 11:10:54] [INFO ] Invariant cache hit.
[2024-06-01 11:10:56] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned []
Implicit Place search using SMT with State Equation took 3529 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-06-01 11:10:56] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30071 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30027 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 61048ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 61076ms
Finished structural reductions in LTL mode , in 1 iterations and 64815 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Support contains 169 out of 1903 places after structural reductions.
[2024-06-01 11:11:58] [INFO ] Flatten gal took : 399 ms
[2024-06-01 11:11:58] [INFO ] Flatten gal took : 150 ms
[2024-06-01 11:11:58] [INFO ] Input system was already deterministic with 1402 transitions.
Support contains 165 out of 1903 places (down from 169) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2622 ms. (15 steps per ms) remains 63/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (8 resets) in 72 ms. (54 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 63/63 properties
Interrupted probabilistic random walk after 63076 steps, run timeout after 3004 ms. (steps per millisecond=20 ) properties seen :28 out of 63
Probabilistic random walk after 63076 steps, saw 62153 distinct states, run finished after 3021 ms. (steps per millisecond=20 ) properties seen :28
[2024-06-01 11:12:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 96/180 variables, 83/167 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 96/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1723/1903 variables, 818/1081 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1723/2804 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3305/3305 variables, and 4707 constraints, problems are : Problem set: 0 solved, 35 unsolved in 4998 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 96/180 variables, 83/167 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 96/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1723/1903 variables, 818/1081 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1723/2804 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 35/4742 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3305/3305 variables, and 4742 constraints, problems are : Problem set: 0 solved, 35 unsolved in 5021 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 10063ms problems are : Problem set: 0 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
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 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 185 times.
Drop transitions (Partial Free agglomeration) removed 185 transitions
Iterating global reduction 0 with 185 rules applied. Total rules applied 189 place count 1901 transition count 1400
Applied a total of 189 rules in 502 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 1901/1903 places, 1400/1402 transitions.
RANDOM walk for 40000 steps (8 resets) in 1600 ms. (24 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 66071 steps, run timeout after 3021 ms. (steps per millisecond=21 ) properties seen :11 out of 35
Probabilistic random walk after 66071 steps, saw 64769 distinct states, run finished after 3021 ms. (steps per millisecond=21 ) properties seen :11
// Phase 1: matrix 1400 rows 1901 cols
[2024-06-01 11:12:18] [INFO ] Computed 901 invariants in 8 ms
[2024-06-01 11:12:18] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 67/126 variables, 58/117 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 67/184 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1775/1901 variables, 843/1027 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1775/2802 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 92/4795 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 0/4795 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/3301 variables, 0/4795 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3301/3301 variables, and 4795 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4257 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 67/126 variables, 58/117 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 67/184 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1775/1901 variables, 843/1027 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1775/2802 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 92/4795 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 24/4819 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3301 variables, 0/4819 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/3301 variables, 0/4819 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3301/3301 variables, and 4819 constraints, problems are : Problem set: 0 solved, 24 unsolved in 14007 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 18319ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 26316 ms.
Support contains 59 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 122 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 1901/1901 places, 1400/1400 transitions.
RANDOM walk for 40000 steps (8 resets) in 1220 ms. (32 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 69168 steps, run timeout after 3003 ms. (steps per millisecond=23 ) properties seen :3 out of 24
Probabilistic random walk after 69168 steps, saw 67850 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :3
// Phase 1: matrix 1400 rows 1901 cols
[2024-06-01 11:13:07] [INFO ] Computed 901 invariants in 9 ms
[2024-06-01 11:13:07] [INFO ] State equation strengthened by 95 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 61/111 variables, 51/101 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 61/162 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 1790/1901 variables, 850/1012 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1790/2802 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 95/4798 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 0/4798 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/3301 variables, 0/4798 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3301/3301 variables, and 4798 constraints, problems are : Problem set: 0 solved, 21 unsolved in 4070 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 61/111 variables, 51/101 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 61/162 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 1790/1901 variables, 850/1012 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1790/2802 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 95/4798 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 21/4819 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3301 variables, 0/4819 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/3301 variables, 0/4819 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3301/3301 variables, and 4819 constraints, problems are : Problem set: 0 solved, 21 unsolved in 13395 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 17509ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 16991 ms.
Support contains 50 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1901 transition count 1400
Applied a total of 3 rules in 134 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 1901/1901 places, 1400/1400 transitions.
[2024-06-01 11:13:41] [INFO ] Flatten gal took : 107 ms
[2024-06-01 11:13:41] [INFO ] Flatten gal took : 111 ms
[2024-06-01 11:13:42] [INFO ] Input system was already deterministic with 1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
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 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 1901 transition count 1400
Applied a total of 4 rules in 132 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 133 ms. Remains : 1901/1903 places, 1400/1402 transitions.
[2024-06-01 11:13:42] [INFO ] Flatten gal took : 99 ms
[2024-06-01 11:13:42] [INFO ] Flatten gal took : 107 ms
[2024-06-01 11:13:42] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 40 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:42] [INFO ] Flatten gal took : 95 ms
[2024-06-01 11:13:42] [INFO ] Flatten gal took : 104 ms
[2024-06-01 11:13:42] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 41 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:43] [INFO ] Flatten gal took : 94 ms
[2024-06-01 11:13:43] [INFO ] Flatten gal took : 100 ms
[2024-06-01 11:13:43] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
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 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 1901 transition count 1400
Applied a total of 4 rules in 120 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 120 ms. Remains : 1901/1903 places, 1400/1402 transitions.
[2024-06-01 11:13:43] [INFO ] Flatten gal took : 92 ms
[2024-06-01 11:13:43] [INFO ] Flatten gal took : 100 ms
[2024-06-01 11:13:43] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 41 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:43] [INFO ] Flatten gal took : 91 ms
[2024-06-01 11:13:43] [INFO ] Flatten gal took : 93 ms
[2024-06-01 11:13:44] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 41 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:44] [INFO ] Flatten gal took : 89 ms
[2024-06-01 11:13:44] [INFO ] Flatten gal took : 92 ms
[2024-06-01 11:13:44] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 41 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:44] [INFO ] Flatten gal took : 90 ms
[2024-06-01 11:13:44] [INFO ] Flatten gal took : 95 ms
[2024-06-01 11:13:44] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
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 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 1901 transition count 1400
Applied a total of 4 rules in 136 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 138 ms. Remains : 1901/1903 places, 1400/1402 transitions.
[2024-06-01 11:13:45] [INFO ] Flatten gal took : 89 ms
[2024-06-01 11:13:45] [INFO ] Flatten gal took : 93 ms
[2024-06-01 11:13:45] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 43 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:45] [INFO ] Flatten gal took : 98 ms
[2024-06-01 11:13:45] [INFO ] Flatten gal took : 99 ms
[2024-06-01 11:13:45] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
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 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 1901 transition count 1400
Applied a total of 4 rules in 108 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 110 ms. Remains : 1901/1903 places, 1400/1402 transitions.
[2024-06-01 11:13:45] [INFO ] Flatten gal took : 92 ms
[2024-06-01 11:13:45] [INFO ] Flatten gal took : 96 ms
[2024-06-01 11:13:45] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
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 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 1901 transition count 1400
Applied a total of 4 rules in 100 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 1901/1903 places, 1400/1402 transitions.
[2024-06-01 11:13:46] [INFO ] Flatten gal took : 89 ms
[2024-06-01 11:13:46] [INFO ] Flatten gal took : 93 ms
[2024-06-01 11:13:46] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 46 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:46] [INFO ] Flatten gal took : 89 ms
[2024-06-01 11:13:46] [INFO ] Flatten gal took : 91 ms
[2024-06-01 11:13:46] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 40 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:46] [INFO ] Flatten gal took : 95 ms
[2024-06-01 11:13:46] [INFO ] Flatten gal took : 97 ms
[2024-06-01 11:13:47] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 39 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:47] [INFO ] Flatten gal took : 91 ms
[2024-06-01 11:13:47] [INFO ] Flatten gal took : 90 ms
[2024-06-01 11:13:47] [INFO ] Input system was already deterministic with 1402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1903/1903 places, 1402/1402 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 1903 transition count 1401
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 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 1901 transition count 1400
Applied a total of 4 rules in 106 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 106 ms. Remains : 1901/1903 places, 1400/1402 transitions.
[2024-06-01 11:13:47] [INFO ] Flatten gal took : 97 ms
[2024-06-01 11:13:47] [INFO ] Flatten gal took : 89 ms
[2024-06-01 11:13:47] [INFO ] Input system was already deterministic with 1400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 40 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 1903/1903 places, 1402/1402 transitions.
[2024-06-01 11:13:47] [INFO ] Flatten gal took : 87 ms
[2024-06-01 11:13:47] [INFO ] Flatten gal took : 90 ms
[2024-06-01 11:13:48] [INFO ] Input system was already deterministic with 1402 transitions.
[2024-06-01 11:13:48] [INFO ] Flatten gal took : 89 ms
[2024-06-01 11:13:48] [INFO ] Flatten gal took : 90 ms
[2024-06-01 11:13:48] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 11:13:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1903 places, 1402 transitions and 6004 arcs took 9 ms.
Total runtime 176089 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-08
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPt-PT-100A-CTLFireability-2023-15
BK_STOP 1717240428706
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-100A-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/556/ctl_0_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/556/ctl_1_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/556/ctl_2_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/556/ctl_3_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/556/ctl_4_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/556/ctl_5_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/556/ctl_6_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/556/ctl_7_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/556/ctl_8_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/556/ctl_9_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/556/ctl_10_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/556/ctl_11_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/556/ctl_12_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/556/ctl_13_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/556/ctl_14_
ctl formula name ShieldIIPt-PT-100A-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/556/ctl_15_
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-100A"
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-100A, 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-171683760900338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100A.tgz
mv ShieldIIPt-PT-100A 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 '
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 ;