About the Execution of LTSMin+red for ShieldRVs-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 729.871 | 73625.00 | 113828.00 | 218.10 | [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-171683761900810.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 ShieldRVs-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761900810
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 244K 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 ShieldRVs-PT-020B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717266331143
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:25:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:25:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:25:32] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-01 18:25:32] [INFO ] Transformed 803 places.
[2024-06-01 18:25:32] [INFO ] Transformed 903 transitions.
[2024-06-01 18:25:32] [INFO ] Found NUPN structural information;
[2024-06-01 18:25:32] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 199 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 903/903 transitions.
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 109 place count 694 transition count 794
Iterating global reduction 0 with 109 rules applied. Total rules applied 218 place count 694 transition count 794
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 693 transition count 793
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 693 transition count 793
Applied a total of 220 rules in 127 ms. Remains 693 /803 variables (removed 110) and now considering 793/903 (removed 110) transitions.
// Phase 1: matrix 793 rows 693 cols
[2024-06-01 18:25:32] [INFO ] Computed 81 invariants in 19 ms
[2024-06-01 18:25:33] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 18:25:33] [INFO ] Invariant cache hit.
[2024-06-01 18:25:33] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
Running 792 sub problems to find dead transitions.
[2024-06-01 18:25:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (OVERLAPS) 1/693 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 18:25:49] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 22 ms to minimize.
[2024-06-01 18:25:49] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-06-01 18:25:49] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-06-01 18:25:49] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:25:50] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:25:50] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-06-01 18:25:50] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-01 18:25:50] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 3 ms to minimize.
[2024-06-01 18:25:50] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-06-01 18:25:50] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 4 ms to minimize.
[2024-06-01 18:25:51] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 3 ms to minimize.
[2024-06-01 18:25:51] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-06-01 18:25:51] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-06-01 18:25:51] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:25:51] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-06-01 18:25:51] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-06-01 18:25:52] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 6 ms to minimize.
[2024-06-01 18:25:52] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 3 ms to minimize.
[2024-06-01 18:25:52] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:25:52] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 18:25:53] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 3 ms to minimize.
[2024-06-01 18:25:53] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-06-01 18:25:53] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-06-01 18:25:53] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-06-01 18:25:53] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:25:54] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:25:54] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:25:54] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 3 ms to minimize.
[2024-06-01 18:25:54] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 4 ms to minimize.
[2024-06-01 18:25:54] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 3 ms to minimize.
[2024-06-01 18:25:55] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 3 ms to minimize.
[2024-06-01 18:25:55] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2024-06-01 18:25:55] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 18:25:55] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-01 18:25:55] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 5 ms to minimize.
[2024-06-01 18:25:55] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-01 18:25:55] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-06-01 18:25:56] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:25:56] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 18:25:56] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 693/1486 variables, and 121 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/693 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (OVERLAPS) 1/693 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/693 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 18:26:12] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 3 ms to minimize.
[2024-06-01 18:26:12] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-06-01 18:26:12] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2024-06-01 18:26:12] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-06-01 18:26:12] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:26:13] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2024-06-01 18:26:13] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2024-06-01 18:26:13] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-06-01 18:26:13] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:26:13] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-06-01 18:26:13] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-06-01 18:26:13] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 3 ms to minimize.
[2024-06-01 18:26:13] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 3 ms to minimize.
[2024-06-01 18:26:14] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2024-06-01 18:26:14] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:26:14] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-06-01 18:26:14] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 3 ms to minimize.
[2024-06-01 18:26:14] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-06-01 18:26:15] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-06-01 18:26:15] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 18:26:15] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-06-01 18:26:15] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:26:16] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 4 ms to minimize.
[2024-06-01 18:26:16] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 3 ms to minimize.
[2024-06-01 18:26:16] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 2 ms to minimize.
[2024-06-01 18:26:16] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 3 ms to minimize.
[2024-06-01 18:26:16] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 3 ms to minimize.
[2024-06-01 18:26:16] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 3 ms to minimize.
[2024-06-01 18:26:17] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-06-01 18:26:17] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:26:17] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:26:17] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2024-06-01 18:26:17] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 3 ms to minimize.
[2024-06-01 18:26:17] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 1 ms to minimize.
[2024-06-01 18:26:18] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
[2024-06-01 18:26:18] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-06-01 18:26:18] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-06-01 18:26:19] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-06-01 18:26:19] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:26:19] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 18:26:19] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 3 ms to minimize.
[2024-06-01 18:26:20] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2024-06-01 18:26:20] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 2 ms to minimize.
[2024-06-01 18:26:20] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 3 ms to minimize.
[2024-06-01 18:26:21] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-06-01 18:26:21] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 2 ms to minimize.
[2024-06-01 18:26:21] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-06-01 18:26:21] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 4 ms to minimize.
[2024-06-01 18:26:22] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:26:22] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 3 ms to minimize.
[2024-06-01 18:26:22] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-06-01 18:26:22] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 3 ms to minimize.
[2024-06-01 18:26:22] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 4 ms to minimize.
[2024-06-01 18:26:23] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 3 ms to minimize.
[2024-06-01 18:26:23] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 3 ms to minimize.
[2024-06-01 18:26:23] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-06-01 18:26:23] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
[2024-06-01 18:26:23] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 4 ms to minimize.
[2024-06-01 18:26:24] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-06-01 18:26:24] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 18:26:25] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-06-01 18:26:25] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 6 ms to minimize.
[2024-06-01 18:26:25] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-06-01 18:26:26] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 18:26:26] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:26:26] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-06-01 18:26:26] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-06-01 18:26:26] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-01 18:26:26] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-06-01 18:26:27] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-06-01 18:26:27] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-06-01 18:26:27] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 3 ms to minimize.
[2024-06-01 18:26:27] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-06-01 18:26:27] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 4 ms to minimize.
[2024-06-01 18:26:28] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 3 ms to minimize.
[2024-06-01 18:26:29] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 792 unsolved
[2024-06-01 18:26:30] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:26:30] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 18:26:30] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-06-01 18:26:31] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-06-01 18:26:31] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-06-01 18:26:31] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-06-01 18:26:31] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2024-06-01 18:26:31] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 3 ms to minimize.
[2024-06-01 18:26:31] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
[2024-06-01 18:26:32] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-06-01 18:26:32] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-06-01 18:26:32] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-06-01 18:26:32] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-06-01 18:26:32] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-01 18:26:32] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-06-01 18:26:33] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-06-01 18:26:33] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-06-01 18:26:33] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-06-01 18:26:33] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-06-01 18:26:33] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/693 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/1486 variables, and 221 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/693 constraints, PredecessorRefiner: 0/792 constraints, Known Traps: 140/140 constraints]
After SMT, in 60315ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in LTL mode, iteration 1 : 693/803 places, 793/903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61424 ms. Remains : 693/803 places, 793/903 transitions.
Support contains 199 out of 693 places after structural reductions.
[2024-06-01 18:26:34] [INFO ] Flatten gal took : 95 ms
[2024-06-01 18:26:34] [INFO ] Flatten gal took : 51 ms
[2024-06-01 18:26:34] [INFO ] Input system was already deterministic with 793 transitions.
Support contains 195 out of 693 places (down from 199) after GAL structural reductions.
RANDOM walk for 40000 steps (44 resets) in 1972 ms. (20 steps per ms) remains 9/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
[2024-06-01 18:26:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 253/288 variables, 27/27 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 405/693 variables, 54/81 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 793/1486 variables, 693/774 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1486 variables, 0/774 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1486 variables, 0/774 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1486/1486 variables, and 774 constraints, problems are : Problem set: 1 solved, 6 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 693/693 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 236/265 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 428/693 variables, 57/81 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 18:26:36] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-06-01 18:26:36] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:26:37] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 20/101 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-06-01 18:26:38] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 3/104 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 793/1486 variables, 693/797 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1486 variables, 6/803 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 18:26:39] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 4 ms to minimize.
[2024-06-01 18:26:39] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-06-01 18:26:39] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 5 ms to minimize.
[2024-06-01 18:26:40] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-06-01 18:26:40] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-01 18:26:40] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 18:26:40] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-06-01 18:26:40] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-06-01 18:26:40] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-06-01 18:26:40] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-06-01 18:26:40] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-06-01 18:26:41] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-06-01 18:26:41] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 18:26:41] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:26:41] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-06-01 18:26:41] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
SMT process timed out in 5885ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 693/693 places, 793/793 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 693 transition count 716
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 616 transition count 716
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 154 place count 616 transition count 618
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 350 place count 518 transition count 618
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 376 place count 492 transition count 592
Iterating global reduction 2 with 26 rules applied. Total rules applied 402 place count 492 transition count 592
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 402 place count 492 transition count 585
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 416 place count 485 transition count 585
Performed 185 Post agglomeration using F-continuation condition.Transition count delta: 185
Deduced a syphon composed of 185 places in 1 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 786 place count 300 transition count 400
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 825 place count 300 transition count 400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 826 place count 299 transition count 399
Applied a total of 826 rules in 150 ms. Remains 299 /693 variables (removed 394) and now considering 399/793 (removed 394) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 299/693 places, 399/793 transitions.
RANDOM walk for 40000 steps (142 resets) in 613 ms. (65 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (15 resets) in 137 ms. (289 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1150 steps (0 resets) in 7 ms. (143 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 35 ms
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 38 ms
[2024-06-01 18:26:42] [INFO ] Input system was already deterministic with 793 transitions.
Computed a total of 175 stabilizing places and 175 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 692 transition count 715
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 615 transition count 715
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 154 place count 615 transition count 613
Deduced a syphon composed of 102 places in 2 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 358 place count 513 transition count 613
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 388 place count 483 transition count 583
Iterating global reduction 2 with 30 rules applied. Total rules applied 418 place count 483 transition count 583
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 418 place count 483 transition count 574
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 436 place count 474 transition count 574
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 3 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 796 place count 294 transition count 394
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 798 place count 292 transition count 392
Applied a total of 798 rules in 87 ms. Remains 292 /693 variables (removed 401) and now considering 392/793 (removed 401) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 292/693 places, 392/793 transitions.
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 19 ms
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 19 ms
[2024-06-01 18:26:42] [INFO ] Input system was already deterministic with 392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 662 transition count 762
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 662 transition count 762
Applied a total of 62 rules in 24 ms. Remains 662 /693 variables (removed 31) and now considering 762/793 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 662/693 places, 762/793 transitions.
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 28 ms
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 26 ms
[2024-06-01 18:26:42] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 23 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 663/693 places, 763/793 transitions.
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 23 ms
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 24 ms
[2024-06-01 18:26:42] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 666 transition count 766
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 666 transition count 766
Applied a total of 54 rules in 39 ms. Remains 666 /693 variables (removed 27) and now considering 766/793 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 666/693 places, 766/793 transitions.
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 23 ms
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 25 ms
[2024-06-01 18:26:42] [INFO ] Input system was already deterministic with 766 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 22 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 663/693 places, 763/793 transitions.
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 21 ms
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 22 ms
[2024-06-01 18:26:42] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 34 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 663/693 places, 763/793 transitions.
[2024-06-01 18:26:42] [INFO ] Flatten gal took : 28 ms
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 23 ms
[2024-06-01 18:26:43] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 693 transition count 719
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 619 transition count 719
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 148 place count 619 transition count 618
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 350 place count 518 transition count 618
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 378 place count 490 transition count 590
Iterating global reduction 2 with 28 rules applied. Total rules applied 406 place count 490 transition count 590
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 406 place count 490 transition count 581
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 424 place count 481 transition count 581
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 778 place count 304 transition count 404
Applied a total of 778 rules in 55 ms. Remains 304 /693 variables (removed 389) and now considering 404/793 (removed 389) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 304/693 places, 404/793 transitions.
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 14 ms
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 16 ms
[2024-06-01 18:26:43] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 664 transition count 764
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 664 transition count 764
Applied a total of 58 rules in 31 ms. Remains 664 /693 variables (removed 29) and now considering 764/793 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 664/693 places, 764/793 transitions.
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 21 ms
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 21 ms
[2024-06-01 18:26:43] [INFO ] Input system was already deterministic with 764 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 692 transition count 711
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 611 transition count 711
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 611 transition count 611
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 511 transition count 611
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 391 place count 482 transition count 582
Iterating global reduction 2 with 29 rules applied. Total rules applied 420 place count 482 transition count 582
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 420 place count 482 transition count 573
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 438 place count 473 transition count 573
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 1 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 2 with 372 rules applied. Total rules applied 810 place count 287 transition count 387
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 812 place count 285 transition count 385
Applied a total of 812 rules in 60 ms. Remains 285 /693 variables (removed 408) and now considering 385/793 (removed 408) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 285/693 places, 385/793 transitions.
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 12 ms
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 13 ms
[2024-06-01 18:26:43] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 24 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 663/693 places, 763/793 transitions.
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 21 ms
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 21 ms
[2024-06-01 18:26:43] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 669 transition count 769
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 669 transition count 769
Applied a total of 48 rules in 36 ms. Remains 669 /693 variables (removed 24) and now considering 769/793 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 669/693 places, 769/793 transitions.
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 19 ms
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 21 ms
[2024-06-01 18:26:43] [INFO ] Input system was already deterministic with 769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 665 transition count 765
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 665 transition count 765
Applied a total of 56 rules in 23 ms. Remains 665 /693 variables (removed 28) and now considering 765/793 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 665/693 places, 765/793 transitions.
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 19 ms
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 19 ms
[2024-06-01 18:26:43] [INFO ] Input system was already deterministic with 765 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 662 transition count 762
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 662 transition count 762
Applied a total of 62 rules in 26 ms. Remains 662 /693 variables (removed 31) and now considering 762/793 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 662/693 places, 762/793 transitions.
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 20 ms
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 21 ms
[2024-06-01 18:26:43] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 27 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 663/693 places, 763/793 transitions.
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 18 ms
[2024-06-01 18:26:43] [INFO ] Flatten gal took : 19 ms
[2024-06-01 18:26:44] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 692 transition count 716
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 616 transition count 716
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 152 place count 616 transition count 619
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 346 place count 519 transition count 619
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 374 place count 491 transition count 591
Iterating global reduction 2 with 28 rules applied. Total rules applied 402 place count 491 transition count 591
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 402 place count 491 transition count 585
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 414 place count 485 transition count 585
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 0 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 2 with 372 rules applied. Total rules applied 786 place count 299 transition count 399
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 788 place count 297 transition count 397
Applied a total of 788 rules in 59 ms. Remains 297 /693 variables (removed 396) and now considering 397/793 (removed 396) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 297/693 places, 397/793 transitions.
[2024-06-01 18:26:44] [INFO ] Flatten gal took : 11 ms
[2024-06-01 18:26:44] [INFO ] Flatten gal took : 11 ms
[2024-06-01 18:26:44] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 664 transition count 764
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 664 transition count 764
Applied a total of 58 rules in 23 ms. Remains 664 /693 variables (removed 29) and now considering 764/793 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 664/693 places, 764/793 transitions.
[2024-06-01 18:26:44] [INFO ] Flatten gal took : 18 ms
[2024-06-01 18:26:44] [INFO ] Flatten gal took : 19 ms
[2024-06-01 18:26:44] [INFO ] Input system was already deterministic with 764 transitions.
[2024-06-01 18:26:44] [INFO ] Flatten gal took : 20 ms
[2024-06-01 18:26:44] [INFO ] Flatten gal took : 20 ms
[2024-06-01 18:26:44] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 18:26:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 693 places, 793 transitions and 2660 arcs took 5 ms.
Total runtime 71997 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 : ShieldRVs-PT-020B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVs-PT-020B-CTLFireability-2023-15
BK_STOP 1717266404768
--------------------
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 ShieldRVs-PT-020B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1070/ctl_0_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1070/ctl_1_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1070/ctl_2_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1070/ctl_3_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1070/ctl_4_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1070/ctl_5_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1070/ctl_6_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1070/ctl_7_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1070/ctl_8_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1070/ctl_9_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1070/ctl_10_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1070/ctl_11_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1070/ctl_12_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1070/ctl_13_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1070/ctl_14_
ctl formula name ShieldRVs-PT-020B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1070/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="ShieldRVs-PT-020B"
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 ShieldRVs-PT-020B, 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-171683761900810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020B.tgz
mv ShieldRVs-PT-020B 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 ;