About the Execution of LTSMin+red for ShieldIIPs-PT-030A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 747.336 | 75768.00 | 130743.00 | 208.00 | [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-171683760400114.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 ShieldIIPs-PT-030A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760400114
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 11 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 11 15:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 15:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 253K 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 ShieldIIPs-PT-030A-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-030A-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717227119219
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:32:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:32:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:32:00] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-01 07:32:00] [INFO ] Transformed 753 places.
[2024-06-01 07:32:00] [INFO ] Transformed 723 transitions.
[2024-06-01 07:32:00] [INFO ] Found NUPN structural information;
[2024-06-01 07:32:00] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 210 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 58 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:32:00] [INFO ] Computed 271 invariants in 29 ms
[2024-06-01 07:32:01] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-06-01 07:32:01] [INFO ] Invariant cache hit.
[2024-06-01 07:32:02] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
Running 722 sub problems to find dead transitions.
[2024-06-01 07:32:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 271/1023 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1024 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 14 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:32:25] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:32:26] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:32:27] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:32:27] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:32:27] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:32:27] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:32:27] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:32:28] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:32:28] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:32:28] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:32:28] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 20/1044 constraints. Problems are: Problem set: 0 solved, 722 unsolved
[2024-06-01 07:32:31] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:32:31] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:32:31] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:32:31] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:32:32] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:32:32] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
SMT process timed out in 30457ms, After SMT, problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 30482ms
Finished structural reductions in LTL mode , in 1 iterations and 31874 ms. Remains : 753/753 places, 723/723 transitions.
Support contains 210 out of 753 places after structural reductions.
[2024-06-01 07:32:33] [INFO ] Flatten gal took : 137 ms
[2024-06-01 07:32:33] [INFO ] Flatten gal took : 72 ms
[2024-06-01 07:32:33] [INFO ] Input system was already deterministic with 723 transitions.
RANDOM walk for 40000 steps (24 resets) in 2304 ms. (17 steps per ms) remains 7/86 properties
BEST_FIRST walk for 40003 steps (8 resets) in 325 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
[2024-06-01 07:32:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 85/123 variables, 37/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 85/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 630/753 variables, 234/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 630/1024 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 723/1476 variables, 753/1777 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 5 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:32:37] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1476 variables, 18/1795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1476 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1476 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1476/1476 variables, and 1795 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2605 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 85/123 variables, 37/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 85/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 630/753 variables, 234/394 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 630/1024 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 18/1042 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 723/1476 variables, 753/1795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1476 variables, 6/1801 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:32:38] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1476 variables, 1/1802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1476 variables, 1/1803 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1476 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1476 variables, 0/1803 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 1803 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3064 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 20/20 constraints]
After SMT, in 5695ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 13277 ms.
Support contains 25 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
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 752 transition count 722
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 751 transition count 721
Partial Free-agglomeration rule applied 197 times.
Drop transitions (Partial Free agglomeration) removed 197 transitions
Iterating global reduction 0 with 197 rules applied. Total rules applied 201 place count 751 transition count 721
Applied a total of 201 rules in 139 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 751/753 places, 721/723 transitions.
RANDOM walk for 40000 steps (15 resets) in 1187 ms. (33 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 07:32:54] [INFO ] Computed 271 invariants in 23 ms
[2024-06-01 07:32:54] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 46/65 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 46/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 670/735 variables, 244/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 670/998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16/751 variables, 8/1006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 16/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 721/1472 variables, 751/1773 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1472 variables, 4/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1472 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1472 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1472/1472 variables, and 1777 constraints, problems are : Problem set: 0 solved, 3 unsolved in 563 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 751/751 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 46/65 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 46/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 670/735 variables, 244/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 670/998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:32:55] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:32:55] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 2/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 16/751 variables, 8/1008 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 16/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 721/1472 variables, 751/1775 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1472 variables, 4/1779 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1472 variables, 3/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 8 ms to minimize.
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:32:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1472 variables, 14/1796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:32:57] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1472 variables, 5/1801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:32:58] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:32:58] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:32:58] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1472 variables, 3/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1472 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1472 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1472/1472 variables, and 1804 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3773 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 751/751 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 24/24 constraints]
After SMT, in 4376ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3047 ms.
Support contains 19 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 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 751 transition count 721
Applied a total of 3 rules in 72 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 751/751 places, 721/721 transitions.
RANDOM walk for 40000 steps (12 resets) in 489 ms. (81 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 07:33:02] [INFO ] Computed 271 invariants in 11 ms
[2024-06-01 07:33:02] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 29/41 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 29/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 694/735 variables, 251/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 694/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 4/1002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/751 variables, 8/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 16/1026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:33:02] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 721/1472 variables, 751/1778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1472 variables, 4/1782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:33:03] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:33:04] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1472 variables, 12/1794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1472 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1472 variables, 0/1794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1472/1472 variables, and 1794 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2720 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 751/751 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 29/41 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 29/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 694/735 variables, 251/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 694/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 14/1012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:33:05] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:33:05] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 2/1014 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/735 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/751 variables, 8/1022 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 16/1038 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 3/1041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 721/1472 variables, 751/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1472 variables, 4/1796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1472 variables, 2/1798 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:33:05] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:33:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:33:06] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:33:06] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1472 variables, 4/1802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:33:06] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:33:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1472 variables, 2/1804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:33:06] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:33:06] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:33:06] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1472 variables, 3/1807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1472 variables, 2/1809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1472 variables, 3/1812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1472 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1472 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1472/1472 variables, and 1812 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2949 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 263/263 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 751/751 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints]
After SMT, in 5696ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3305 ms.
Support contains 12 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 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 751 transition count 721
Applied a total of 3 rules in 45 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 751/751 places, 721/721 transitions.
RANDOM walk for 40000 steps (11 resets) in 539 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 44064 steps, run visited all 2 properties in 579 ms. (steps per millisecond=76 )
Probabilistic random walk after 44064 steps, saw 41785 distinct states, run finished after 585 ms. (steps per millisecond=75 ) properties seen :2
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 46 ms
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 46 ms
[2024-06-01 07:33:12] [INFO ] Input system was already deterministic with 723 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 37 ms
[2024-06-01 07:33:12] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 10 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:33:12] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 31 ms
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 32 ms
[2024-06-01 07:33:12] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:33:12] [INFO ] Flatten gal took : 31 ms
[2024-06-01 07:33:12] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
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 752 transition count 722
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 751 transition count 721
Applied a total of 4 rules in 43 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 751/753 places, 721/723 transitions.
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 40 ms
[2024-06-01 07:33:13] [INFO ] Input system was already deterministic with 721 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:33:13] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:33:13] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:33:13] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:33:13] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 30 ms
[2024-06-01 07:33:13] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:33:13] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
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 752 transition count 722
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 751 transition count 721
Applied a total of 4 rules in 33 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 751/753 places, 721/723 transitions.
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:33:13] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:33:14] [INFO ] Input system was already deterministic with 721 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:33:14] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:33:14] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:33:14] [INFO ] Input system was already deterministic with 723 transitions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 7 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 753/753 places, 723/723 transitions.
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:33:14] [INFO ] Input system was already deterministic with 723 transitions.
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:33:14] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:33:14] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 07:33:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 753 places, 723 transitions and 3246 arcs took 8 ms.
Total runtime 74280 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 : ShieldIIPs-PT-030A-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-08
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPs-PT-030A-CTLFireability-2023-15
BK_STOP 1717227194987
--------------------
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 ShieldIIPs-PT-030A-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/847/ctl_0_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/847/ctl_1_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/847/ctl_2_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/847/ctl_3_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/847/ctl_4_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/847/ctl_5_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/847/ctl_6_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/847/ctl_7_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/847/ctl_8_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/847/ctl_9_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/847/ctl_10_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/847/ctl_11_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/847/ctl_12_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/847/ctl_13_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/847/ctl_14_
ctl formula name ShieldIIPs-PT-030A-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/847/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="ShieldIIPs-PT-030A"
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 ShieldIIPs-PT-030A, 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-171683760400114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030A.tgz
mv ShieldIIPs-PT-030A 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 ;