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.r399-tall-171690530100306.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 StigmergyElection-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530100306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 428K 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 StigmergyElection-PT-05b-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717009766114

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:09:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:09:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:09:27] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-29 19:09:27] [INFO ] Transformed 699 places.
[2024-05-29 19:09:27] [INFO ] Transformed 1266 transitions.
[2024-05-29 19:09:27] [INFO ] Found NUPN structural information;
[2024-05-29 19:09:27] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 129 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 631 transition count 1198
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 631 transition count 1198
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 167 place count 600 transition count 1167
Iterating global reduction 0 with 31 rules applied. Total rules applied 198 place count 600 transition count 1167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 200 place count 598 transition count 1165
Iterating global reduction 0 with 2 rules applied. Total rules applied 202 place count 598 transition count 1165
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 204 place count 596 transition count 1163
Iterating global reduction 0 with 2 rules applied. Total rules applied 206 place count 596 transition count 1163
Applied a total of 206 rules in 183 ms. Remains 596 /699 variables (removed 103) and now considering 1163/1266 (removed 103) transitions.
// Phase 1: matrix 1163 rows 596 cols
[2024-05-29 19:09:27] [INFO ] Computed 6 invariants in 27 ms
[2024-05-29 19:09:28] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-29 19:09:28] [INFO ] Invariant cache hit.
[2024-05-29 19:09:28] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Running 1162 sub problems to find dead transitions.
[2024-05-29 19:09:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
[2024-05-29 19:09:53] [INFO ] Deduced a trap composed of 170 places in 957 ms of which 37 ms to minimize.
[2024-05-29 19:09:53] [INFO ] Deduced a trap composed of 174 places in 482 ms of which 4 ms to minimize.
[2024-05-29 19:09:54] [INFO ] Deduced a trap composed of 173 places in 305 ms of which 3 ms to minimize.
[2024-05-29 19:09:54] [INFO ] Deduced a trap composed of 174 places in 211 ms of which 2 ms to minimize.
[2024-05-29 19:09:55] [INFO ] Deduced a trap composed of 174 places in 231 ms of which 3 ms to minimize.
[2024-05-29 19:09:55] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 3 ms to minimize.
[2024-05-29 19:09:55] [INFO ] Deduced a trap composed of 101 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:09:56] [INFO ] Deduced a trap composed of 464 places in 329 ms of which 5 ms to minimize.
[2024-05-29 19:09:56] [INFO ] Deduced a trap composed of 175 places in 225 ms of which 3 ms to minimize.
[2024-05-29 19:09:58] [INFO ] Deduced a trap composed of 179 places in 314 ms of which 3 ms to minimize.
[2024-05-29 19:09:58] [INFO ] Deduced a trap composed of 175 places in 229 ms of which 3 ms to minimize.
[2024-05-29 19:09:59] [INFO ] Deduced a trap composed of 172 places in 234 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)timeout

