Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760800314.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPt-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760800314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 686K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-040B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717237944154

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:32:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:32:25] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-06-01 10:32:25] [INFO ] Transformed 2803 places.
[2024-06-01 10:32:25] [INFO ] Transformed 2603 transitions.
[2024-06-01 10:32:25] [INFO ] Found NUPN structural information;
[2024-06-01 10:32:25] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 132 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 403 places :
Symmetric choice reduction at 0 with 403 rule applications. Total rules 403 place count 2400 transition count 2200
Iterating global reduction 0 with 403 rules applied. Total rules applied 806 place count 2400 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 807 place count 2399 transition count 2199
Iterating global reduction 0 with 1 rules applied. Total rules applied 808 place count 2399 transition count 2199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 809 place count 2398 transition count 2198
Iterating global reduction 0 with 1 rules applied. Total rules applied 810 place count 2398 transition count 2198
Applied a total of 810 rules in 1251 ms. Remains 2398 /2803 variables (removed 405) and now considering 2198/2603 (removed 405) transitions.
// Phase 1: matrix 2198 rows 2398 cols
[2024-06-01 10:32:27] [INFO ] Computed 361 invariants in 39 ms
[2024-06-01 10:32:28] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-06-01 10:32:28] [INFO ] Invariant cache hit.
[2024-06-01 10:32:30] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 2937 ms to find 0 implicit places.
Running 2197 sub problems to find dead transitions.
[2024-06-01 10:32:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2397/4596 variables, and 0 constraints, problems are : Problem set: 0 solved, 2197 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2398 constraints, PredecessorRefiner: 2197/2197 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2197 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2397/4596 variables, and 0 constraints, problems are : Problem set: 0 solved, 2197 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2398 constraints, PredecessorRefiner: 0/2197 constraints, Known Traps: 0/0 constraints]
After SMT, in 60768ms problems are : Problem set: 0 solved, 2197 unsolved
Search for dead transitions found 0 dead transitions in 60803ms
Starting structural reductions in LTL mode, iteration 1 : 2398/2803 places, 2198/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65043 ms. Remains : 2398/2803 places, 2198/2603 transitions.
Support contains 132 out of 2398 places after structural reductions.
[2024-06-01 10:33:31] [INFO ] Flatten gal took : 149 ms
[2024-06-01 10:33:31] [INFO ] Flatten gal took : 91 ms
[2024-06-01 10:33:31] [INFO ] Input system was already deterministic with 2198 transitions.
Support contains 129 out of 2398 places (down from 132) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2143 ms. (18 steps per ms) remains 44/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
[2024-06-01 10:33:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 720/789 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1609/2398 variables, 277/361 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2398 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 2198/4596 variables, 2398/2759 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 (/ 1.0 2.0))
(s147 (/ 1.0 2.0))
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 (/ 1.0 2.0))
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 (/ 1.0 2.0))
(s178 0.0)
(s179 (/ 1.0 2.0))
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 (/ 1.0 2.0))
(s525 (/ 1.0 2.0))
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 (/ 1.0 2.0))
(s532 0.0)
(s533 0.0)
(s534 (/ 1.0 2.0))
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 (/ 1.0 2.0))
(s539 (/ 1.0 2.0))
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 (/ 1.0 2.0))
(s593 (/ 1.0 2.0))
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 1.0)
(s651 0.0)
(s652 1.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 1.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 (/ 1.0 4.0))
(s732 (/ 3.0 4.0))
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 1.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 1.0)
(s767 0.0)
(s768 1.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 1.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 1.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 1.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 1.0)
(s826 0.0)
(s827 1.0)
(s828 0.0)
(s829 1.0)
(s830 0.0)
(s831 1.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 1.0)
(s842 0.0)
(s843 1.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 1.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 1.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 1.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 1.0)
(s888 0.0)
(s889 1.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 1.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 1.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 1.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 1.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 1.0)
(s935 0.0)
(s936 0.0)
(s937 1.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 1.0)
(s946 0.0)
(s947 1.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 1.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 1.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 1.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 1.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 1.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 1.0)
(s1001 1.0)
(s1002 0.0)
(s1003 1.0)
(s1004 0.0)
(s1005 0.0)
(s1006 1.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 1.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 1.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 (/ 7.0 8.0))
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 (/ 1.0 8.0))
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 1.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 1.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 1.0)
(s1060 0.0)
(s1061 1.0)
(s1062 0.0)
(s1063 1.0)
(s1064 0.0)
(s1065 1.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 1.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 (/ 1.0 4.0))
(s1083 (/ 3.0 4.0))
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 1.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 1.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 1.0)
(s1111 0.0)
(s1112 0.0)
(s1113 1.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 1.0)
(s1121 0.0)
(s1122 0.0)
(s1123 1.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 1.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 1.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 1.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 1.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 1.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 1.0)
(s1178 1.0)
(s1179 0.0)
(s1180 1.0)
(s1181 0.0)
(s1182 0.0)
(s1183 1.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 1.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 1.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 1.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 1.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 1.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 1.0)
(s1237 1.0)
(s1238 0.0)
(s1239 1.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 1.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 1.0)
(s1253 0.0)
(s1254 1.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 1.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 1.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 1.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 1.0)
(s1295 0.0)
(s1296 1.0)
(s1297 0.0)
(s1298 1.0)
(s1299 0.0)
(s1300 1.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 1.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 1.0)
(s1321 1.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 1.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 1.0)
(s1349 (/ 1.0 2.0))
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 (/ 1.0 2.0))
(s1354 0.0)
(s1355 (/ 1.0 2.0))
(s1356 0.0)
(s1357 1.0)
(s1358 0.0)
(s1359 1.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 1.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 1.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 1.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 1.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 1.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 1.0)
(s1412 0.0)
(s1413 1.0)
(s1414 1.0)
(s1415 0.0)
(s1416 0.0)
(s1417 1.0)
(s1418 0.0)
(s1419 0.0)
(s1420 1.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 1.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 1.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4596/4596 variables, and 2759 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2398/2398 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 720/789 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 10:33:38] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 14 ms to minimize.
[2024-06-01 10:33:38] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/789 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1609/2398 variables, 277/363 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 10:33:40] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 6 ms to minimize.
[2024-06-01 10:33:40] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 5 ms to minimize.
[2024-06-01 10:33:41] [INFO ] Deduced a trap composed of 25 places in 211 ms of which 4 ms to minimize.
[2024-06-01 10:33:41] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 4 ms to minimize.
[2024-06-01 10:33:41] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 5 ms to minimize.
[2024-06-01 10:33:41] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 5 ms to minimize.
[2024-06-01 10:33:42] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 4 ms to minimize.
[2024-06-01 10:33:42] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 4 ms to minimize.
[2024-06-01 10:33:42] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 4 ms to minimize.
[2024-06-01 10:33:42] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2398/4596 variables, and 373 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/2398 constraints, PredecessorRefiner: 0/44 constraints, Known Traps: 12/12 constraints]
After SMT, in 10058ms problems are : Problem set: 0 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 2398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 2398 transition count 1749
Reduce places removed 449 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 460 rules applied. Total rules applied 909 place count 1949 transition count 1738
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 920 place count 1938 transition count 1738
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 920 place count 1938 transition count 1456
Deduced a syphon composed of 282 places in 2 ms
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 3 with 564 rules applied. Total rules applied 1484 place count 1656 transition count 1456
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1499 place count 1641 transition count 1441
Iterating global reduction 3 with 15 rules applied. Total rules applied 1514 place count 1641 transition count 1441
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1514 place count 1641 transition count 1432
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1532 place count 1632 transition count 1432
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 3 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 2884 place count 956 transition count 756
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2885 place count 956 transition count 755
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2887 place count 955 transition count 754
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 3085 place count 856 transition count 805
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3086 place count 856 transition count 804
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 3092 place count 856 transition count 798
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 3098 place count 850 transition count 798
Partial Free-agglomeration rule applied 37 times.
Drop transitions (Partial Free agglomeration) removed 37 transitions
Iterating global reduction 6 with 37 rules applied. Total rules applied 3135 place count 850 transition count 798
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3136 place count 849 transition count 797
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3138 place count 847 transition count 797
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3138 place count 847 transition count 796
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3140 place count 846 transition count 796
Applied a total of 3140 rules in 755 ms. Remains 846 /2398 variables (removed 1552) and now considering 796/2198 (removed 1402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 756 ms. Remains : 846/2398 places, 796/2198 transitions.
RANDOM walk for 40000 steps (8 resets) in 857 ms. (46 steps per ms) remains 35/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
// Phase 1: matrix 796 rows 846 cols
[2024-06-01 10:33:44] [INFO ] Computed 359 invariants in 8 ms
[2024-06-01 10:33:44] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 139/196 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 25/221 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 301/522 variables, 221/289 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 440/962 variables, 234/531 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 101/632 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 6/638 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/962 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 16/978 variables, 15/653 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/978 variables, 14/667 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/978 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 24/1002 variables, 12/679 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1002 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 303/1305 variables, 187/866 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1305 variables, 67/933 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1305 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (OVERLAPS) 9/1314 variables, 13/946 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 23 (OVERLAPS) 9/1323 variables, 4/957 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1323 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 25 (OVERLAPS) 128/1451 variables, 70/1027 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1451 variables, 19/1046 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1451 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 28 (OVERLAPS) 7/1458 variables, 10/1056 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1458 variables, 7/1063 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1458 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 31 (OVERLAPS) 8/1466 variables, 4/1067 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1466 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 33 (OVERLAPS) 73/1539 variables, 48/1115 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1539 variables, 19/1134 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1539 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 36 (OVERLAPS) 1/1540 variables, 1/1135 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1540 variables, 1/1136 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1540 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 39 (OVERLAPS) 47/1587 variables, 22/1158 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1587 variables, 5/1163 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1587 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1587 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 43 (OVERLAPS) 5/1592 variables, 6/1170 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1592 variables, 3/1173 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1592 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 46 (OVERLAPS) 18/1610 variables, 9/1182 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1610 variables, 1/1183 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1610 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 49 (OVERLAPS) 30/1640 variables, 29/1212 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1640 variables, 5/1217 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1640 variables, 9/1226 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1640 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 53 (OVERLAPS) 2/1642 variables, 2/1228 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1642 variables, 1/1229 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1642 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 56 (OVERLAPS) 0/1642 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1642/1642 variables, and 1229 constraints, problems are : Problem set: 0 solved, 35 unsolved in 13874 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 846/846 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 139/196 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 25/221 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 301/522 variables, 221/289 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 8/297 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 18/315 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 440/962 variables, 234/549 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 101/650 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/962 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 17/673 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/962 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 16/978 variables, 15/688 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/978 variables, 14/702 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 10:33:59] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/978 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/978 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (OVERLAPS) 24/1002 variables, 12/715 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1002 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (OVERLAPS) 303/1305 variables, 187/902 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1305 variables, 67/969 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 10:34:01] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1305 variables, 1/970 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1305 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 24 (OVERLAPS) 9/1314 variables, 13/983 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 7/990 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1314 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 27 (OVERLAPS) 9/1323 variables, 4/994 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1323 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 29 (OVERLAPS) 128/1451 variables, 70/1064 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1451 variables, 19/1083 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1451 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 32 (OVERLAPS) 7/1458 variables, 10/1093 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1458 variables, 7/1100 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1458 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 35 (OVERLAPS) 8/1466 variables, 4/1104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1466 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 37 (OVERLAPS) 73/1539 variables, 48/1152 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1539 variables, 19/1171 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1539 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 40 (OVERLAPS) 1/1540 variables, 1/1172 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1540 variables, 1/1173 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1540 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 43 (OVERLAPS) 47/1587 variables, 22/1195 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1587 variables, 5/1200 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1587 variables, 1/1201 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1587 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 47 (OVERLAPS) 5/1592 variables, 6/1207 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1592 variables, 3/1210 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1592 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 50 (OVERLAPS) 18/1610 variables, 9/1219 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1610 variables, 1/1220 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1610 variables, 0/1220 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 53 (OVERLAPS) 30/1640 variables, 29/1249 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1640 variables, 5/1254 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1640 variables, 9/1263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1640 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 57 (OVERLAPS) 2/1642 variables, 2/1265 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1642 variables, 1/1266 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1642 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 60 (OVERLAPS) 0/1642 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1642/1642 variables, and 1266 constraints, problems are : Problem set: 0 solved, 35 unsolved in 23801 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 846/846 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 2/2 constraints]
After SMT, in 37703ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 2260 ms.
Support contains 55 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 796/796 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 846 transition count 790
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 840 transition count 790
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 840 transition count 787
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 837 transition count 787
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 832 transition count 782
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 831 transition count 784
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 831 transition count 784
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 830 transition count 783
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 830 transition count 783
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 826 transition count 779
Applied a total of 37 rules in 203 ms. Remains 826 /846 variables (removed 20) and now considering 779/796 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 826/846 places, 779/796 transitions.
RANDOM walk for 40000 steps (8 resets) in 626 ms. (63 steps per ms) remains 24/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
// Phase 1: matrix 779 rows 826 cols
[2024-06-01 10:34:24] [INFO ] Computed 359 invariants in 2 ms
[2024-06-01 10:34:24] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 102/142 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 11/153 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 221/374 variables, 153/200 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 395/769 variables, 203/403 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 88/491 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 13/782 variables, 12/506 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/782 variables, 13/519 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/782 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 20/802 variables, 10/529 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/802 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 343/1145 variables, 202/731 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1145 variables, 78/809 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1145 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 9/1154 variables, 12/821 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1154 variables, 7/828 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1154 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (OVERLAPS) 178/1332 variables, 84/912 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1332 variables, 28/940 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1332 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (OVERLAPS) 14/1346 variables, 13/953 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1346 variables, 11/964 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1346 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 28 (OVERLAPS) 17/1363 variables, 8/972 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1363 variables, 2/974 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1363 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 31 (OVERLAPS) 113/1476 variables, 76/1050 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1476 variables, 28/1078 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1476 variables, 1/1079 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1476 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 35 (OVERLAPS) 1/1477 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1477 variables, 1/1081 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1477 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 38 (OVERLAPS) 2/1479 variables, 1/1082 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1479 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 40 (OVERLAPS) 70/1549 variables, 37/1119 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1549 variables, 9/1128 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1549 variables, 1/1129 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1549 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 44 (OVERLAPS) 5/1554 variables, 8/1137 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1554 variables, 5/1142 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1554 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 47 (OVERLAPS) 1/1555 variables, 1/1143 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1555 variables, 1/1144 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1555 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 50 (OVERLAPS) 29/1584 variables, 18/1162 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1584 variables, 9/1171 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1584 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 53 (OVERLAPS) 18/1602 variables, 10/1181 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1602 variables, 3/1184 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1602 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 56 (OVERLAPS) 1/1603 variables, 2/1186 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1603 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1603 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 59 (OVERLAPS) 2/1605 variables, 2/1189 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1605 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1605 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 62 (OVERLAPS) 0/1605 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1605/1605 variables, and 1190 constraints, problems are : Problem set: 0 solved, 24 unsolved in 9583 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 826/826 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 102/142 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 11/153 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 221/374 variables, 153/200 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 13/213 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 395/769 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 88/504 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/769 variables, 11/518 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 10:34:34] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:34:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/769 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 13/782 variables, 12/532 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/782 variables, 13/545 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 10:34:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/782 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/782 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (OVERLAPS) 20/802 variables, 10/556 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/802 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (OVERLAPS) 343/1145 variables, 202/758 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1145 variables, 78/836 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1145 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (OVERLAPS) 9/1154 variables, 12/848 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1154 variables, 7/855 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1154 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (OVERLAPS) 178/1332 variables, 84/939 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1332 variables, 28/967 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1332 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 29 (OVERLAPS) 14/1346 variables, 13/980 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1346 variables, 11/991 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1346 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 32 (OVERLAPS) 17/1363 variables, 8/999 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1363 variables, 2/1001 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1363 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 35 (OVERLAPS) 113/1476 variables, 76/1077 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1476 variables, 28/1105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1476 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1476 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 39 (OVERLAPS) 1/1477 variables, 1/1107 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1477 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1477 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 42 (OVERLAPS) 2/1479 variables, 1/1109 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1479 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 44 (OVERLAPS) 70/1549 variables, 37/1146 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1549 variables, 9/1155 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1549 variables, 1/1156 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1549 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 48 (OVERLAPS) 5/1554 variables, 8/1164 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1554 variables, 5/1169 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1554 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 51 (OVERLAPS) 1/1555 variables, 1/1170 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1555 variables, 1/1171 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1555 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 54 (OVERLAPS) 29/1584 variables, 18/1189 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1584 variables, 9/1198 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1584 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 57 (OVERLAPS) 18/1602 variables, 10/1208 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1602 variables, 3/1211 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1602 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 60 (OVERLAPS) 1/1603 variables, 2/1213 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1603 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1603 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 63 (OVERLAPS) 2/1605 variables, 2/1216 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1605 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1605 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 66 (OVERLAPS) 0/1605 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1605/1605 variables, and 1217 constraints, problems are : Problem set: 0 solved, 24 unsolved in 14864 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 826/826 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
After SMT, in 24489ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1034 ms.
Support contains 40 out of 826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 826/826 places, 779/779 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 826 transition count 776
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 823 transition count 776
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 823 transition count 772
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 819 transition count 772
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 815 transition count 768
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 811 transition count 769
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 811 transition count 768
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 810 transition count 768
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 810 transition count 768
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 809 transition count 767
Applied a total of 34 rules in 125 ms. Remains 809 /826 variables (removed 17) and now considering 767/779 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 809/826 places, 767/779 transitions.
RANDOM walk for 40000 steps (8 resets) in 597 ms. (66 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 98311 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 23
Probabilistic random walk after 98311 steps, saw 63306 distinct states, run finished after 3005 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 767 rows 809 cols
[2024-06-01 10:34:53] [INFO ] Computed 359 invariants in 3 ms
[2024-06-01 10:34:53] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 95/131 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 11/142 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 204/346 variables, 142/186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 358/704 variables, 186/372 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/704 variables, 84/456 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/704 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/704 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 8/712 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/712 variables, 8/475 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/712 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 16/728 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/728 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 328/1056 variables, 182/665 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1056 variables, 71/736 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1056 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 9/1065 variables, 12/748 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1065 variables, 5/753 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1065 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (OVERLAPS) 217/1282 variables, 108/861 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1282 variables, 37/898 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1282 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (OVERLAPS) 12/1294 variables, 15/913 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1294 variables, 12/925 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1294 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (OVERLAPS) 16/1310 variables, 8/933 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1310 variables, 2/935 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1310 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (OVERLAPS) 135/1445 variables, 88/1023 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1445 variables, 35/1058 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1445 variables, 1/1059 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1445 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 35 (OVERLAPS) 1/1446 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1446 variables, 1/1062 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1446 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 38 (OVERLAPS) 72/1518 variables, 36/1098 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1518 variables, 9/1107 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1518 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1518 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 42 (OVERLAPS) 5/1523 variables, 9/1117 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1523 variables, 5/1122 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1523 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 45 (OVERLAPS) 1/1524 variables, 1/1123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1524 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1524 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 48 (OVERLAPS) 31/1555 variables, 20/1144 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1555 variables, 10/1154 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1555 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 51 (OVERLAPS) 18/1573 variables, 10/1164 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1573 variables, 3/1167 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1573 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 54 (OVERLAPS) 1/1574 variables, 2/1169 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1574 variables, 1/1170 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1574 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 57 (OVERLAPS) 2/1576 variables, 2/1172 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1576 variables, 1/1173 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1576 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 60 (OVERLAPS) 0/1576 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 1173 constraints, problems are : Problem set: 0 solved, 23 unsolved in 8231 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 809/809 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 95/131 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 11/142 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 204/346 variables, 142/186 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 13/199 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 358/704 variables, 186/385 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/704 variables, 84/469 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/704 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/704 variables, 10/482 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 10:35:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/704 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 8/712 variables, 8/491 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/712 variables, 8/499 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 10:35:03] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/712 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/712 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 16/728 variables, 8/508 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/728 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (OVERLAPS) 328/1056 variables, 182/690 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1056 variables, 71/761 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1056 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (OVERLAPS) 9/1065 variables, 12/773 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1065 variables, 5/778 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1065 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (OVERLAPS) 217/1282 variables, 108/886 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1282 variables, 37/923 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1282 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (OVERLAPS) 12/1294 variables, 15/938 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1294 variables, 12/950 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1294 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (OVERLAPS) 16/1310 variables, 8/958 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1310 variables, 2/960 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1310 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 35 (OVERLAPS) 135/1445 variables, 88/1048 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1445 variables, 35/1083 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1445 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1445 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 39 (OVERLAPS) 1/1446 variables, 2/1086 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1446 variables, 1/1087 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1446 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 42 (OVERLAPS) 72/1518 variables, 36/1123 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1518 variables, 9/1132 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1518 variables, 1/1133 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1518 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 46 (OVERLAPS) 5/1523 variables, 9/1142 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1523 variables, 5/1147 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1523 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 49 (OVERLAPS) 1/1524 variables, 1/1148 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1524 variables, 1/1149 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1524 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 52 (OVERLAPS) 31/1555 variables, 20/1169 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1555 variables, 10/1179 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1555 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 55 (OVERLAPS) 18/1573 variables, 10/1189 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1573 variables, 3/1192 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1573 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 58 (OVERLAPS) 1/1574 variables, 2/1194 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1574 variables, 1/1195 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1574 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 61 (OVERLAPS) 2/1576 variables, 2/1197 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1576 variables, 1/1198 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1576 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 64 (OVERLAPS) 0/1576 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1576/1576 variables, and 1198 constraints, problems are : Problem set: 0 solved, 23 unsolved in 12973 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 809/809 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints]
After SMT, in 21218ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1522 ms.
Support contains 36 out of 809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 809/809 places, 767/767 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 809 transition count 766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 808 transition count 766
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 808 transition count 764
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 6 place count 806 transition count 764
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 805 transition count 763
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 802 transition count 766
Applied a total of 14 rules in 64 ms. Remains 802 /809 variables (removed 7) and now considering 766/767 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 802/809 places, 766/767 transitions.
[2024-06-01 10:35:16] [INFO ] Flatten gal took : 67 ms
[2024-06-01 10:35:16] [INFO ] Flatten gal took : 68 ms
[2024-06-01 10:35:16] [INFO ] Input system was already deterministic with 2198 transitions.
Computed a total of 647 stabilizing places and 647 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2361 transition count 2161
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2361 transition count 2161
Applied a total of 74 rules in 215 ms. Remains 2361 /2398 variables (removed 37) and now considering 2161/2198 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 2361/2398 places, 2161/2198 transitions.
[2024-06-01 10:35:17] [INFO ] Flatten gal took : 55 ms
[2024-06-01 10:35:17] [INFO ] Flatten gal took : 56 ms
[2024-06-01 10:35:17] [INFO ] Input system was already deterministic with 2161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 2364 transition count 2164
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 2364 transition count 2164
Applied a total of 68 rules in 199 ms. Remains 2364 /2398 variables (removed 34) and now considering 2164/2198 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 2364/2398 places, 2164/2198 transitions.
[2024-06-01 10:35:17] [INFO ] Flatten gal took : 49 ms
[2024-06-01 10:35:17] [INFO ] Flatten gal took : 51 ms
[2024-06-01 10:35:17] [INFO ] Input system was already deterministic with 2164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2368 transition count 2168
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2368 transition count 2168
Applied a total of 60 rules in 233 ms. Remains 2368 /2398 variables (removed 30) and now considering 2168/2198 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 2368/2398 places, 2168/2198 transitions.
[2024-06-01 10:35:18] [INFO ] Flatten gal took : 46 ms
[2024-06-01 10:35:18] [INFO ] Flatten gal took : 49 ms
[2024-06-01 10:35:18] [INFO ] Input system was already deterministic with 2168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 2361 transition count 2161
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 2361 transition count 2161
Applied a total of 74 rules in 201 ms. Remains 2361 /2398 variables (removed 37) and now considering 2161/2198 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 2361/2398 places, 2161/2198 transitions.
[2024-06-01 10:35:18] [INFO ] Flatten gal took : 44 ms
[2024-06-01 10:35:18] [INFO ] Flatten gal took : 44 ms
[2024-06-01 10:35:18] [INFO ] Input system was already deterministic with 2161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2363 transition count 2163
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2363 transition count 2163
Applied a total of 70 rules in 194 ms. Remains 2363 /2398 variables (removed 35) and now considering 2163/2198 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 2363/2398 places, 2163/2198 transitions.
[2024-06-01 10:35:18] [INFO ] Flatten gal took : 42 ms
[2024-06-01 10:35:18] [INFO ] Flatten gal took : 43 ms
[2024-06-01 10:35:18] [INFO ] Input system was already deterministic with 2163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 491 rules applied. Total rules applied 491 place count 2397 transition count 1706
Reduce places removed 491 places and 0 transitions.
Iterating post reduction 1 with 491 rules applied. Total rules applied 982 place count 1906 transition count 1706
Performed 297 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 297 Pre rules applied. Total rules applied 982 place count 1906 transition count 1409
Deduced a syphon composed of 297 places in 1 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 2 with 594 rules applied. Total rules applied 1576 place count 1609 transition count 1409
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 1603 place count 1582 transition count 1382
Iterating global reduction 2 with 27 rules applied. Total rules applied 1630 place count 1582 transition count 1382
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 1630 place count 1582 transition count 1361
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 1672 place count 1561 transition count 1361
Performed 638 Post agglomeration using F-continuation condition.Transition count delta: 638
Deduced a syphon composed of 638 places in 1 ms
Reduce places removed 638 places and 0 transitions.
Iterating global reduction 2 with 1276 rules applied. Total rules applied 2948 place count 923 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2949 place count 923 transition count 722
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2951 place count 922 transition count 721
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2953 place count 920 transition count 719
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2955 place count 918 transition count 719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2955 place count 918 transition count 718
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2957 place count 917 transition count 718
Applied a total of 2957 rules in 337 ms. Remains 917 /2398 variables (removed 1481) and now considering 718/2198 (removed 1480) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 337 ms. Remains : 917/2398 places, 718/2198 transitions.
[2024-06-01 10:35:19] [INFO ] Flatten gal took : 18 ms
[2024-06-01 10:35:19] [INFO ] Flatten gal took : 19 ms
[2024-06-01 10:35:19] [INFO ] Input system was already deterministic with 718 transitions.
RANDOM walk for 83 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-040B-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 2397 transition count 1707
Reduce places removed 490 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 491 rules applied. Total rules applied 981 place count 1907 transition count 1706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 982 place count 1906 transition count 1706
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 296 Pre rules applied. Total rules applied 982 place count 1906 transition count 1410
Deduced a syphon composed of 296 places in 2 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 3 with 592 rules applied. Total rules applied 1574 place count 1610 transition count 1410
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1601 place count 1583 transition count 1383
Iterating global reduction 3 with 27 rules applied. Total rules applied 1628 place count 1583 transition count 1383
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 1628 place count 1583 transition count 1362
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1670 place count 1562 transition count 1362
Performed 633 Post agglomeration using F-continuation condition.Transition count delta: 633
Deduced a syphon composed of 633 places in 1 ms
Reduce places removed 633 places and 0 transitions.
Iterating global reduction 3 with 1266 rules applied. Total rules applied 2936 place count 929 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2937 place count 929 transition count 728
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2939 place count 928 transition count 727
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2941 place count 926 transition count 725
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2943 place count 924 transition count 725
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2943 place count 924 transition count 724
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2945 place count 923 transition count 724
Applied a total of 2945 rules in 316 ms. Remains 923 /2398 variables (removed 1475) and now considering 724/2198 (removed 1474) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 317 ms. Remains : 923/2398 places, 724/2198 transitions.
[2024-06-01 10:35:19] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:35:19] [INFO ] Flatten gal took : 18 ms
[2024-06-01 10:35:19] [INFO ] Input system was already deterministic with 724 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 2364 transition count 2164
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 2364 transition count 2164
Applied a total of 68 rules in 209 ms. Remains 2364 /2398 variables (removed 34) and now considering 2164/2198 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 2364/2398 places, 2164/2198 transitions.
[2024-06-01 10:35:20] [INFO ] Flatten gal took : 38 ms
[2024-06-01 10:35:20] [INFO ] Flatten gal took : 40 ms
[2024-06-01 10:35:20] [INFO ] Input system was already deterministic with 2164 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 2397 transition count 1708
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 1908 transition count 1708
Performed 298 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 298 Pre rules applied. Total rules applied 978 place count 1908 transition count 1410
Deduced a syphon composed of 298 places in 1 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1574 place count 1610 transition count 1410
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 1600 place count 1584 transition count 1384
Iterating global reduction 2 with 26 rules applied. Total rules applied 1626 place count 1584 transition count 1384
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 1626 place count 1584 transition count 1364
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1666 place count 1564 transition count 1364
Performed 635 Post agglomeration using F-continuation condition.Transition count delta: 635
Deduced a syphon composed of 635 places in 1 ms
Reduce places removed 635 places and 0 transitions.
Iterating global reduction 2 with 1270 rules applied. Total rules applied 2936 place count 929 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2937 place count 929 transition count 728
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2939 place count 928 transition count 727
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2941 place count 926 transition count 725
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2943 place count 924 transition count 725
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2943 place count 924 transition count 724
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2945 place count 923 transition count 724
Applied a total of 2945 rules in 246 ms. Remains 923 /2398 variables (removed 1475) and now considering 724/2198 (removed 1474) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 247 ms. Remains : 923/2398 places, 724/2198 transitions.
[2024-06-01 10:35:20] [INFO ] Flatten gal took : 17 ms
[2024-06-01 10:35:20] [INFO ] Flatten gal took : 18 ms
[2024-06-01 10:35:20] [INFO ] Input system was already deterministic with 724 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 2397 transition count 1707
Reduce places removed 490 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 491 rules applied. Total rules applied 981 place count 1907 transition count 1706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 982 place count 1906 transition count 1706
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 296 Pre rules applied. Total rules applied 982 place count 1906 transition count 1410
Deduced a syphon composed of 296 places in 2 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 3 with 592 rules applied. Total rules applied 1574 place count 1610 transition count 1410
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1600 place count 1584 transition count 1384
Iterating global reduction 3 with 26 rules applied. Total rules applied 1626 place count 1584 transition count 1384
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 1626 place count 1584 transition count 1364
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 1666 place count 1564 transition count 1364
Performed 635 Post agglomeration using F-continuation condition.Transition count delta: 635
Deduced a syphon composed of 635 places in 0 ms
Reduce places removed 635 places and 0 transitions.
Iterating global reduction 3 with 1270 rules applied. Total rules applied 2936 place count 929 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2937 place count 929 transition count 728
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2939 place count 928 transition count 727
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2941 place count 926 transition count 725
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2943 place count 924 transition count 725
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2943 place count 924 transition count 724
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2945 place count 923 transition count 724
Applied a total of 2945 rules in 257 ms. Remains 923 /2398 variables (removed 1475) and now considering 724/2198 (removed 1474) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 259 ms. Remains : 923/2398 places, 724/2198 transitions.
[2024-06-01 10:35:20] [INFO ] Flatten gal took : 17 ms
[2024-06-01 10:35:20] [INFO ] Flatten gal took : 18 ms
[2024-06-01 10:35:20] [INFO ] Input system was already deterministic with 724 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2365 transition count 2165
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2365 transition count 2165
Applied a total of 66 rules in 199 ms. Remains 2365 /2398 variables (removed 33) and now considering 2165/2198 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 2365/2398 places, 2165/2198 transitions.
[2024-06-01 10:35:21] [INFO ] Flatten gal took : 60 ms
[2024-06-01 10:35:21] [INFO ] Flatten gal took : 44 ms
[2024-06-01 10:35:21] [INFO ] Input system was already deterministic with 2165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 2397 transition count 1707
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 1907 transition count 1707
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 296 Pre rules applied. Total rules applied 980 place count 1907 transition count 1411
Deduced a syphon composed of 296 places in 2 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 2 with 592 rules applied. Total rules applied 1572 place count 1611 transition count 1411
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 1599 place count 1584 transition count 1384
Iterating global reduction 2 with 27 rules applied. Total rules applied 1626 place count 1584 transition count 1384
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 1626 place count 1584 transition count 1363
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 1668 place count 1563 transition count 1363
Performed 638 Post agglomeration using F-continuation condition.Transition count delta: 638
Deduced a syphon composed of 638 places in 1 ms
Reduce places removed 638 places and 0 transitions.
Iterating global reduction 2 with 1276 rules applied. Total rules applied 2944 place count 925 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2945 place count 925 transition count 724
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2947 place count 924 transition count 723
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2949 place count 922 transition count 721
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2951 place count 920 transition count 721
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2951 place count 920 transition count 720
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2953 place count 919 transition count 720
Applied a total of 2953 rules in 241 ms. Remains 919 /2398 variables (removed 1479) and now considering 720/2198 (removed 1478) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 241 ms. Remains : 919/2398 places, 720/2198 transitions.
[2024-06-01 10:35:21] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:35:21] [INFO ] Flatten gal took : 17 ms
[2024-06-01 10:35:21] [INFO ] Input system was already deterministic with 720 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2363 transition count 2163
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2363 transition count 2163
Applied a total of 70 rules in 215 ms. Remains 2363 /2398 variables (removed 35) and now considering 2163/2198 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 2363/2398 places, 2163/2198 transitions.
[2024-06-01 10:35:21] [INFO ] Flatten gal took : 38 ms
[2024-06-01 10:35:21] [INFO ] Flatten gal took : 41 ms
[2024-06-01 10:35:21] [INFO ] Input system was already deterministic with 2163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2365 transition count 2165
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2365 transition count 2165
Applied a total of 66 rules in 212 ms. Remains 2365 /2398 variables (removed 33) and now considering 2165/2198 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 2365/2398 places, 2165/2198 transitions.
[2024-06-01 10:35:22] [INFO ] Flatten gal took : 38 ms
[2024-06-01 10:35:22] [INFO ] Flatten gal took : 40 ms
[2024-06-01 10:35:22] [INFO ] Input system was already deterministic with 2165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 2363 transition count 2163
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 2363 transition count 2163
Applied a total of 70 rules in 212 ms. Remains 2363 /2398 variables (removed 35) and now considering 2163/2198 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 2363/2398 places, 2163/2198 transitions.
[2024-06-01 10:35:22] [INFO ] Flatten gal took : 38 ms
[2024-06-01 10:35:22] [INFO ] Flatten gal took : 39 ms
[2024-06-01 10:35:22] [INFO ] Input system was already deterministic with 2163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2398/2398 places, 2198/2198 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2368 transition count 2168
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2368 transition count 2168
Applied a total of 60 rules in 237 ms. Remains 2368 /2398 variables (removed 30) and now considering 2168/2198 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 2368/2398 places, 2168/2198 transitions.
[2024-06-01 10:35:22] [INFO ] Flatten gal took : 40 ms
[2024-06-01 10:35:23] [INFO ] Flatten gal took : 43 ms
[2024-06-01 10:35:23] [INFO ] Input system was already deterministic with 2168 transitions.
[2024-06-01 10:35:23] [INFO ] Flatten gal took : 43 ms
[2024-06-01 10:35:23] [INFO ] Flatten gal took : 44 ms
[2024-06-01 10:35:23] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 10:35:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2398 places, 2198 transitions and 5676 arcs took 9 ms.
Total runtime 178072 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 : ShieldIIPt-PT-040B-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-08
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPt-PT-040B-CTLFireability-2023-15

BK_STOP 1717238123682

--------------------
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 ShieldIIPt-PT-040B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/609/ctl_0_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/609/ctl_1_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/609/ctl_2_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/609/ctl_3_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/609/ctl_4_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/609/ctl_5_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/609/ctl_6_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/609/ctl_7_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/609/ctl_8_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/609/ctl_9_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/609/ctl_10_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/609/ctl_11_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/609/ctl_12_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/609/ctl_13_
ctl formula name ShieldIIPt-PT-040B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/609/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="ShieldIIPt-PT-040B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-040B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760800314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B 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 ;