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.r355-tall-171683758500314.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 greatspnxred
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 r355-tall-171683758500314
=====================================================================

--------------------
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 1716940618039

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 23:56:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 23:56:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 23:56:59] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-05-28 23:56:59] [INFO ] Transformed 2803 places.
[2024-05-28 23:56:59] [INFO ] Transformed 2603 transitions.
[2024-05-28 23:56:59] [INFO ] Found NUPN structural information;
[2024-05-28 23:56:59] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 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 1139 ms. Remains 2398 /2803 variables (removed 405) and now considering 2198/2603 (removed 405) transitions.
// Phase 1: matrix 2198 rows 2398 cols
[2024-05-28 23:57:00] [INFO ] Computed 361 invariants in 38 ms
[2024-05-28 23:57:01] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2024-05-28 23:57:01] [INFO ] Invariant cache hit.
[2024-05-28 23:57:04] [INFO ] Implicit Places using invariants and state equation in 2056 ms returned []
Implicit Place search using SMT with State Equation took 3139 ms to find 0 implicit places.
Running 2197 sub problems to find dead transitions.
[2024-05-28 23:57:04] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30065 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
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 30042 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 60817ms problems are : Problem set: 0 solved, 2197 unsolved
Search for dead transitions found 0 dead transitions in 60856ms
Starting structural reductions in LTL mode, iteration 1 : 2398/2803 places, 2198/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65167 ms. Remains : 2398/2803 places, 2198/2603 transitions.
Support contains 132 out of 2398 places after structural reductions.
[2024-05-28 23:58:05] [INFO ] Flatten gal took : 147 ms
[2024-05-28 23:58:05] [INFO ] Flatten gal took : 87 ms
[2024-05-28 23:58:05] [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 2034 ms. (19 steps per ms) remains 40/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
[2024-05-28 23:58:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 594/658 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 1740/2398 variables, 296/361 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2398 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 2198/4596 variables, 2398/2759 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4596 variables, 0/2759 constraints. Problems are: Problem set: 0 solved, 40 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 Real declared 4596/4596 variables, and 2759 constraints, problems are : Problem set: 0 solved, 40 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2398/2398 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 594/658 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-28 23:58:12] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/658 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1740/2398 variables, 296/362 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-28 23:58:13] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 5 ms to minimize.
[2024-05-28 23:58:13] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 4 ms to minimize.
[2024-05-28 23:58:13] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 4 ms to minimize.
[2024-05-28 23:58:14] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 4 ms to minimize.
[2024-05-28 23:58:14] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 3 ms to minimize.
[2024-05-28 23:58:14] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 4 ms to minimize.
[2024-05-28 23:58:14] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 4 ms to minimize.
[2024-05-28 23:58:15] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 4 ms to minimize.
[2024-05-28 23:58:15] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 4 ms to minimize.
[2024-05-28 23:58:15] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-05-28 23:58:15] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-05-28 23:58:15] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 4 ms to minimize.
[2024-05-28 23:58:16] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 4 ms to minimize.
[2024-05-28 23:58:16] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-05-28 23:58:16] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 4 ms to minimize.
[2024-05-28 23:58:16] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 4 ms to minimize.
SMT process timed out in 10182ms, After SMT, problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 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 453 transitions
Trivial Post-agglo rules discarded 453 transitions
Performed 453 trivial Post agglomeration. Transition count delta: 453
Iterating post reduction 0 with 453 rules applied. Total rules applied 453 place count 2398 transition count 1745
Reduce places removed 453 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 464 rules applied. Total rules applied 917 place count 1945 transition count 1734
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 928 place count 1934 transition count 1734
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 928 place count 1934 transition count 1452
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 1492 place count 1652 transition count 1452
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1507 place count 1637 transition count 1437
Iterating global reduction 3 with 15 rules applied. Total rules applied 1522 place count 1637 transition count 1437
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1522 place count 1637 transition count 1428
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1540 place count 1628 transition count 1428
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 2 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2898 place count 949 transition count 749
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2899 place count 949 transition count 748
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 2901 place count 948 transition count 747
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3103 place count 847 transition count 800
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 3104 place count 847 transition count 799
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3108 place count 847 transition count 795
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3112 place count 843 transition count 795
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 3149 place count 843 transition count 795
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3150 place count 842 transition count 794
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3152 place count 840 transition count 794
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3152 place count 840 transition count 793
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 3154 place count 839 transition count 793
Applied a total of 3154 rules in 704 ms. Remains 839 /2398 variables (removed 1559) and now considering 793/2198 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 705 ms. Remains : 839/2398 places, 793/2198 transitions.
RANDOM walk for 40000 steps (8 resets) in 835 ms. (47 steps per ms) remains 36/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
// Phase 1: matrix 793 rows 839 cols
[2024-05-28 23:58:18] [INFO ] Computed 359 invariants in 3 ms
[2024-05-28 23:58:18] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 140/199 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 13/212 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 298/510 variables, 212/276 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 452/962 variables, 245/522 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 109/631 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 6/637 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/962 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (OVERLAPS) 13/975 variables, 12/649 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/975 variables, 11/660 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/975 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 15 (OVERLAPS) 22/997 variables, 11/671 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/997 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 17 (OVERLAPS) 303/1300 variables, 185/856 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1300 variables, 68/924 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1300 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 20 (OVERLAPS) 8/1308 variables, 12/936 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1308 variables, 6/942 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1308 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 23 (OVERLAPS) 9/1317 variables, 4/946 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1317 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 25 (OVERLAPS) 130/1447 variables, 70/1016 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1447 variables, 19/1035 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1447 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 28 (OVERLAPS) 7/1454 variables, 10/1045 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1454 variables, 7/1052 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1454 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 31 (OVERLAPS) 8/1462 variables, 4/1056 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1462 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 33 (OVERLAPS) 72/1534 variables, 48/1104 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1534 variables, 20/1124 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1534 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 36 (OVERLAPS) 46/1580 variables, 22/1146 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1580 variables, 6/1152 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1580 variables, 1/1153 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1580 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 40 (OVERLAPS) 3/1583 variables, 5/1158 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1583 variables, 3/1161 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1583 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 43 (OVERLAPS) 1/1584 variables, 1/1162 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1584 variables, 1/1163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1584 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 46 (OVERLAPS) 27/1611 variables, 16/1179 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1611 variables, 8/1187 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1611 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 49 (OVERLAPS) 18/1629 variables, 10/1197 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1629 variables, 3/1200 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1629 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 52 (OVERLAPS) 1/1630 variables, 2/1202 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1630 variables, 1/1203 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1630 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 55 (OVERLAPS) 2/1632 variables, 2/1205 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1632 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1632 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 58 (OVERLAPS) 0/1632 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1632/1632 variables, and 1206 constraints, problems are : Problem set: 0 solved, 36 unsolved in 14466 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 839/839 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 140/199 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 13/212 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 298/510 variables, 212/276 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 17/294 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 452/962 variables, 245/539 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 109/648 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/962 variables, 6/654 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 19/673 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-28 23:58:33] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-28 23:58:33] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 23:58:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/962 variables, 3/676 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/962 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 15 (OVERLAPS) 13/975 variables, 12/688 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/975 variables, 11/699 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/975 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 18 (OVERLAPS) 22/997 variables, 11/710 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/997 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 20 (OVERLAPS) 303/1300 variables, 185/895 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1300 variables, 68/963 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-28 23:58:36] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1300 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1300 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 24 (OVERLAPS) 8/1308 variables, 12/976 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1308 variables, 6/982 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1308 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 27 (OVERLAPS) 9/1317 variables, 4/986 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1317 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 29 (OVERLAPS) 130/1447 variables, 70/1056 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1447 variables, 19/1075 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1447 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 32 (OVERLAPS) 7/1454 variables, 10/1085 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1454 variables, 7/1092 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1454 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 35 (OVERLAPS) 8/1462 variables, 4/1096 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1462 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 37 (OVERLAPS) 72/1534 variables, 48/1144 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1534 variables, 20/1164 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1534 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 40 (OVERLAPS) 46/1580 variables, 22/1186 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1580 variables, 6/1192 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1580 variables, 1/1193 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1580 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 44 (OVERLAPS) 3/1583 variables, 5/1198 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1583 variables, 3/1201 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1583 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 47 (OVERLAPS) 1/1584 variables, 1/1202 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1584 variables, 1/1203 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1584 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 50 (OVERLAPS) 27/1611 variables, 16/1219 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1611 variables, 8/1227 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1611 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 53 (OVERLAPS) 18/1629 variables, 10/1237 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1629 variables, 3/1240 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1629 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 56 (OVERLAPS) 1/1630 variables, 2/1242 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1630 variables, 1/1243 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1630 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 59 (OVERLAPS) 2/1632 variables, 2/1245 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1632 variables, 1/1246 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1632 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 62 (OVERLAPS) 0/1632 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1632/1632 variables, and 1246 constraints, problems are : Problem set: 0 solved, 36 unsolved in 25161 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 839/839 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 4/4 constraints]
After SMT, in 39655ms problems are : Problem set: 0 solved, 36 unsolved
Fused 36 Parikh solutions to 16 different solutions.
Parikh walk visited 1 properties in 5905 ms.
Support contains 57 out of 839 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 839/839 places, 793/793 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 839 transition count 791
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 837 transition count 791
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 837 transition count 789
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 835 transition count 789
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 831 transition count 785
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 830 transition count 787
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 19 place count 830 transition count 787
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 829 transition count 786
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 829 transition count 786
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 827 transition count 784
Applied a total of 23 rules in 121 ms. Remains 827 /839 variables (removed 12) and now considering 784/793 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 827/839 places, 784/793 transitions.
RANDOM walk for 40000 steps (8 resets) in 660 ms. (60 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 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 28 ms. (138 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 38 ms. (102 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 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 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 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 29 ms. (133 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 39 ms. (100 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 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 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 28 ms. (138 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 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 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 22 ms. (174 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 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 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 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 97840 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 35
Probabilistic random walk after 97840 steps, saw 63278 distinct states, run finished after 3008 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 784 rows 827 cols
[2024-05-28 23:59:07] [INFO ] Computed 359 invariants in 3 ms
[2024-05-28 23:59:07] [INFO ] State equation strengthened by 5 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) 133/190 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 13/203 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 284/487 variables, 203/265 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 430/917 variables, 233/499 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/917 variables, 104/603 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/917 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/917 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 11/928 variables, 11/617 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 11/628 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 22/950 variables, 11/639 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/950 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 286/1236 variables, 174/813 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1236 variables, 68/881 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1236 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (OVERLAPS) 4/1240 variables, 8/889 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1240 variables, 4/893 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1240 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 23 (OVERLAPS) 145/1385 variables, 68/961 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1385 variables, 24/985 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1385 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 26 (OVERLAPS) 8/1393 variables, 10/995 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1393 variables, 8/1003 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1393 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 29 (OVERLAPS) 12/1405 variables, 6/1009 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1405 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 31 (OVERLAPS) 93/1498 variables, 62/1071 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1498 variables, 25/1096 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1498 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 34 (OVERLAPS) 58/1556 variables, 28/1124 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1556 variables, 7/1131 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1556 variables, 1/1132 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1556 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 38 (OVERLAPS) 4/1560 variables, 7/1139 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1560 variables, 4/1143 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1560 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 41 (OVERLAPS) 1/1561 variables, 1/1144 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1561 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1561 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 44 (OVERLAPS) 29/1590 variables, 18/1163 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1590 variables, 9/1172 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1590 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 47 (OVERLAPS) 18/1608 variables, 10/1182 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1608 variables, 3/1185 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1608 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 50 (OVERLAPS) 1/1609 variables, 2/1187 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1609 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1609 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 53 (OVERLAPS) 2/1611 variables, 2/1190 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1611 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1611 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 56 (OVERLAPS) 0/1611 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1611/1611 variables, and 1191 constraints, problems are : Problem set: 0 solved, 35 unsolved in 13081 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 827/827 constraints, ReadFeed: 5/5 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) 133/190 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 13/203 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 284/487 variables, 203/265 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 430/917 variables, 233/516 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/917 variables, 104/620 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/917 variables, 3/623 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/917 variables, 18/641 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-28 23:59:21] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/917 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/917 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 11/928 variables, 11/653 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/928 variables, 11/664 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-28 23:59:22] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/928 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 19 (OVERLAPS) 22/950 variables, 11/676 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/950 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (OVERLAPS) 286/1236 variables, 174/850 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1236 variables, 68/918 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1236 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 24 (OVERLAPS) 4/1240 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1240 variables, 4/930 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1240 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 27 (OVERLAPS) 145/1385 variables, 68/998 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1385 variables, 24/1022 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1385 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 30 (OVERLAPS) 8/1393 variables, 10/1032 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1393 variables, 8/1040 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1393 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 33 (OVERLAPS) 12/1405 variables, 6/1046 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1405 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 35 (OVERLAPS) 93/1498 variables, 62/1108 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1498 variables, 25/1133 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1498 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 38 (OVERLAPS) 58/1556 variables, 28/1161 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1556 variables, 7/1168 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1556 variables, 1/1169 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1556 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 42 (OVERLAPS) 4/1560 variables, 7/1176 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1560 variables, 4/1180 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1560 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 45 (OVERLAPS) 1/1561 variables, 1/1181 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1561 variables, 1/1182 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1561 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 48 (OVERLAPS) 29/1590 variables, 18/1200 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1590 variables, 9/1209 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1590 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 51 (OVERLAPS) 18/1608 variables, 10/1219 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1608 variables, 3/1222 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1608 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 54 (OVERLAPS) 1/1609 variables, 2/1224 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1609 variables, 1/1225 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1609 variables, 0/1225 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 57 (OVERLAPS) 2/1611 variables, 2/1227 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1611 variables, 1/1228 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1611 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 60 (OVERLAPS) 0/1611 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1611/1611 variables, and 1228 constraints, problems are : Problem set: 0 solved, 35 unsolved in 22533 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, State Equation: 827/827 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 2/2 constraints]
After SMT, in 35633ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 2180 ms.
Support contains 57 out of 827 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 827/827 places, 784/784 transitions.
Applied a total of 0 rules in 29 ms. Remains 827 /827 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 827/827 places, 784/784 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 827/827 places, 784/784 transitions.
Applied a total of 0 rules in 16 ms. Remains 827 /827 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2024-05-28 23:59:45] [INFO ] Invariant cache hit.
[2024-05-28 23:59:45] [INFO ] Implicit Places using invariants in 460 ms returned [816]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 462 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 826/827 places, 784/784 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 825 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 825 transition count 783
Applied a total of 2 rules in 26 ms. Remains 825 /826 variables (removed 1) and now considering 783/784 (removed 1) transitions.
// Phase 1: matrix 783 rows 825 cols
[2024-05-28 23:59:45] [INFO ] Computed 358 invariants in 2 ms
[2024-05-28 23:59:46] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-28 23:59:46] [INFO ] Invariant cache hit.
[2024-05-28 23:59:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 23:59:47] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 825/827 places, 783/784 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1863 ms. Remains : 825/827 places, 783/784 transitions.
[2024-05-28 23:59:47] [INFO ] Flatten gal took : 73 ms
[2024-05-28 23:59:47] [INFO ] Flatten gal took : 63 ms
[2024-05-28 23:59:47] [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 310 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 311 ms. Remains : 2361/2398 places, 2161/2198 transitions.
[2024-05-28 23:59:47] [INFO ] Flatten gal took : 52 ms
[2024-05-28 23:59:47] [INFO ] Flatten gal took : 54 ms
[2024-05-28 23:59:47] [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 247 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 249 ms. Remains : 2364/2398 places, 2164/2198 transitions.
[2024-05-28 23:59:48] [INFO ] Flatten gal took : 53 ms
[2024-05-28 23:59:48] [INFO ] Flatten gal took : 51 ms
[2024-05-28 23:59:48] [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 269 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 269 ms. Remains : 2368/2398 places, 2168/2198 transitions.
[2024-05-28 23:59:48] [INFO ] Flatten gal took : 45 ms
[2024-05-28 23:59:48] [INFO ] Flatten gal took : 48 ms
[2024-05-28 23:59:48] [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 248 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 248 ms. Remains : 2361/2398 places, 2161/2198 transitions.
[2024-05-28 23:59:49] [INFO ] Flatten gal took : 42 ms
[2024-05-28 23:59:49] [INFO ] Flatten gal took : 45 ms
[2024-05-28 23:59:49] [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 249 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 250 ms. Remains : 2363/2398 places, 2163/2198 transitions.
[2024-05-28 23:59:49] [INFO ] Flatten gal took : 44 ms
[2024-05-28 23:59:49] [INFO ] Flatten gal took : 46 ms
[2024-05-28 23:59:49] [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 2 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 0 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 1 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 437 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 450 ms. Remains : 917/2398 places, 718/2198 transitions.
[2024-05-28 23:59:50] [INFO ] Flatten gal took : 17 ms
[2024-05-28 23:59:50] [INFO ] Flatten gal took : 19 ms
[2024-05-28 23:59:50] [INFO ] Input system was already deterministic with 718 transitions.
RANDOM walk for 123 steps (0 resets) in 5 ms. (20 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 1 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 0 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 307 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 308 ms. Remains : 923/2398 places, 724/2198 transitions.
[2024-05-28 23:59:50] [INFO ] Flatten gal took : 17 ms
[2024-05-28 23:59:50] [INFO ] Flatten gal took : 18 ms
[2024-05-28 23:59:50] [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 270 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 271 ms. Remains : 2364/2398 places, 2164/2198 transitions.
[2024-05-28 23:59:51] [INFO ] Flatten gal took : 41 ms
[2024-05-28 23:59:51] [INFO ] Flatten gal took : 42 ms
[2024-05-28 23:59:51] [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 2 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 1 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 307 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 307 ms. Remains : 923/2398 places, 724/2198 transitions.
[2024-05-28 23:59:51] [INFO ] Flatten gal took : 17 ms
[2024-05-28 23:59:51] [INFO ] Flatten gal took : 19 ms
[2024-05-28 23:59:51] [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 3 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 293 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 294 ms. Remains : 923/2398 places, 724/2198 transitions.
[2024-05-28 23:59:51] [INFO ] Flatten gal took : 17 ms
[2024-05-28 23:59:52] [INFO ] Flatten gal took : 19 ms
[2024-05-28 23:59:52] [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 250 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 251 ms. Remains : 2365/2398 places, 2165/2198 transitions.
[2024-05-28 23:59:52] [INFO ] Flatten gal took : 40 ms
[2024-05-28 23:59:52] [INFO ] Flatten gal took : 42 ms
[2024-05-28 23:59:52] [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 1 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 1 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 303 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 303 ms. Remains : 919/2398 places, 720/2198 transitions.
[2024-05-28 23:59:52] [INFO ] Flatten gal took : 16 ms
[2024-05-28 23:59:52] [INFO ] Flatten gal took : 17 ms
[2024-05-28 23:59:52] [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 230 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 230 ms. Remains : 2363/2398 places, 2163/2198 transitions.
[2024-05-28 23:59:53] [INFO ] Flatten gal took : 40 ms
[2024-05-28 23:59:53] [INFO ] Flatten gal took : 42 ms
[2024-05-28 23:59:53] [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 228 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 229 ms. Remains : 2365/2398 places, 2165/2198 transitions.
[2024-05-28 23:59:53] [INFO ] Flatten gal took : 39 ms
[2024-05-28 23:59:53] [INFO ] Flatten gal took : 42 ms
[2024-05-28 23:59:53] [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 292 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 293 ms. Remains : 2363/2398 places, 2163/2198 transitions.
[2024-05-28 23:59:54] [INFO ] Flatten gal took : 38 ms
[2024-05-28 23:59:54] [INFO ] Flatten gal took : 41 ms
[2024-05-28 23:59:54] [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 252 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 253 ms. Remains : 2368/2398 places, 2168/2198 transitions.
[2024-05-28 23:59:54] [INFO ] Flatten gal took : 38 ms
[2024-05-28 23:59:54] [INFO ] Flatten gal took : 40 ms
[2024-05-28 23:59:54] [INFO ] Input system was already deterministic with 2168 transitions.
[2024-05-28 23:59:54] [INFO ] Flatten gal took : 40 ms
[2024-05-28 23:59:54] [INFO ] Flatten gal took : 41 ms
[2024-05-28 23:59:54] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-28 23:59:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2398 places, 2198 transitions and 5676 arcs took 11 ms.
Total runtime 175528 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-040B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/401/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2398
TRANSITIONS: 2198
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.001s]


SAVING FILE /home/mcc/execution/401/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 710
MODEL NAME: /home/mcc/execution/401/model
2398 places, 2198 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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="greatspnxred"
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 greatspnxred"
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 r355-tall-171683758500314"
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 ;