About the Execution of LTSMin+red for BusinessProcesses-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 621.939 | 75104.00 | 125521.00 | 109.60 | ??????????T?F??? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399800585.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800585
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 177K May 18 16:42 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 BusinessProcesses-PT-18-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-18-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717226051220
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:14:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:14:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:14:12] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-01 07:14:12] [INFO ] Transformed 717 places.
[2024-06-01 07:14:12] [INFO ] Transformed 642 transitions.
[2024-06-01 07:14:12] [INFO ] Found NUPN structural information;
[2024-06-01 07:14:12] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 15 places in 12 ms
Reduce places removed 15 places and 15 transitions.
Support contains 89 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 92 place count 610 transition count 543
Iterating global reduction 1 with 84 rules applied. Total rules applied 176 place count 610 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 177 place count 610 transition count 542
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 218 place count 569 transition count 501
Iterating global reduction 2 with 41 rules applied. Total rules applied 259 place count 569 transition count 501
Applied a total of 259 rules in 147 ms. Remains 569 /702 variables (removed 133) and now considering 501/627 (removed 126) transitions.
// Phase 1: matrix 501 rows 569 cols
[2024-06-01 07:14:13] [INFO ] Computed 106 invariants in 44 ms
[2024-06-01 07:14:13] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-06-01 07:14:13] [INFO ] Invariant cache hit.
[2024-06-01 07:14:14] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-01 07:14:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 120 places in 197 ms of which 26 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 112 places in 283 ms of which 3 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 94 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 115 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 89 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 87 places in 255 ms of which 3 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 134 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 92 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 91 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 110 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 86 places in 168 ms of which 8 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 7 ms to minimize.
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 91 places in 185 ms of which 7 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 93 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 5 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 87 places in 210 ms of which 4 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 5 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 4 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 6 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 87 places in 1537 ms of which 4 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 4 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 5 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 101 places in 200 ms of which 4 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 96 places in 197 ms of which 4 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 113 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 98 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 108 places in 166 ms of which 6 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 88 places in 174 ms of which 6 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 89 places in 181 ms of which 6 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 5 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 16 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 91 places in 227 ms of which 5 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 130 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/1070 variables, and 181 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/569 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/569 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 75/181 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 103 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 116 places in 186 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 113 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 110 places in 202 ms of which 4 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 91 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 129 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 92 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 114 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 101 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 112 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 114 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 92 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 90 places in 239 ms of which 5 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 114 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 135 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 123 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 118 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 117 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 120 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 129 places in 219 ms of which 3 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 137 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 5 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 101 places in 283 ms of which 12 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 140 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 132 places in 230 ms of which 5 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 90 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 109 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 114 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 118 places in 216 ms of which 5 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 112 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 115 places in 206 ms of which 5 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 116 places in 185 ms of which 6 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 109 places in 187 ms of which 6 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 113 places in 218 ms of which 6 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 104 places in 213 ms of which 5 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 107 places in 200 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 117 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 110 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 107 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 112 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 115 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 111 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 118 places in 203 ms of which 5 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 112 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 115 places in 207 ms of which 4 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 115 places in 201 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 133 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 115 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 110 places in 194 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 112 places in 197 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 112 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 121 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 112 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 8 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 134 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 113 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 115 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 120 places in 214 ms of which 8 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 131 places in 212 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 118 places in 194 ms of which 5 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 101 places in 215 ms of which 5 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 110 places in 211 ms of which 4 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 105 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 5 ms to minimize.
SMT process timed out in 60237ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 569/702 places, 501/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61549 ms. Remains : 569/702 places, 501/627 transitions.
Support contains 89 out of 569 places after structural reductions.
[2024-06-01 07:15:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:15:14] [INFO ] Flatten gal took : 131 ms
FORMULA BusinessProcesses-PT-18-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:15:15] [INFO ] Flatten gal took : 63 ms
[2024-06-01 07:15:15] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 81 out of 569 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (208 resets) in 2263 ms. (17 steps per ms) remains 21/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 21/21 properties
[2024-06-01 07:15:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 211/244 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 188/432 variables, 48/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 121/553 variables, 39/104 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 2/555 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 492/1047 variables, 555/661 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1047 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 19/1066 variables, 10/671 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 109 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 29 places in 2506 ms of which 3 ms to minimize.
SMT process timed out in 5132ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 262 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1244 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 563 transition count 422
Reduce places removed 71 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 492 transition count 420
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 148 place count 490 transition count 420
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 148 place count 490 transition count 314
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 380 place count 364 transition count 314
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 398 place count 346 transition count 296
Iterating global reduction 3 with 18 rules applied. Total rules applied 416 place count 346 transition count 296
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 670 place count 218 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 672 place count 217 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 673 place count 217 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 674 place count 216 transition count 172
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 678 place count 216 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 679 place count 215 transition count 171
Applied a total of 679 rules in 278 ms. Remains 215 /569 variables (removed 354) and now considering 171/501 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 215/569 places, 171/501 transitions.
RANDOM walk for 40000 steps (1529 resets) in 826 ms. (48 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40002 steps (632 resets) in 273 ms. (145 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (632 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (647 resets) in 308 ms. (129 steps per ms) remains 3/3 properties
// Phase 1: matrix 171 rows 215 cols
[2024-06-01 07:15:22] [INFO ] Computed 84 invariants in 4 ms
[2024-06-01 07:15:22] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/92 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/95 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 43/138 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/140 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 165/305 variables, 140/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/305 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 78/383 variables, 72/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 25/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/385 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/385 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/385 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/386 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/386 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/386 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 304 constraints, problems are : Problem set: 0 solved, 3 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 215/215 constraints, ReadFeed: 5/5 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/92 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/95 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 7 (OVERLAPS) 43/138 variables, 18/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/140 variables, 2/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 165/305 variables, 140/191 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 5/196 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/305 variables, 2/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/305 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 78/383 variables, 72/270 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 25/295 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/385 variables, 8/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/385 variables, 2/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/385 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/386 variables, 1/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/386 variables, 1/307 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/386 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/386 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 307 constraints, problems are : Problem set: 1 solved, 2 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 215/215 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1239ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 3109 steps, including 89 resets, run visited all 2 properties in 81 ms. (steps per millisecond=38 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 85 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-06-01 07:15:23] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 33 ms
[2024-06-01 07:15:24] [INFO ] Input system was already deterministic with 501 transitions.
Computed a total of 512 stabilizing places and 454 stable transitions
Graph (complete) has 1256 edges and 569 vertex of which 568 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 287 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1249 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 562 transition count 414
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 483 transition count 414
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 160 place count 483 transition count 297
Deduced a syphon composed of 117 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 419 place count 341 transition count 297
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 445 place count 315 transition count 271
Ensure Unique test removed 1 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 472 place count 314 transition count 271
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 740 place count 179 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 741 place count 178 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 742 place count 177 transition count 137
Applied a total of 742 rules in 84 ms. Remains 177 /569 variables (removed 392) and now considering 137/501 (removed 364) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 177/569 places, 137/501 transitions.
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:15:24] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 36 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 531/569 places, 463/501 transitions.
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:15:24] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 477
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 477
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 537 transition count 469
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 537 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 536 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 536 transition count 468
Applied a total of 66 rules in 63 ms. Remains 536 /569 variables (removed 33) and now considering 468/501 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 536/569 places, 468/501 transitions.
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:15:24] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 536 transition count 468
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 535 transition count 467
Applied a total of 68 rules in 34 ms. Remains 535 /569 variables (removed 34) and now considering 467/501 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 535/569 places, 467/501 transitions.
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:15:24] [INFO ] Input system was already deterministic with 467 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 542 transition count 474
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 542 transition count 474
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 533 transition count 465
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 39 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 532/569 places, 464/501 transitions.
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:15:24] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 285 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1249 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 79 place count 562 transition count 416
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 485 transition count 416
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 156 place count 485 transition count 299
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 415 place count 343 transition count 299
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 440 place count 318 transition count 274
Ensure Unique test removed 1 places
Iterating global reduction 2 with 26 rules applied. Total rules applied 466 place count 317 transition count 274
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 732 place count 183 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 733 place count 182 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 734 place count 181 transition count 141
Applied a total of 734 rules in 43 ms. Remains 181 /569 variables (removed 388) and now considering 141/501 (removed 360) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 181/569 places, 141/501 transitions.
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:24] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 538 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 42 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 538/569 places, 470/501 transitions.
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:15:24] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:15:24] [INFO ] Input system was already deterministic with 470 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 545 transition count 477
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 545 transition count 477
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 538 transition count 470
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 27 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 538/569 places, 470/501 transitions.
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:15:25] [INFO ] Input system was already deterministic with 470 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 546 transition count 478
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 546 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 539 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 539 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 538 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 538 transition count 470
Applied a total of 62 rules in 41 ms. Remains 538 /569 variables (removed 31) and now considering 470/501 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 538/569 places, 470/501 transitions.
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:25] [INFO ] Input system was already deterministic with 470 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 36 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 531/569 places, 463/501 transitions.
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:25] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Graph (trivial) has 287 edges and 569 vertex of which 6 / 569 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1249 edges and 564 vertex of which 563 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 562 transition count 414
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 483 transition count 414
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 160 place count 483 transition count 298
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 417 place count 342 transition count 298
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 444 place count 315 transition count 271
Ensure Unique test removed 1 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 472 place count 314 transition count 271
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 740 place count 179 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 741 place count 178 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 742 place count 177 transition count 137
Applied a total of 742 rules in 35 ms. Remains 177 /569 variables (removed 392) and now considering 137/501 (removed 364) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 177/569 places, 137/501 transitions.
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:15:25] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-18-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 544 transition count 476
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 544 transition count 476
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 536 transition count 468
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 535 transition count 467
Applied a total of 68 rules in 39 ms. Remains 535 /569 variables (removed 34) and now considering 467/501 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 535/569 places, 467/501 transitions.
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:25] [INFO ] Input system was already deterministic with 467 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 32 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 531/569 places, 463/501 transitions.
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:25] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 541 transition count 473
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 541 transition count 473
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 532 transition count 464
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 531 transition count 463
Applied a total of 76 rules in 36 ms. Remains 531 /569 variables (removed 38) and now considering 463/501 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 531/569 places, 463/501 transitions.
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:15:25] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 501/501 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 542 transition count 474
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 542 transition count 474
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 533 transition count 465
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 532 transition count 464
Applied a total of 74 rules in 37 ms. Remains 532 /569 variables (removed 37) and now considering 464/501 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 532/569 places, 464/501 transitions.
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:25] [INFO ] Input system was already deterministic with 464 transitions.
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:15:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:15:25] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 07:15:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 569 places, 501 transitions and 1570 arcs took 5 ms.
Total runtime 73375 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 : BusinessProcesses-PT-18-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2023-13
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2023-14
Could not compute solution for formula : BusinessProcesses-PT-18-CTLCardinality-2023-15
BK_STOP 1717226126324
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1145/ctl_0_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1145/ctl_1_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1145/ctl_2_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1145/ctl_3_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1145/ctl_4_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1145/ctl_5_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1145/ctl_6_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1145/ctl_7_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1145/ctl_8_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1145/ctl_9_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1145/ctl_10_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1145/ctl_11_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1145/ctl_12_
ctl formula name BusinessProcesses-PT-18-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1145/ctl_13_
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="BusinessProcesses-PT-18"
export BK_EXAMINATION="CTLCardinality"
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 BusinessProcesses-PT-18, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;