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.r468-smll-171620167100162.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 AutoFlight-PT-12b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167100162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 266K 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 AutoFlight-PT-12b-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2023-12
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2023-13
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2023-14
FORMULA_NAME AutoFlight-PT-12b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717190213115

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:16:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:16:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:16:55] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-05-31 21:16:55] [INFO ] Transformed 1126 places.
[2024-05-31 21:16:55] [INFO ] Transformed 1124 transitions.
[2024-05-31 21:16:55] [INFO ] Found NUPN structural information;
[2024-05-31 21:16:55] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 153 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 1004 transition count 1002
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 1004 transition count 1002
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 264 place count 1004 transition count 982
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 312 place count 956 transition count 934
Iterating global reduction 1 with 48 rules applied. Total rules applied 360 place count 956 transition count 934
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 367 place count 949 transition count 927
Iterating global reduction 1 with 7 rules applied. Total rules applied 374 place count 949 transition count 927
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 377 place count 946 transition count 924
Iterating global reduction 1 with 3 rules applied. Total rules applied 380 place count 946 transition count 924
Applied a total of 380 rules in 525 ms. Remains 946 /1126 variables (removed 180) and now considering 924/1124 (removed 200) transitions.
// Phase 1: matrix 924 rows 946 cols
[2024-05-31 21:16:56] [INFO ] Computed 76 invariants in 42 ms
[2024-05-31 21:16:56] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-31 21:16:56] [INFO ] Invariant cache hit.
[2024-05-31 21:16:58] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Running 923 sub problems to find dead transitions.
[2024-05-31 21:16:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 923 unsolved
SMT process timed out in 30348ms, After SMT, problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 30391ms
Starting structural reductions in LTL mode, iteration 1 : 946/1126 places, 924/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33126 ms. Remains : 946/1126 places, 924/1124 transitions.
Support contains 153 out of 946 places after structural reductions.
[2024-05-31 21:17:29] [INFO ] Flatten gal took : 145 ms
[2024-05-31 21:17:29] [INFO ] Flatten gal took : 69 ms
[2024-05-31 21:17:29] [INFO ] Input system was already deterministic with 924 transitions.
Support contains 152 out of 946 places (down from 153) after GAL structural reductions.
RANDOM walk for 40000 steps (72 resets) in 2867 ms. (13 steps per ms) remains 45/114 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
[2024-05-31 21:17:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 639/715 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/715 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 175/890 variables, 26/75 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/890 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 56/946 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 924/1870 variables, 946/1022 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1870 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1870/1870 variables, and 1022 constraints, problems are : Problem set: 0 solved, 45 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 946/946 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 639/715 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 21:17:36] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 36 ms to minimize.
[2024-05-31 21:17:36] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 6 ms to minimize.
[2024-05-31 21:17:36] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 3 ms to minimize.
[2024-05-31 21:17:36] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 3 ms to minimize.
[2024-05-31 21:17:37] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 4 ms to minimize.
[2024-05-31 21:17:37] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 4 ms to minimize.
[2024-05-31 21:17:37] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 4 ms to minimize.
[2024-05-31 21:17:37] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 4 ms to minimize.
[2024-05-31 21:17:37] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-05-31 21:17:37] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 3 ms to minimize.
[2024-05-31 21:17:38] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-31 21:17:38] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 3 ms to minimize.
[2024-05-31 21:17:38] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-31 21:17:38] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-31 21:17:38] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 3 ms to minimize.
[2024-05-31 21:17:38] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-31 21:17:38] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 3 ms to minimize.
[2024-05-31 21:17:39] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 3 ms to minimize.
[2024-05-31 21:17:39] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/715 variables, 19/68 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/715 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 175/890 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-31 21:17:40] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:17:40] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 0)
(s434 0)
(s435 1)
(s436 0)
(s437 1)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 1)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/1870 variables, and 96 constraints, problems are : Problem set: 0 solved, 45 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/946 constraints, PredecessorRefiner: 0/45 constraints, Known Traps: 21/21 constraints]
After SMT, in 10067ms problems are : Problem set: 0 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 924/924 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 273 place count 946 transition count 651
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 304 rules applied. Total rules applied 577 place count 673 transition count 620
Reduce places removed 18 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 33 rules applied. Total rules applied 610 place count 655 transition count 605
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 625 place count 640 transition count 605
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 108 Pre rules applied. Total rules applied 625 place count 640 transition count 497
Deduced a syphon composed of 108 places in 2 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 841 place count 532 transition count 497
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 857 place count 516 transition count 481
Iterating global reduction 4 with 16 rules applied. Total rules applied 873 place count 516 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 874 place count 516 transition count 480
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 874 place count 516 transition count 475
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 884 place count 511 transition count 475
Performed 153 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 5 with 306 rules applied. Total rules applied 1190 place count 358 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1192 place count 358 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1194 place count 357 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1198 place count 357 transition count 298
Free-agglomeration rule applied 37 times.
Iterating global reduction 6 with 37 rules applied. Total rules applied 1235 place count 357 transition count 261
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 6 with 37 rules applied. Total rules applied 1272 place count 320 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1273 place count 320 transition count 260
Applied a total of 1273 rules in 294 ms. Remains 320 /946 variables (removed 626) and now considering 260/924 (removed 664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 320/946 places, 260/924 transitions.
RANDOM walk for 40000 steps (580 resets) in 1264 ms. (31 steps per ms) remains 18/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
// Phase 1: matrix 260 rows 320 cols
[2024-05-31 21:17:41] [INFO ] Computed 76 invariants in 10 ms
[2024-05-31 21:17:41] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 142/174 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 103/277 variables, 37/74 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 43/320 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 260/580 variables, 320/396 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 70/466 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/580 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 466 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1268 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 142/174 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:42] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
[2024-05-31 21:17:43] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:17:43] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-31 21:17:43] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-31 21:17:43] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 103/277 variables, 37/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:43] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
[2024-05-31 21:17:43] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-31 21:17:43] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 43/320 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:43] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 3 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 3 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 3 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 3 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 7 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 110 places in 88 ms of which 2 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 114 places in 92 ms of which 2 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 3 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 3 ms to minimize.
[2024-05-31 21:17:44] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 4 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 113 places in 81 ms of which 2 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 112 places in 79 ms of which 2 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 111 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 115 places in 99 ms of which 2 ms to minimize.
[2024-05-31 21:17:45] [INFO ] Deduced a trap composed of 131 places in 98 ms of which 3 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 114 places in 78 ms of which 2 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 112 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 3 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 111 places in 88 ms of which 2 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 126 places in 90 ms of which 2 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 112 places in 81 ms of which 2 ms to minimize.
[2024-05-31 21:17:46] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 2 ms to minimize.
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 109 places in 88 ms of which 2 ms to minimize.
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 106 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 105 places in 84 ms of which 2 ms to minimize.
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 108 places in 91 ms of which 3 ms to minimize.
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 108 places in 91 ms of which 3 ms to minimize.
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 3 ms to minimize.
[2024-05-31 21:17:47] [INFO ] Deduced a trap composed of 108 places in 94 ms of which 2 ms to minimize.
[2024-05-31 21:17:48] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 2 ms to minimize.
[2024-05-31 21:17:48] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-31 21:17:48] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 3 ms to minimize.
[2024-05-31 21:17:48] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 2 ms to minimize.
[2024-05-31 21:17:48] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 3 ms to minimize.
[2024-05-31 21:17:48] [INFO ] Deduced a trap composed of 112 places in 89 ms of which 2 ms to minimize.
[2024-05-31 21:17:48] [INFO ] Deduced a trap composed of 112 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:17:48] [INFO ] Deduced a trap composed of 130 places in 83 ms of which 2 ms to minimize.
[2024-05-31 21:17:48] [INFO ] Deduced a trap composed of 115 places in 77 ms of which 3 ms to minimize.
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 114 places in 79 ms of which 2 ms to minimize.
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 105 places in 90 ms of which 3 ms to minimize.
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 114 places in 85 ms of which 2 ms to minimize.
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 115 places in 83 ms of which 2 ms to minimize.
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 2 ms to minimize.
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 2 ms to minimize.
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 3 ms to minimize.
[2024-05-31 21:17:49] [INFO ] Deduced a trap composed of 108 places in 84 ms of which 2 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 3 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 2 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 111 places in 96 ms of which 2 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 108 places in 91 ms of which 3 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 2 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 113 places in 88 ms of which 2 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 113 places in 86 ms of which 2 ms to minimize.
[2024-05-31 21:17:50] [INFO ] Deduced a trap composed of 107 places in 88 ms of which 3 ms to minimize.
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 106 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 2 ms to minimize.
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 115 places in 86 ms of which 3 ms to minimize.
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 115 places in 82 ms of which 2 ms to minimize.
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 115 places in 92 ms of which 2 ms to minimize.
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 107 places in 85 ms of which 2 ms to minimize.
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 109 places in 83 ms of which 2 ms to minimize.
[2024-05-31 21:17:51] [INFO ] Deduced a trap composed of 109 places in 88 ms of which 2 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 109 places in 84 ms of which 2 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 111 places in 94 ms of which 3 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 109 places in 88 ms of which 2 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 109 places in 85 ms of which 2 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 112 places in 85 ms of which 2 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 111 places in 92 ms of which 2 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 113 places in 85 ms of which 2 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 113 places in 81 ms of which 2 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 114 places in 74 ms of which 2 ms to minimize.
[2024-05-31 21:17:52] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 2 ms to minimize.
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 3 ms to minimize.
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 116 places in 78 ms of which 2 ms to minimize.
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 117 places in 80 ms of which 2 ms to minimize.
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 127 places in 89 ms of which 2 ms to minimize.
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 2 ms to minimize.
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 103 places in 80 ms of which 2 ms to minimize.
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 3 ms to minimize.
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-31 21:17:53] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-31 21:17:54] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
[2024-05-31 21:17:54] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-31 21:17:54] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-05-31 21:17:54] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 3 ms to minimize.
[2024-05-31 21:17:54] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-31 21:17:54] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-05-31 21:17:54] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 3 ms to minimize.
[2024-05-31 21:17:54] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-31 21:17:54] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 2 ms to minimize.
[2024-05-31 21:17:55] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
[2024-05-31 21:17:55] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 4 ms to minimize.
[2024-05-31 21:17:55] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 2 ms to minimize.
[2024-05-31 21:17:55] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 3 ms to minimize.
[2024-05-31 21:17:55] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 3 ms to minimize.
[2024-05-31 21:17:55] [INFO ] Deduced a trap composed of 110 places in 92 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 18/202 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:55] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 2 ms to minimize.
[2024-05-31 21:17:55] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-31 21:17:56] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-31 21:17:56] [INFO ] Deduced a trap composed of 110 places in 90 ms of which 2 ms to minimize.
[2024-05-31 21:17:56] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 3 ms to minimize.
[2024-05-31 21:17:56] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 3 ms to minimize.
[2024-05-31 21:17:56] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:56] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:57] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:57] [INFO ] Deduced a trap composed of 130 places in 81 ms of which 2 ms to minimize.
[2024-05-31 21:17:57] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 2 ms to minimize.
[2024-05-31 21:17:57] [INFO ] Deduced a trap composed of 130 places in 89 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:57] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 3 ms to minimize.
[2024-05-31 21:17:57] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (OVERLAPS) 260/580 variables, 320/536 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/580 variables, 70/606 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/580 variables, 18/624 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:17:59] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 2 ms to minimize.
[2024-05-31 21:17:59] [INFO ] Deduced a trap composed of 108 places in 96 ms of which 2 ms to minimize.
[2024-05-31 21:17:59] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-05-31 21:17:59] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/580 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 21:18:00] [INFO ] Deduced a trap composed of 109 places in 85 ms of which 2 ms to minimize.
[2024-05-31 21:18:00] [INFO ] Deduced a trap composed of 112 places in 94 ms of which 2 ms to minimize.
[2024-05-31 21:18:00] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 2 ms to minimize.
[2024-05-31 21:18:00] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-31 21:18:00] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 3 ms to minimize.
[2024-05-31 21:18:00] [INFO ] Deduced a trap composed of 107 places in 90 ms of which 2 ms to minimize.
[2024-05-31 21:18:00] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 3 ms to minimize.
[2024-05-31 21:18:01] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 3 ms to minimize.
[2024-05-31 21:18:01] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-05-31 21:18:01] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-05-31 21:18:01] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/580 variables, 11/639 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/580 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (OVERLAPS) 0/580 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 639 constraints, problems are : Problem set: 0 solved, 18 unsolved in 21790 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 320/320 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 155/155 constraints]
After SMT, in 23085ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 2 properties in 1374 ms.
Support contains 26 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 260/260 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 320 transition count 243
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 303 transition count 243
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 303 transition count 233
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 54 place count 293 transition count 233
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 292 transition count 232
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 292 transition count 232
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 108 place count 266 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 266 transition count 204
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 117 place count 266 transition count 196
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 125 place count 258 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 257 transition count 195
Reduce places removed 21 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 30 rules applied. Total rules applied 156 place count 236 transition count 186
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 165 place count 227 transition count 186
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 165 place count 227 transition count 171
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 195 place count 212 transition count 171
Applied a total of 195 rules in 95 ms. Remains 212 /320 variables (removed 108) and now considering 171/260 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 212/320 places, 171/260 transitions.
RANDOM walk for 40000 steps (959 resets) in 388 ms. (102 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40003 steps (182 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (165 resets) in 100 ms. (396 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (149 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (131 resets) in 91 ms. (434 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40003 steps (142 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (184 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (148 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (142 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (177 resets) in 122 ms. (325 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (184 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (166 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
// Phase 1: matrix 171 rows 212 cols
[2024-05-31 21:18:06] [INFO ] Computed 55 invariants in 12 ms
[2024-05-31 21:18:06] [INFO ] State equation strengthened by 66 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 78/92 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:18:06] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-31 21:18:06] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 8/100 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 79/179 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 2 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 2 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 14/193 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 2 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-05-31 21:18:07] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 165/358 variables, 193/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 66/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 25/383 variables, 19/339 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:18:08] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/383 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/383 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 348 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1743 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 212/212 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 78/92 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 8/100 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 79/179 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 14/193 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 165/358 variables, 193/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 66/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 8/328 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 25/383 variables, 19/347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/383 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:18:09] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 2 ms to minimize.
[2024-05-31 21:18:09] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-05-31 21:18:09] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 2 ms to minimize.
[2024-05-31 21:18:09] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:18:09] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-31 21:18:09] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/383 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/383 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/383 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 362 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1458 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 212/212 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 21/21 constraints]
After SMT, in 3227ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 3125 ms.
Support contains 13 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 164
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 205 transition count 164
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 205 transition count 161
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 202 transition count 161
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 194 transition count 155
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 34 place count 194 transition count 147
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 50 place count 186 transition count 147
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 186 transition count 143
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 59 place count 181 transition count 143
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 59 place count 181 transition count 139
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 67 place count 177 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 176 transition count 138
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 13 rules applied. Total rules applied 81 place count 170 transition count 131
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 88 place count 163 transition count 131
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 88 place count 163 transition count 123
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 104 place count 155 transition count 123
Applied a total of 104 rules in 51 ms. Remains 155 /212 variables (removed 57) and now considering 123/171 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 155/212 places, 123/171 transitions.
RANDOM walk for 40000 steps (979 resets) in 246 ms. (161 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (163 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (166 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (215 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (170 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
// Phase 1: matrix 123 rows 155 cols
[2024-05-31 21:18:13] [INFO ] Computed 46 invariants in 5 ms
[2024-05-31 21:18:13] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 63/73 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 57/131 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:18:13] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
[2024-05-31 21:18:13] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 14/145 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:18:13] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 123/268 variables, 145/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 53/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 10/278 variables, 10/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:18:14] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-31 21:18:14] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/278 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/278 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 259 constraints, problems are : Problem set: 0 solved, 4 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 155/155 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 63/73 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 57/131 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 14/145 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:18:14] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:18:14] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 123/268 variables, 145/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 53/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 10/278 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/278 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/278 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/278 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 155/155 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 563 ms.
Support contains 5 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 123/123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 155 transition count 120
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 152 transition count 120
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 152 transition count 115
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 146 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 146 transition count 114
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 145 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 143 transition count 112
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 143 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 139 transition count 108
Applied a total of 31 rules in 26 ms. Remains 139 /155 variables (removed 16) and now considering 108/123 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 139/155 places, 108/123 transitions.
RANDOM walk for 40000 steps (388 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 12672 steps (19 resets) in 34 ms. (362 steps per ms) remains 0/1 properties
[2024-05-31 21:18:15] [INFO ] Flatten gal took : 45 ms
[2024-05-31 21:18:15] [INFO ] Flatten gal took : 47 ms
[2024-05-31 21:18:15] [INFO ] Input system was already deterministic with 924 transitions.
Computed a total of 257 stabilizing places and 257 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 901 transition count 879
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 901 transition count 879
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 901 transition count 875
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 110 place count 885 transition count 859
Iterating global reduction 1 with 16 rules applied. Total rules applied 126 place count 885 transition count 859
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 130 place count 881 transition count 855
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 881 transition count 855
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 879 transition count 853
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 879 transition count 853
Applied a total of 138 rules in 162 ms. Remains 879 /946 variables (removed 67) and now considering 853/924 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 879/946 places, 853/924 transitions.
[2024-05-31 21:18:15] [INFO ] Flatten gal took : 38 ms
[2024-05-31 21:18:15] [INFO ] Flatten gal took : 36 ms
[2024-05-31 21:18:15] [INFO ] Input system was already deterministic with 853 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 902 transition count 880
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 902 transition count 880
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 91 place count 902 transition count 877
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 109 place count 884 transition count 859
Iterating global reduction 1 with 18 rules applied. Total rules applied 127 place count 884 transition count 859
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 131 place count 880 transition count 855
Iterating global reduction 1 with 4 rules applied. Total rules applied 135 place count 880 transition count 855
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 138 place count 877 transition count 852
Iterating global reduction 1 with 3 rules applied. Total rules applied 141 place count 877 transition count 852
Applied a total of 141 rules in 151 ms. Remains 877 /946 variables (removed 69) and now considering 852/924 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 877/946 places, 852/924 transitions.
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 32 ms
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 36 ms
[2024-05-31 21:18:16] [INFO ] Input system was already deterministic with 852 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 945 transition count 593
Reduce places removed 330 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 373 rules applied. Total rules applied 703 place count 615 transition count 550
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 728 place count 591 transition count 549
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 729 place count 590 transition count 549
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 115 Pre rules applied. Total rules applied 729 place count 590 transition count 434
Deduced a syphon composed of 115 places in 1 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 4 with 230 rules applied. Total rules applied 959 place count 475 transition count 434
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 992 place count 442 transition count 401
Iterating global reduction 4 with 33 rules applied. Total rules applied 1025 place count 442 transition count 401
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 1025 place count 442 transition count 385
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 1057 place count 426 transition count 385
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 1329 place count 290 transition count 249
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 1350 place count 290 transition count 228
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1392 place count 269 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1393 place count 268 transition count 206
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 20 rules applied. Total rules applied 1413 place count 252 transition count 202
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1417 place count 248 transition count 202
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1417 place count 248 transition count 190
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1441 place count 236 transition count 190
Applied a total of 1441 rules in 105 ms. Remains 236 /946 variables (removed 710) and now considering 190/924 (removed 734) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 105 ms. Remains : 236/946 places, 190/924 transitions.
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:18:16] [INFO ] Input system was already deterministic with 190 transitions.
RANDOM walk for 95 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-12b-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 898 transition count 876
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 898 transition count 876
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 100 place count 898 transition count 872
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 119 place count 879 transition count 853
Iterating global reduction 1 with 19 rules applied. Total rules applied 138 place count 879 transition count 853
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 142 place count 875 transition count 849
Iterating global reduction 1 with 4 rules applied. Total rules applied 146 place count 875 transition count 849
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 872 transition count 846
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 872 transition count 846
Applied a total of 152 rules in 161 ms. Remains 872 /946 variables (removed 74) and now considering 846/924 (removed 78) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 872/946 places, 846/924 transitions.
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 29 ms
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 28 ms
[2024-05-31 21:18:16] [INFO ] Input system was already deterministic with 846 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 323 place count 945 transition count 600
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 363 rules applied. Total rules applied 686 place count 622 transition count 560
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 25 rules applied. Total rules applied 711 place count 600 transition count 557
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 714 place count 597 transition count 557
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 117 Pre rules applied. Total rules applied 714 place count 597 transition count 440
Deduced a syphon composed of 117 places in 1 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 4 with 234 rules applied. Total rules applied 948 place count 480 transition count 440
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 980 place count 448 transition count 408
Iterating global reduction 4 with 32 rules applied. Total rules applied 1012 place count 448 transition count 408
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 1012 place count 448 transition count 394
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 1040 place count 434 transition count 394
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 4 with 270 rules applied. Total rules applied 1310 place count 299 transition count 259
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 1331 place count 299 transition count 238
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1373 place count 278 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1374 place count 277 transition count 216
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 17 rules applied. Total rules applied 1391 place count 263 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1394 place count 260 transition count 213
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1394 place count 260 transition count 202
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1416 place count 249 transition count 202
Applied a total of 1416 rules in 98 ms. Remains 249 /946 variables (removed 697) and now considering 202/924 (removed 722) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 99 ms. Remains : 249/946 places, 202/924 transitions.
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:18:16] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 904 transition count 882
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 904 transition count 882
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 86 place count 904 transition count 880
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 102 place count 888 transition count 864
Iterating global reduction 1 with 16 rules applied. Total rules applied 118 place count 888 transition count 864
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 885 transition count 861
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 885 transition count 861
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 882 transition count 858
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 882 transition count 858
Applied a total of 130 rules in 150 ms. Remains 882 /946 variables (removed 64) and now considering 858/924 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 882/946 places, 858/924 transitions.
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 23 ms
[2024-05-31 21:18:16] [INFO ] Flatten gal took : 23 ms
[2024-05-31 21:18:17] [INFO ] Input system was already deterministic with 858 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 906 transition count 884
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 906 transition count 884
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 83 place count 906 transition count 881
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 98 place count 891 transition count 866
Iterating global reduction 1 with 15 rules applied. Total rules applied 113 place count 891 transition count 866
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 888 transition count 863
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 888 transition count 863
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 886 transition count 861
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 886 transition count 861
Applied a total of 123 rules in 164 ms. Remains 886 /946 variables (removed 60) and now considering 861/924 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 886/946 places, 861/924 transitions.
[2024-05-31 21:18:17] [INFO ] Flatten gal took : 29 ms
[2024-05-31 21:18:17] [INFO ] Flatten gal took : 22 ms
[2024-05-31 21:18:17] [INFO ] Input system was already deterministic with 861 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 945 transition count 593
Reduce places removed 330 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 373 rules applied. Total rules applied 703 place count 615 transition count 550
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 727 place count 591 transition count 550
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 727 place count 591 transition count 436
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 955 place count 477 transition count 436
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 985 place count 447 transition count 406
Iterating global reduction 3 with 30 rules applied. Total rules applied 1015 place count 447 transition count 406
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1015 place count 447 transition count 391
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1045 place count 432 transition count 391
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 1321 place count 294 transition count 253
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1342 place count 294 transition count 232
Renaming transitions due to excessive name length > 1024 char.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 1384 place count 273 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1385 place count 272 transition count 210
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 20 rules applied. Total rules applied 1405 place count 256 transition count 206
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 252 transition count 206
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1409 place count 252 transition count 194
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1433 place count 240 transition count 194
Applied a total of 1433 rules in 88 ms. Remains 240 /946 variables (removed 706) and now considering 194/924 (removed 730) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 89 ms. Remains : 240/946 places, 194/924 transitions.
[2024-05-31 21:18:17] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:18:17] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:18:17] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 901 transition count 879
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 901 transition count 879
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 901 transition count 875
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 111 place count 884 transition count 858
Iterating global reduction 1 with 17 rules applied. Total rules applied 128 place count 884 transition count 858
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 881 transition count 855
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 881 transition count 855
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 879 transition count 853
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 879 transition count 853
Applied a total of 138 rules in 153 ms. Remains 879 /946 variables (removed 67) and now considering 853/924 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 879/946 places, 853/924 transitions.
[2024-05-31 21:18:17] [INFO ] Flatten gal took : 21 ms
[2024-05-31 21:18:17] [INFO ] Flatten gal took : 21 ms
[2024-05-31 21:18:17] [INFO ] Input system was already deterministic with 853 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 899 transition count 877
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 899 transition count 877
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 98 place count 899 transition count 873
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 116 place count 881 transition count 855
Iterating global reduction 1 with 18 rules applied. Total rules applied 134 place count 881 transition count 855
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 138 place count 877 transition count 851
Iterating global reduction 1 with 4 rules applied. Total rules applied 142 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 145 place count 874 transition count 848
Iterating global reduction 1 with 3 rules applied. Total rules applied 148 place count 874 transition count 848
Applied a total of 148 rules in 153 ms. Remains 874 /946 variables (removed 72) and now considering 848/924 (removed 76) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 874/946 places, 848/924 transitions.
[2024-05-31 21:18:17] [INFO ] Flatten gal took : 23 ms
[2024-05-31 21:18:17] [INFO ] Flatten gal took : 21 ms
[2024-05-31 21:18:17] [INFO ] Input system was already deterministic with 848 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 901 transition count 879
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 901 transition count 879
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 901 transition count 875
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 112 place count 883 transition count 857
Iterating global reduction 1 with 18 rules applied. Total rules applied 130 place count 883 transition count 857
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 880 transition count 854
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 880 transition count 854
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 879 transition count 853
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 879 transition count 853
Applied a total of 138 rules in 159 ms. Remains 879 /946 variables (removed 67) and now considering 853/924 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 879/946 places, 853/924 transitions.
[2024-05-31 21:18:18] [INFO ] Flatten gal took : 19 ms
[2024-05-31 21:18:18] [INFO ] Flatten gal took : 19 ms
[2024-05-31 21:18:18] [INFO ] Input system was already deterministic with 853 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 902 transition count 880
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 902 transition count 880
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 92 place count 902 transition count 876
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 109 place count 885 transition count 859
Iterating global reduction 1 with 17 rules applied. Total rules applied 126 place count 885 transition count 859
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 130 place count 881 transition count 855
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 881 transition count 855
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 137 place count 878 transition count 852
Iterating global reduction 1 with 3 rules applied. Total rules applied 140 place count 878 transition count 852
Applied a total of 140 rules in 183 ms. Remains 878 /946 variables (removed 68) and now considering 852/924 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 878/946 places, 852/924 transitions.
[2024-05-31 21:18:18] [INFO ] Flatten gal took : 19 ms
[2024-05-31 21:18:18] [INFO ] Flatten gal took : 19 ms
[2024-05-31 21:18:18] [INFO ] Input system was already deterministic with 852 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 900 transition count 878
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 900 transition count 878
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 900 transition count 874
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 114 place count 882 transition count 856
Iterating global reduction 1 with 18 rules applied. Total rules applied 132 place count 882 transition count 856
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 136 place count 878 transition count 852
Iterating global reduction 1 with 4 rules applied. Total rules applied 140 place count 878 transition count 852
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 875 transition count 849
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 875 transition count 849
Applied a total of 146 rules in 156 ms. Remains 875 /946 variables (removed 71) and now considering 849/924 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 875/946 places, 849/924 transitions.
[2024-05-31 21:18:18] [INFO ] Flatten gal took : 18 ms
[2024-05-31 21:18:18] [INFO ] Flatten gal took : 19 ms
[2024-05-31 21:18:18] [INFO ] Input system was already deterministic with 849 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 906 transition count 884
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 906 transition count 884
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 906 transition count 880
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 100 place count 890 transition count 864
Iterating global reduction 1 with 16 rules applied. Total rules applied 116 place count 890 transition count 864
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 886 transition count 860
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 886 transition count 860
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 885 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 885 transition count 859
Applied a total of 126 rules in 161 ms. Remains 885 /946 variables (removed 61) and now considering 859/924 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 885/946 places, 859/924 transitions.
[2024-05-31 21:18:18] [INFO ] Flatten gal took : 18 ms
[2024-05-31 21:18:18] [INFO ] Flatten gal took : 19 ms
[2024-05-31 21:18:18] [INFO ] Input system was already deterministic with 859 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 325 transitions
Trivial Post-agglo rules discarded 325 transitions
Performed 325 trivial Post agglomeration. Transition count delta: 325
Iterating post reduction 0 with 325 rules applied. Total rules applied 325 place count 945 transition count 598
Reduce places removed 325 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 368 rules applied. Total rules applied 693 place count 620 transition count 555
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 719 place count 596 transition count 553
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 721 place count 594 transition count 553
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 116 Pre rules applied. Total rules applied 721 place count 594 transition count 437
Deduced a syphon composed of 116 places in 1 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 4 with 232 rules applied. Total rules applied 953 place count 478 transition count 437
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 983 place count 448 transition count 407
Iterating global reduction 4 with 30 rules applied. Total rules applied 1013 place count 448 transition count 407
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 1013 place count 448 transition count 393
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 1041 place count 434 transition count 393
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 1309 place count 300 transition count 259
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 1330 place count 300 transition count 238
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1372 place count 279 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1373 place count 278 transition count 216
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 20 rules applied. Total rules applied 1393 place count 262 transition count 212
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1397 place count 258 transition count 212
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1397 place count 258 transition count 200
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1421 place count 246 transition count 200
Applied a total of 1421 rules in 85 ms. Remains 246 /946 variables (removed 700) and now considering 200/924 (removed 724) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 85 ms. Remains : 246/946 places, 200/924 transitions.
[2024-05-31 21:18:19] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:18:19] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:18:19] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 946/946 places, 924/924 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 901 transition count 879
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 901 transition count 879
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 901 transition count 875
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 110 place count 885 transition count 859
Iterating global reduction 1 with 16 rules applied. Total rules applied 126 place count 885 transition count 859
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 882 transition count 856
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 882 transition count 856
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 880 transition count 854
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 880 transition count 854
Applied a total of 136 rules in 163 ms. Remains 880 /946 variables (removed 66) and now considering 854/924 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 880/946 places, 854/924 transitions.
[2024-05-31 21:18:19] [INFO ] Flatten gal took : 17 ms
[2024-05-31 21:18:19] [INFO ] Flatten gal took : 17 ms
[2024-05-31 21:18:19] [INFO ] Input system was already deterministic with 854 transitions.
[2024-05-31 21:18:19] [INFO ] Flatten gal took : 19 ms
[2024-05-31 21:18:19] [INFO ] Flatten gal took : 19 ms
[2024-05-31 21:18:19] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-05-31 21:18:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 946 places, 924 transitions and 2218 arcs took 9 ms.
Total runtime 84624 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-00
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-01
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-03
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-04
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-05
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-06
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-07
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-08
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-09
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-10
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2024-11
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2023-12
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2023-13
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2023-14
Could not compute solution for formula : AutoFlight-PT-12b-CTLFireability-2023-15

BK_STOP 1717190299858

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1159/ctl_0_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1159/ctl_1_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1159/ctl_2_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1159/ctl_3_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1159/ctl_4_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1159/ctl_5_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1159/ctl_6_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1159/ctl_7_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1159/ctl_8_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1159/ctl_9_
ctl formula name AutoFlight-PT-12b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1159/ctl_10_
ctl formula name AutoFlight-PT-12b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1159/ctl_11_
ctl formula name AutoFlight-PT-12b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1159/ctl_12_
ctl formula name AutoFlight-PT-12b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1159/ctl_13_
ctl formula name AutoFlight-PT-12b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1159/ctl_14_
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="AutoFlight-PT-12b"
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 AutoFlight-PT-12b, 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 r468-smll-171620167100162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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