(s422 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1759 variables, and 18 constraints, problems are : Problem set: 0 solved, 1162 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 1162/1162 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
[2024-05-29 19:10:13] [INFO ] Deduced a trap composed of 173 places in 242 ms of which 3 ms to minimize.
[2024-05-29 19:10:15] [INFO ] Deduced a trap composed of 170 places in 242 ms of which 2 ms to minimize.
[2024-05-29 19:10:17] [INFO ] Deduced a trap composed of 169 places in 294 ms of which 3 ms to minimize.
[2024-05-29 19:10:17] [INFO ] Deduced a trap composed of 166 places in 279 ms of which 3 ms to minimize.
[2024-05-29 19:10:17] [INFO ] Deduced a trap composed of 171 places in 240 ms of which 3 ms to minimize.
[2024-05-29 19:10:18] [INFO ] Deduced a trap composed of 174 places in 219 ms of which 2 ms to minimize.
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 170 places in 259 ms of which 2 ms to minimize.
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 169 places in 203 ms of which 2 ms to minimize.
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 172 places in 232 ms of which 2 ms to minimize.
[2024-05-29 19:10:22] [INFO ] Deduced a trap composed of 173 places in 232 ms of which 3 ms to minimize.
[2024-05-29 19:10:22] [INFO ] Deduced a trap composed of 173 places in 251 ms of which 3 ms to minimize.
[2024-05-29 19:10:24] [INFO ] Deduced a trap composed of 223 places in 255 ms of which 2 ms to minimize.
[2024-05-29 19:10:24] [INFO ] Deduced a trap composed of 172 places in 249 ms of which 2 ms to minimize.
[2024-05-29 19:10:25] [INFO ] Deduced a trap composed of 174 places in 230 ms of which 2 ms to minimize.
[2024-05-29 19:10:25] [INFO ] Deduced a trap composed of 171 places in 270 ms of which 3 ms to minimize.
[2024-05-29 19:10:25] [INFO ] Deduced a trap composed of 176 places in 299 ms of which 4 ms to minimize.
[2024-05-29 19:10:26] [INFO ] Deduced a trap composed of 177 places in 247 ms of which 3 ms to minimize.
[2024-05-29 19:10:26] [INFO ] Deduced a trap composed of 176 places in 254 ms of which 3 ms to minimize.
[2024-05-29 19:10:26] [INFO ] Deduced a trap composed of 178 places in 223 ms of which 3 ms to minimize.
[2024-05-29 19:10:27] [INFO ] Deduced a trap composed of 180 places in 251 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1162 unsolved
[2024-05-29 19:10:27] [INFO ] Deduced a trap composed of 173 places in 248 ms of which 3 ms to minimize.
[2024-05-29 19:10:28] [INFO ] Deduced a trap composed of 176 places in 267 ms of which 4 ms to minimize.
[2024-05-29 19:10:28] [INFO ] Deduced a trap composed of 176 places in 267 ms of which 22 ms to minimize.
[2024-05-29 19:10:29] [INFO ] Deduced a trap composed of 177 places in 253 ms of which 2 ms to minimize.
[2024-05-29 19:10:29] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/1759 variables, and 43 constraints, problems are : Problem set: 0 solved, 1162 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 0/1162 constraints, Known Traps: 37/37 constraints]
After SMT, in 62768ms problems are : Problem set: 0 solved, 1162 unsolved
Search for dead transitions found 0 dead transitions in 62824ms
Starting structural reductions in LTL mode, iteration 1 : 596/699 places, 1163/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63871 ms. Remains : 596/699 places, 1163/1266 transitions.
Support contains 129 out of 596 places after structural reductions.
[2024-05-29 19:10:31] [INFO ] Flatten gal took : 167 ms
[2024-05-29 19:10:32] [INFO ] Flatten gal took : 85 ms
[2024-05-29 19:10:32] [INFO ] Input system was already deterministic with 1163 transitions.
Support contains 127 out of 596 places (down from 129) after GAL structural reductions.
RANDOM walk for 40000 steps (449 resets) in 2699 ms. (14 steps per ms) remains 85/115 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 84/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 118 ms. (33 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 84/84 properties
[2024-05-29 19:10:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp101 is UNSAT
At refinement iteration 1 (OVERLAPS) 499/596 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 77 unsolved
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 166 places in 276 ms of which 3 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 166 places in 261 ms of which 2 ms to minimize.
[2024-05-29 19:10:36] [INFO ] Deduced a trap composed of 171 places in 247 ms of which 3 ms to minimize.
[2024-05-29 19:10:36] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 4/10 constraints. Problems are: Problem set: 7 solved, 77 unsolved
[2024-05-29 19:10:37] [INFO ] Deduced a trap composed of 174 places in 251 ms of which 3 ms to minimize.
[2024-05-29 19:10:38] [INFO ] Deduced a trap composed of 173 places in 232 ms of which 3 ms to minimize.
[2024-05-29 19:10:38] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 2 ms to minimize.
[2024-05-29 19:10:38] [INFO ] Deduced a trap composed of 229 places in 238 ms of which 3 ms to minimize.
[2024-05-29 19:10:38] [INFO ] Deduced a trap composed of 177 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1759 variables, and 15 constraints, problems are : Problem set: 7 solved, 77 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 7 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 77 unsolved
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 1 (OVERLAPS) 505/596 variables, 6/6 constraints. Problems are: Problem set: 9 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 9/15 constraints. Problems are: Problem set: 9 solved, 75 unsolved
[2024-05-29 19:10:40] [INFO ] Deduced a trap composed of 176 places in 284 ms of which 9 ms to minimize.
[2024-05-29 19:10:40] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 3 ms to minimize.
[2024-05-29 19:10:40] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 2 ms to minimize.
[2024-05-29 19:10:40] [INFO ] Deduced a trap composed of 173 places in 204 ms of which 2 ms to minimize.
[2024-05-29 19:10:41] [INFO ] Deduced a trap composed of 171 places in 210 ms of which 3 ms to minimize.
[2024-05-29 19:10:41] [INFO ] Deduced a trap composed of 169 places in 261 ms of which 3 ms to minimize.
[2024-05-29 19:10:41] [INFO ] Deduced a trap composed of 168 places in 267 ms of which 3 ms to minimize.
[2024-05-29 19:10:41] [INFO ] Deduced a trap composed of 174 places in 257 ms of which 3 ms to minimize.
[2024-05-29 19:10:42] [INFO ] Deduced a trap composed of 173 places in 236 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 9/24 constraints. Problems are: Problem set: 9 solved, 75 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 596/1759 variables, and 24 constraints, problems are : Problem set: 9 solved, 75 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 0/84 constraints, Known Traps: 18/18 constraints]
After SMT, in 10380ms problems are : Problem set: 9 solved, 75 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Graph (trivial) has 450 edges and 596 vertex of which 33 / 596 are part of one of the 7 SCC in 5 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 1147 edges and 570 vertex of which 566 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 282 rules applied. Total rules applied 284 place count 566 transition count 845
Reduce places removed 278 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 286 rules applied. Total rules applied 570 place count 288 transition count 837
Reduce places removed 4 places and 0 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 2 with 51 rules applied. Total rules applied 621 place count 284 transition count 790
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 55 rules applied. Total rules applied 676 place count 237 transition count 782
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 680 place count 233 transition count 782
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 680 place count 233 transition count 763
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 718 place count 214 transition count 763
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 721 place count 211 transition count 760
Iterating global reduction 5 with 3 rules applied. Total rules applied 724 place count 211 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 724 place count 211 transition count 759
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 726 place count 210 transition count 759
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 768 place count 189 transition count 738
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 769 place count 189 transition count 737
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 771 place count 187 transition count 735
Iterating global reduction 6 with 2 rules applied. Total rules applied 773 place count 187 transition count 735
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 6 with 2 rules applied. Total rules applied 775 place count 186 transition count 734
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 785 place count 181 transition count 736
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 797 place count 181 transition count 724
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 805 place count 181 transition count 716
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 813 place count 173 transition count 716
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 817 place count 173 transition count 716
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 173 transition count 716
Applied a total of 818 rules in 302 ms. Remains 173 /596 variables (removed 423) and now considering 716/1163 (removed 447) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 173/596 places, 716/1163 transitions.
RANDOM walk for 40000 steps (2732 resets) in 1348 ms. (29 steps per ms) remains 64/75 properties
BEST_FIRST walk for 4004 steps (38 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (37 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (42 resets) in 25 ms. (153 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (45 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (43 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (44 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (63 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (41 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (42 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (37 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (37 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (41 resets) in 9 ms. (400 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (43 resets) in 11 ms. (333 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (40 resets) in 11 ms. (333 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (45 resets) in 10 ms. (363 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (45 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (43 resets) in 28 ms. (138 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (40 resets) in 11 ms. (333 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (40 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (40 resets) in 18 ms. (210 steps per ms) remains 59/63 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (38 resets) in 10 ms. (363 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (40 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (40 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (47 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (41 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (39 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (41 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (26 resets) in 8 ms. (444 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (45 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (42 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (46 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
// Phase 1: matrix 716 rows 173 cols
[2024-05-29 19:10:45] [INFO ] Computed 6 invariants in 10 ms
[2024-05-29 19:10:45] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 110/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 48 places in 375 ms of which 1 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 1 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 716/889 variables, 173/182 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/889 variables, 25/207 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/889 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 889/889 variables, and 207 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3466 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 173/173 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 110/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 19:10:49] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 1 ms to minimize.
[2024-05-29 19:10:49] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 1 ms to minimize.
[2024-05-29 19:10:49] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 1 ms to minimize.
[2024-05-29 19:10:49] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 716/889 variables, 173/186 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 25/211 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 57/268 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/889 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 19:10:54] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/889 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 19:10:59] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/889 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/889 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 19:11:09] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 1 ms to minimize.
[2024-05-29 19:11:10] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/889 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/889 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-29 19:11:20] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/889 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/889 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 16 (OVERLAPS) 0/889 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 889/889 variables, and 274 constraints, problems are : Problem set: 0 solved, 57 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 173/173 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 13/13 constraints]
After SMT, in 48711ms problems are : Problem set: 0 solved, 57 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 716/716 transitions.
Graph (trivial) has 75 edges and 173 vertex of which 8 / 173 are part of one of the 3 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 168 transition count 698
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 158 transition count 696
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 157 transition count 694
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 155 transition count 694
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 28 place count 155 transition count 690
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 36 place count 151 transition count 690
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 150 transition count 689
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 150 transition count 689
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 52 place count 143 transition count 682
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 60 place count 139 transition count 683
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 139 transition count 681
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 94 place count 139 transition count 649
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 126 place count 107 transition count 649
Applied a total of 126 rules in 142 ms. Remains 107 /173 variables (removed 66) and now considering 649/716 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 107/173 places, 649/716 transitions.
RANDOM walk for 40000 steps (3462 resets) in 807 ms. (49 steps per ms) remains 36/57 properties
BEST_FIRST walk for 4004 steps (55 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (45 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (52 resets) in 8 ms. (444 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (79 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 7 ms. (500 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4002 steps (46 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (41 resets) in 12 ms. (307 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4004 steps (27 resets) in 7 ms. (500 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4001 steps (21 resets) in 8 ms. (444 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (49 resets) in 12 ms. (308 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4002 steps (44 resets) in 7 ms. (500 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (50 resets) in 12 ms. (307 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (17 resets) in 8 ms. (444 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (45 resets) in 7 ms. (500 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (50 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (26 resets) in 10 ms. (363 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4002 steps (44 resets) in 15 ms. (250 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (50 resets) in 10 ms. (364 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (50 resets) in 12 ms. (308 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (54 resets) in 10 ms. (363 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (22 resets) in 9 ms. (400 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (14 resets) in 7 ms. (500 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (56 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (50 resets) in 9 ms. (400 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (45 resets) in 9 ms. (400 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (50 resets) in 8 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4002 steps (20 resets) in 9 ms. (400 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 9/10 properties
// Phase 1: matrix 649 rows 107 cols
[2024-05-29 19:11:34] [INFO ] Computed 6 invariants in 5 ms
[2024-05-29 19:11:34] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 78/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 19:11:34] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2024-05-29 19:11:35] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2024-05-29 19:11:35] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 649/756 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 54/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/756 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 756/756 variables, and 170 constraints, problems are : Problem set: 0 solved, 9 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 78/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 649/756 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 54/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 19:11:36] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 1 ms to minimize.
[2024-05-29 19:11:36] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/756 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 756/756 variables, and 181 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1761 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 2751ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 4 properties in 1671 ms.
Support contains 25 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 649/649 transitions.
Graph (trivial) has 60 edges and 107 vertex of which 11 / 107 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 486 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 100 transition count 621
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 84 transition count 618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 83 transition count 618
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 39 place count 83 transition count 617
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 82 transition count 617
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 51 place count 72 transition count 527
Iterating global reduction 3 with 10 rules applied. Total rules applied 61 place count 72 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 72 transition count 526
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 71 transition count 522
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 71 transition count 522
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 76 place count 65 transition count 516
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 83 place count 65 transition count 509
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 89 place count 59 transition count 448
Iterating global reduction 5 with 6 rules applied. Total rules applied 95 place count 59 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 96 place count 59 transition count 447
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 100 place count 57 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 104 place count 57 transition count 445
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 114 place count 57 transition count 435
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 125 place count 47 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 137 place count 47 transition count 422
Applied a total of 137 rules in 109 ms. Remains 47 /107 variables (removed 60) and now considering 422/649 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 47/107 places, 422/649 transitions.
RANDOM walk for 40000 steps (3946 resets) in 221 ms. (180 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (970 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
// Phase 1: matrix 422 rows 47 cols
[2024-05-29 19:11:39] [INFO ] Computed 6 invariants in 3 ms
[2024-05-29 19:11:39] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 422/469 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 211/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/469 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 422/469 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 211/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/469 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 419
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 44 transition count 417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 42 transition count 417
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 14 place count 38 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 38 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 22 place count 38 transition count 218
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 24 place count 37 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 26 place count 37 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 27 place count 36 transition count 213
Iterating global reduction 5 with 1 rules applied. Total rules applied 28 place count 36 transition count 213
Free-agglomeration rule applied 13 times with reduction of 57 identical transitions.
Iterating global reduction 5 with 13 rules applied. Total rules applied 41 place count 36 transition count 143
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 81 place count 23 transition count 116
Applied a total of 81 rules in 26 ms. Remains 23 /47 variables (removed 24) and now considering 116/422 (removed 306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 23/47 places, 116/422 transitions.
RANDOM walk for 7939 steps (324 resets) in 39 ms. (198 steps per ms) remains 0/1 properties
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-05-29 19:11:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-29 19:11:39] [INFO ] Flatten gal took : 64 ms
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:11:39] [INFO ] Flatten gal took : 66 ms
[2024-05-29 19:11:40] [INFO ] Input system was already deterministic with 1163 transitions.
Support contains 104 out of 596 places (down from 119) after GAL structural reductions.
Computed a total of 80 stabilizing places and 85 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Graph (trivial) has 608 edges and 596 vertex of which 86 / 596 are part of one of the 15 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 372 transitions
Trivial Post-agglo rules discarded 372 transitions
Performed 372 trivial Post agglomeration. Transition count delta: 372
Iterating post reduction 0 with 372 rules applied. Total rules applied 373 place count 524 transition count 709
Reduce places removed 372 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 382 rules applied. Total rules applied 755 place count 152 transition count 699
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 761 place count 147 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 762 place count 146 transition count 698
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 762 place count 146 transition count 683
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 792 place count 131 transition count 683
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 805 place count 118 transition count 670
Iterating global reduction 4 with 13 rules applied. Total rules applied 818 place count 118 transition count 670
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 818 place count 118 transition count 667
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 824 place count 115 transition count 667
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 827 place count 112 transition count 584
Iterating global reduction 4 with 3 rules applied. Total rules applied 830 place count 112 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 831 place count 112 transition count 583
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 832 place count 111 transition count 582
Iterating global reduction 5 with 1 rules applied. Total rules applied 833 place count 111 transition count 582
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 867 place count 94 transition count 565
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 885 place count 76 transition count 201
Iterating global reduction 5 with 18 rules applied. Total rules applied 903 place count 76 transition count 201
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 913 place count 76 transition count 191
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 918 place count 71 transition count 181
Iterating global reduction 6 with 5 rules applied. Total rules applied 923 place count 71 transition count 181
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 928 place count 66 transition count 176
Iterating global reduction 6 with 5 rules applied. Total rules applied 933 place count 66 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 938 place count 66 transition count 171
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 948 place count 61 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 949 place count 60 transition count 165
Applied a total of 949 rules in 101 ms. Remains 60 /596 variables (removed 536) and now considering 165/1163 (removed 998) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 102 ms. Remains : 60/596 places, 165/1163 transitions.
[2024-05-29 19:11:40] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:11:40] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:11:40] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 574 transition count 1141
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 574 transition count 1141
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 562 transition count 1129
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 562 transition count 1129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 559 transition count 1126
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 559 transition count 1126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 558 transition count 1125
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 558 transition count 1125
Applied a total of 76 rules in 111 ms. Remains 558 /596 variables (removed 38) and now considering 1125/1163 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 558/596 places, 1125/1163 transitions.
[2024-05-29 19:11:40] [INFO ] Flatten gal took : 48 ms
[2024-05-29 19:11:40] [INFO ] Flatten gal took : 51 ms
[2024-05-29 19:11:40] [INFO ] Input system was already deterministic with 1125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 573 transition count 1140
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 573 transition count 1140
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 562 transition count 1129
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 562 transition count 1129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 559 transition count 1126
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 559 transition count 1126
Applied a total of 74 rules in 82 ms. Remains 559 /596 variables (removed 37) and now considering 1126/1163 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 559/596 places, 1126/1163 transitions.
[2024-05-29 19:11:40] [INFO ] Flatten gal took : 44 ms
[2024-05-29 19:11:40] [INFO ] Flatten gal took : 46 ms
[2024-05-29 19:11:40] [INFO ] Input system was already deterministic with 1126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 570 transition count 1137
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 570 transition count 1137
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 556 transition count 1123
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 556 transition count 1123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 552 transition count 1119
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 551 transition count 1118
Applied a total of 90 rules in 56 ms. Remains 551 /596 variables (removed 45) and now considering 1118/1163 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 551/596 places, 1118/1163 transitions.
[2024-05-29 19:11:40] [INFO ] Flatten gal took : 43 ms
[2024-05-29 19:11:41] [INFO ] Flatten gal took : 49 ms
[2024-05-29 19:11:41] [INFO ] Input system was already deterministic with 1118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 555 transition count 1122
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 555 transition count 1122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 551 transition count 1118
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 550 transition count 1117
Applied a total of 92 rules in 53 ms. Remains 550 /596 variables (removed 46) and now considering 1117/1163 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 550/596 places, 1117/1163 transitions.
[2024-05-29 19:11:41] [INFO ] Flatten gal took : 42 ms
[2024-05-29 19:11:41] [INFO ] Flatten gal took : 44 ms
[2024-05-29 19:11:41] [INFO ] Input system was already deterministic with 1117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 48 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-05-29 19:11:41] [INFO ] Flatten gal took : 41 ms
[2024-05-29 19:11:41] [INFO ] Flatten gal took : 43 ms
[2024-05-29 19:11:41] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 48 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-05-29 19:11:41] [INFO ] Flatten gal took : 41 ms
[2024-05-29 19:11:41] [INFO ] Flatten gal took : 41 ms
[2024-05-29 19:11:41] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 570 transition count 1137
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 570 transition count 1137
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 557 transition count 1124
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 557 transition count 1124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 555 transition count 1122
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 555 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 554 transition count 1121
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 554 transition count 1121
Applied a total of 84 rules in 48 ms. Remains 554 /596 variables (removed 42) and now considering 1121/1163 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 554/596 places, 1121/1163 transitions.
[2024-05-29 19:11:41] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:11:41] [INFO ] Flatten gal took : 37 ms
[2024-05-29 19:11:42] [INFO ] Input system was already deterministic with 1121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 46 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 32 ms
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:11:42] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 46 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:11:42] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Graph (trivial) has 600 edges and 596 vertex of which 86 / 596 are part of one of the 15 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 366 transitions
Trivial Post-agglo rules discarded 366 transitions
Performed 366 trivial Post agglomeration. Transition count delta: 366
Iterating post reduction 0 with 366 rules applied. Total rules applied 367 place count 524 transition count 715
Reduce places removed 366 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 376 rules applied. Total rules applied 743 place count 158 transition count 705
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 749 place count 153 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 750 place count 152 transition count 704
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 750 place count 152 transition count 689
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 780 place count 137 transition count 689
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 792 place count 125 transition count 677
Iterating global reduction 4 with 12 rules applied. Total rules applied 804 place count 125 transition count 677
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 804 place count 125 transition count 675
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 808 place count 123 transition count 675
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 811 place count 120 transition count 592
Iterating global reduction 4 with 3 rules applied. Total rules applied 814 place count 120 transition count 592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 815 place count 120 transition count 591
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 816 place count 119 transition count 590
Iterating global reduction 5 with 1 rules applied. Total rules applied 817 place count 119 transition count 590
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 853 place count 101 transition count 572
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 866 place count 88 transition count 354
Iterating global reduction 5 with 13 rules applied. Total rules applied 879 place count 88 transition count 354
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 884 place count 88 transition count 349
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 889 place count 83 transition count 339
Iterating global reduction 6 with 5 rules applied. Total rules applied 894 place count 83 transition count 339
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 899 place count 78 transition count 334
Iterating global reduction 6 with 5 rules applied. Total rules applied 904 place count 78 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 909 place count 78 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 919 place count 73 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 920 place count 72 transition count 323
Applied a total of 920 rules in 83 ms. Remains 72 /596 variables (removed 524) and now considering 323/1163 (removed 840) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 72/596 places, 323/1163 transitions.
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:11:42] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 570 transition count 1137
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 570 transition count 1137
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 557 transition count 1124
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 557 transition count 1124
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 553 transition count 1120
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 553 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 552 transition count 1119
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 552 transition count 1119
Applied a total of 88 rules in 45 ms. Remains 552 /596 variables (removed 44) and now considering 1119/1163 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 552/596 places, 1119/1163 transitions.
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 32 ms
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 33 ms
[2024-05-29 19:11:42] [INFO ] Input system was already deterministic with 1119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 569 transition count 1136
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 569 transition count 1136
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 68 place count 555 transition count 1122
Iterating global reduction 0 with 14 rules applied. Total rules applied 82 place count 555 transition count 1122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 551 transition count 1118
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 550 transition count 1117
Applied a total of 92 rules in 45 ms. Remains 550 /596 variables (removed 46) and now considering 1117/1163 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 550/596 places, 1117/1163 transitions.
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 31 ms
[2024-05-29 19:11:42] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:11:43] [INFO ] Input system was already deterministic with 1117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1163/1163 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 568 transition count 1135
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 568 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 554 transition count 1121
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 554 transition count 1121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 550 transition count 1117
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 549 transition count 1116
Applied a total of 94 rules in 72 ms. Remains 549 /596 variables (removed 47) and now considering 1116/1163 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 549/596 places, 1116/1163 transitions.
[2024-05-29 19:11:43] [INFO ] Flatten gal took : 32 ms
[2024-05-29 19:11:43] [INFO ] Flatten gal took : 33 ms
[2024-05-29 19:11:43] [INFO ] Input system was already deterministic with 1116 transitions.
[2024-05-29 19:11:43] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:11:43] [INFO ] Flatten gal took : 36 ms
[2024-05-29 19:11:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-29 19:11:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 596 places, 1163 transitions and 6535 arcs took 8 ms.
Total runtime 135986 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-05b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 596
TRANSITIONS: 1163
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.011s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 809
MODEL NAME: /home/mcc/execution/411/model
596 places, 1163 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.
Building monolithic NSF...
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-05b-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-05b-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-05b-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA StigmergyElection-PT-05b-CTLFireability-2023-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717011800595

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="StigmergyElection-PT-05b"
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 StigmergyElection-PT-05b, 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 r399-tall-171690530100306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05b.tgz
mv StigmergyElection-PT-05b 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 ;