MCC'2024- Execution of r496-tall-171640602600091

About the Execution of LTSMin+red for FlexibleBarrier-PT-14b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1563.331	3600000.00	12014046.00	2147.40	F?FTFFFFFTT?TFF?	normal

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.r496-tall-171640602600091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FlexibleBarrier-PT-14b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602600091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 726K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-14b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717182821073

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:13:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:13:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:13:42] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-31 19:13:42] [INFO ] Transformed 2678 places.
[2024-05-31 19:13:42] [INFO ] Transformed 3085 transitions.
[2024-05-31 19:13:42] [INFO ] Found NUPN structural information;
[2024-05-31 19:13:42] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Discarding 1077 places :
Symmetric choice reduction at 0 with 1077 rule applications. Total rules 1077 place count 1601 transition count 2008
Iterating global reduction 0 with 1077 rules applied. Total rules applied 2154 place count 1601 transition count 2008
Discarding 502 places :
Symmetric choice reduction at 0 with 502 rule applications. Total rules 2656 place count 1099 transition count 1506
Iterating global reduction 0 with 502 rules applied. Total rules applied 3158 place count 1099 transition count 1506
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 3476 place count 781 transition count 1188
Iterating global reduction 0 with 318 rules applied. Total rules applied 3794 place count 781 transition count 1188
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 0 with 152 rules applied. Total rules applied 3946 place count 781 transition count 1036
Applied a total of 3946 rules in 488 ms. Remains 781 /2678 variables (removed 1897) and now considering 1036/3085 (removed 2049) transitions.
// Phase 1: matrix 1036 rows 781 cols
[2024-05-31 19:13:43] [INFO ] Computed 16 invariants in 47 ms
[2024-05-31 19:13:44] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-05-31 19:13:44] [INFO ] Invariant cache hit.
[2024-05-31 19:13:45] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1690 ms to find 0 implicit places.
Running 1035 sub problems to find dead transitions.
[2024-05-31 19:13:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
[2024-05-31 19:14:08] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 44 ms to minimize.
[2024-05-31 19:14:08] [INFO ] Deduced a trap composed of 130 places in 86 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 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.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 1.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 1.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 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 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 1.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 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.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 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.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 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 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 1.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)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/1817 variables, and 18 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/781 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 4 (OVERLAPS) 1036/1817 variables, 781/799 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1817 variables, 1035/1834 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1817/1817 variables, and 1834 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 2/2 constraints]
After SMT, in 61001ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 61023ms
Starting structural reductions in LTL mode, iteration 1 : 781/2678 places, 1036/3085 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63228 ms. Remains : 781/2678 places, 1036/3085 transitions.
Support contains 30 out of 781 places after structural reductions.
[2024-05-31 19:14:46] [INFO ] Flatten gal took : 127 ms
[2024-05-31 19:14:46] [INFO ] Flatten gal took : 61 ms
[2024-05-31 19:14:46] [INFO ] Input system was already deterministic with 1036 transitions.
RANDOM walk for 40000 steps (398 resets) in 1792 ms. (22 steps per ms) remains 11/15 properties
BEST_FIRST walk for 40002 steps (39 resets) in 204 ms. (195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (40 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (39 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (41 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (37 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (37 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
[2024-05-31 19:14:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 511/535 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 246/781 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1036/1817 variables, 781/797 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1817 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1817/1817 variables, and 797 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 511/535 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 19:14:48] [INFO ] Deduced a trap composed of 288 places in 166 ms of which 4 ms to minimize.
[2024-05-31 19:14:49] [INFO ] Deduced a trap composed of 223 places in 177 ms of which 14 ms to minimize.
[2024-05-31 19:14:49] [INFO ] Deduced a trap composed of 253 places in 163 ms of which 3 ms to minimize.
[2024-05-31 19:14:49] [INFO ] Deduced a trap composed of 225 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 246/781 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/781 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1036/1817 variables, 781/801 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1817 variables, 11/812 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1817 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/1817 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1817/1817 variables, and 812 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2541 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints]
After SMT, in 3585ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 9 properties in 3691 ms.
Support contains 8 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 727 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 5 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 709 transition count 880
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 640 transition count 880
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 139 place count 640 transition count 848
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 203 place count 608 transition count 848
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 245 place count 566 transition count 806
Iterating global reduction 2 with 42 rules applied. Total rules applied 287 place count 566 transition count 806
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 289 place count 566 transition count 804
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 298 place count 557 transition count 795
Iterating global reduction 3 with 9 rules applied. Total rules applied 307 place count 557 transition count 795
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 314 place count 557 transition count 788
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 490 place count 469 transition count 700
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 518 place count 469 transition count 672
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 534 place count 453 transition count 656
Iterating global reduction 5 with 16 rules applied. Total rules applied 550 place count 453 transition count 656
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 552 place count 453 transition count 654
Free-agglomeration rule applied 371 times.
Iterating global reduction 6 with 371 rules applied. Total rules applied 923 place count 453 transition count 283
Reduce places removed 371 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 227 edges and 82 vertex of which 62 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 540 rules applied. Total rules applied 1463 place count 62 transition count 115
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 1491 place count 62 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1492 place count 61 transition count 86
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 60 vertex of which 20 / 60 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 1495 place count 50 transition count 85
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1516 place count 49 transition count 65
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 1516 place count 49 transition count 55
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1536 place count 39 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1545 place count 39 transition count 46
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 1563 place count 30 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1564 place count 30 transition count 36
Free-agglomeration rule applied 10 times.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1574 place count 30 transition count 26
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 23 rules applied. Total rules applied 1597 place count 16 transition count 17
Applied a total of 1597 rules in 320 ms. Remains 16 /781 variables (removed 765) and now considering 17/1036 (removed 1019) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 16/781 places, 17/1036 transitions.
RANDOM walk for 356 steps (0 resets) in 6 ms. (50 steps per ms) remains 0/2 properties
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 18 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||(F(p0)&&F(G((X(!p2)||p1))))))))'
Support contains 5 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 762 transition count 1017
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 762 transition count 1017
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 762 transition count 1014
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 748 transition count 1000
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 748 transition count 1000
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 78 place count 748 transition count 991
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 745 transition count 988
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 745 transition count 988
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 745 transition count 986
Applied a total of 86 rules in 85 ms. Remains 745 /781 variables (removed 36) and now considering 986/1036 (removed 50) transitions.
// Phase 1: matrix 986 rows 745 cols
[2024-05-31 19:14:55] [INFO ] Computed 16 invariants in 18 ms
[2024-05-31 19:14:55] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-31 19:14:55] [INFO ] Invariant cache hit.
[2024-05-31 19:14:56] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
Running 985 sub problems to find dead transitions.
[2024-05-31 19:14:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 1 (OVERLAPS) 1/745 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 985 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 745/1731 variables, and 16 constraints, problems are : Problem set: 0 solved, 985 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/745 constraints, PredecessorRefiner: 985/985 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 985 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 1 (OVERLAPS) 1/745 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/745 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 3 (OVERLAPS) 986/1731 variables, 745/761 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1731 variables, 985/1746 constraints. Problems are: Problem set: 0 solved, 985 unsolved
[2024-05-31 19:15:57] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-31 19:15:57] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
SMT process timed out in 60923ms, After SMT, problems are : Problem set: 0 solved, 985 unsolved
Search for dead transitions found 0 dead transitions in 60933ms
Starting structural reductions in LTL mode, iteration 1 : 745/781 places, 986/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61904 ms. Remains : 745/781 places, 986/1036 transitions.
Stuttering acceptance computed with spot in 423 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-00
Stuttering criterion allowed to conclude after 179 steps with 1 reset in 6 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-00 finished in 62402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 732 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 2 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 708 transition count 891
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 637 transition count 891
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 143 place count 637 transition count 859
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 207 place count 605 transition count 859
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 253 place count 559 transition count 813
Iterating global reduction 2 with 46 rules applied. Total rules applied 299 place count 559 transition count 813
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 302 place count 559 transition count 810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 302 place count 559 transition count 809
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 304 place count 558 transition count 809
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 313 place count 549 transition count 800
Iterating global reduction 3 with 9 rules applied. Total rules applied 322 place count 549 transition count 800
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 330 place count 549 transition count 792
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 500 place count 464 transition count 707
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 503 place count 461 transition count 704
Iterating global reduction 4 with 3 rules applied. Total rules applied 506 place count 461 transition count 704
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 509 place count 461 transition count 701
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 523 place count 461 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 525 place count 459 transition count 685
Applied a total of 525 rules in 363 ms. Remains 459 /781 variables (removed 322) and now considering 685/1036 (removed 351) transitions.
[2024-05-31 19:15:58] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
// Phase 1: matrix 658 rows 459 cols
[2024-05-31 19:15:58] [INFO ] Computed 16 invariants in 7 ms
[2024-05-31 19:15:58] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-31 19:15:58] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:15:58] [INFO ] Invariant cache hit.
[2024-05-31 19:15:59] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2024-05-31 19:15:59] [INFO ] Redundant transitions in 32 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-31 19:15:59] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:15:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 302 unsolved in 18959 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 302/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 777 constraints, problems are : Problem set: 0 solved, 302 unsolved in 24400 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 43641ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 43644ms
Starting structural reductions in SI_LTL mode, iteration 1 : 459/781 places, 685/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44876 ms. Remains : 459/781 places, 685/1036 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-01
Product exploration explored 100000 steps with 4882 reset in 818 ms.
Product exploration explored 100000 steps with 4881 reset in 734 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2008 resets) in 1599 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (18 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 925353 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 925353 steps, saw 201081 distinct states, run finished after 3004 ms. (steps per millisecond=308 ) properties seen :0
[2024-05-31 19:16:48] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:16:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 230/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/645 variables, 234/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/1006 variables, 159/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/1072 variables, 11/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1072 variables, 22/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1072 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/1116 variables, 44/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 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) 230/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/645 variables, 234/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/1006 variables, 159/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/1072 variables, 11/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1072 variables, 22/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1072 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 44/1116 variables, 44/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 176 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=176 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 685/685 transitions.
Applied a total of 0 rules in 45 ms. Remains 459 /459 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2024-05-31 19:16:49] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:16:49] [INFO ] Invariant cache hit.
[2024-05-31 19:16:49] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-31 19:16:49] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:16:49] [INFO ] Invariant cache hit.
[2024-05-31 19:16:50] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2024-05-31 19:16:50] [INFO ] Redundant transitions in 5 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-31 19:16:50] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:16:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 302 unsolved in 19347 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 302/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 777 constraints, problems are : Problem set: 0 solved, 302 unsolved in 22591 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 42219ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 42222ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43091 ms. Remains : 459/459 places, 685/685 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2008 resets) in 332 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (19 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1007748 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 1
Probabilistic random walk after 1007748 steps, saw 214004 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2024-05-31 19:17:35] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:17:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 230/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/645 variables, 234/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/1006 variables, 159/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/1072 variables, 11/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1072 variables, 22/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1072 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/1116 variables, 44/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 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) 230/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/645 variables, 234/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/1006 variables, 159/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1006 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 66/1072 variables, 11/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1072 variables, 22/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1072 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 44/1116 variables, 44/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 505ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2722 steps, including 108 resets, run visited all 1 properties in 8 ms. (steps per millisecond=340 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4870 reset in 622 ms.
Product exploration explored 100000 steps with 4877 reset in 613 ms.
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 685/685 transitions.
Applied a total of 0 rules in 32 ms. Remains 459 /459 variables (removed 0) and now considering 685/685 (removed 0) transitions.
[2024-05-31 19:17:37] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:17:37] [INFO ] Invariant cache hit.
[2024-05-31 19:17:38] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-31 19:17:38] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:17:38] [INFO ] Invariant cache hit.
[2024-05-31 19:17:38] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-31 19:17:38] [INFO ] Redundant transitions in 4 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-31 19:17:38] [INFO ] Flow matrix only has 658 transitions (discarded 27 similar events)
[2024-05-31 19:17:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/1116 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1117 variables, and 475 constraints, problems are : Problem set: 0 solved, 302 unsolved in 19096 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 14/459 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 657/1116 variables, 459/475 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1116 variables, 302/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/1116 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1116/1117 variables, and 777 constraints, problems are : Problem set: 0 solved, 302 unsolved in 24630 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 459/459 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 43954ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 43958ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44633 ms. Remains : 459/459 places, 685/685 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-01 finished in 144671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 3 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 761 transition count 1016
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 761 transition count 1016
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 761 transition count 1014
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 745 transition count 998
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 745 transition count 998
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 85 place count 745 transition count 987
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 743 transition count 985
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 743 transition count 985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 743 transition count 984
Applied a total of 90 rules in 57 ms. Remains 743 /781 variables (removed 38) and now considering 984/1036 (removed 52) transitions.
// Phase 1: matrix 984 rows 743 cols
[2024-05-31 19:18:22] [INFO ] Computed 16 invariants in 15 ms
[2024-05-31 19:18:22] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-31 19:18:22] [INFO ] Invariant cache hit.
[2024-05-31 19:18:23] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Running 983 sub problems to find dead transitions.
[2024-05-31 19:18:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/1727 variables, and 16 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/743 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 983 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 3 (OVERLAPS) 984/1727 variables, 743/759 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1727 variables, 983/1742 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1727/1727 variables, and 1742 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
After SMT, in 60845ms problems are : Problem set: 0 solved, 983 unsolved
Search for dead transitions found 0 dead transitions in 60855ms
Starting structural reductions in LTL mode, iteration 1 : 743/781 places, 984/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61736 ms. Remains : 743/781 places, 984/1036 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-05 finished in 62000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 733 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 708 transition count 892
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 638 transition count 892
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 141 place count 638 transition count 858
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 209 place count 604 transition count 858
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 257 place count 556 transition count 810
Iterating global reduction 2 with 48 rules applied. Total rules applied 305 place count 556 transition count 810
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 556 transition count 807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 308 place count 556 transition count 806
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 310 place count 555 transition count 806
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 321 place count 544 transition count 795
Iterating global reduction 3 with 11 rules applied. Total rules applied 332 place count 544 transition count 795
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 343 place count 544 transition count 784
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 513 place count 459 transition count 699
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 516 place count 456 transition count 696
Iterating global reduction 4 with 3 rules applied. Total rules applied 519 place count 456 transition count 696
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 522 place count 456 transition count 693
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 535 place count 456 transition count 680
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 537 place count 454 transition count 678
Applied a total of 537 rules in 164 ms. Remains 454 /781 variables (removed 327) and now considering 678/1036 (removed 358) transitions.
[2024-05-31 19:19:24] [INFO ] Flow matrix only has 651 transitions (discarded 27 similar events)
// Phase 1: matrix 651 rows 454 cols
[2024-05-31 19:19:24] [INFO ] Computed 16 invariants in 14 ms
[2024-05-31 19:19:24] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-31 19:19:24] [INFO ] Flow matrix only has 651 transitions (discarded 27 similar events)
[2024-05-31 19:19:24] [INFO ] Invariant cache hit.
[2024-05-31 19:19:25] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-31 19:19:25] [INFO ] Redundant transitions in 7 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-31 19:19:25] [INFO ] Flow matrix only has 651 transitions (discarded 27 similar events)
[2024-05-31 19:19:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 650/1104 variables, 454/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1104 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 0/1104 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1105 variables, and 470 constraints, problems are : Problem set: 0 solved, 297 unsolved in 18909 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 650/1104 variables, 454/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1104 variables, 297/767 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1104 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 0/1104 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1105 variables, and 767 constraints, problems are : Problem set: 0 solved, 297 unsolved in 22745 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
After SMT, in 41881ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 41886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 454/781 places, 678/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42731 ms. Remains : 454/781 places, 678/1036 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-07
Stuttering criterion allowed to conclude after 3068 steps with 152 reset in 34 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-07 finished in 42881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 758 transition count 1013
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 758 transition count 1013
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 758 transition count 1010
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 67 place count 740 transition count 992
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 740 transition count 992
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 97 place count 740 transition count 980
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 737 transition count 977
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 737 transition count 977
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 737 transition count 975
Applied a total of 105 rules in 66 ms. Remains 737 /781 variables (removed 44) and now considering 975/1036 (removed 61) transitions.
// Phase 1: matrix 975 rows 737 cols
[2024-05-31 19:20:07] [INFO ] Computed 16 invariants in 9 ms
[2024-05-31 19:20:08] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-31 19:20:08] [INFO ] Invariant cache hit.
[2024-05-31 19:20:08] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
Running 974 sub problems to find dead transitions.
[2024-05-31 19:20:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 1 (OVERLAPS) 1/737 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 974 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/1712 variables, and 16 constraints, problems are : Problem set: 0 solved, 974 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/737 constraints, PredecessorRefiner: 974/974 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 974 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/736 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 1 (OVERLAPS) 1/737 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/737 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 3 (OVERLAPS) 975/1712 variables, 737/753 constraints. Problems are: Problem set: 0 solved, 974 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1712 variables, 974/1727 constraints. Problems are: Problem set: 0 solved, 974 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1712/1712 variables, and 1727 constraints, problems are : Problem set: 0 solved, 974 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 737/737 constraints, PredecessorRefiner: 974/974 constraints, Known Traps: 0/0 constraints]
After SMT, in 60793ms problems are : Problem set: 0 solved, 974 unsolved
Search for dead transitions found 0 dead transitions in 60802ms
Starting structural reductions in LTL mode, iteration 1 : 737/781 places, 975/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62163 ms. Remains : 737/781 places, 975/1036 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-08
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-08 finished in 62264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 735 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 708 transition count 891
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 637 transition count 891
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 143 place count 637 transition count 857
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 211 place count 603 transition count 857
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 258 place count 556 transition count 810
Iterating global reduction 2 with 47 rules applied. Total rules applied 305 place count 556 transition count 810
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 556 transition count 807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 308 place count 556 transition count 806
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 310 place count 555 transition count 806
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 320 place count 545 transition count 796
Iterating global reduction 3 with 10 rules applied. Total rules applied 330 place count 545 transition count 796
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 340 place count 545 transition count 786
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 510 place count 460 transition count 701
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 512 place count 458 transition count 699
Iterating global reduction 4 with 2 rules applied. Total rules applied 514 place count 458 transition count 699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 516 place count 458 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 530 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 532 place count 456 transition count 681
Applied a total of 532 rules in 164 ms. Remains 456 /781 variables (removed 325) and now considering 681/1036 (removed 355) transitions.
[2024-05-31 19:21:09] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2024-05-31 19:21:09] [INFO ] Computed 16 invariants in 15 ms
[2024-05-31 19:21:10] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-31 19:21:10] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:21:10] [INFO ] Invariant cache hit.
[2024-05-31 19:21:10] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-31 19:21:10] [INFO ] Redundant transitions in 4 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-31 19:21:10] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:21:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18844 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23375 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42447ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42451ms
Starting structural reductions in SI_LTL mode, iteration 1 : 456/781 places, 681/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43260 ms. Remains : 456/781 places, 681/1036 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-11
Product exploration explored 100000 steps with 4878 reset in 652 ms.
Product exploration explored 100000 steps with 4881 reset in 672 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2009 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 992437 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :0 out of 1
Probabilistic random walk after 992437 steps, saw 214399 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
[2024-05-31 19:21:57] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:21:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/558 variables, 193/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/979 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 78/1057 variables, 13/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 26/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 52/1109 variables, 52/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/558 variables, 193/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 421/979 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/1057 variables, 13/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 26/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1057 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 52/1109 variables, 52/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 516ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 27 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-31 19:21:58] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:21:58] [INFO ] Invariant cache hit.
[2024-05-31 19:21:58] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-31 19:21:58] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:21:58] [INFO ] Invariant cache hit.
[2024-05-31 19:21:59] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2024-05-31 19:21:59] [INFO ] Redundant transitions in 4 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-31 19:21:59] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:21:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18925 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23410 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42597ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42600ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43331 ms. Remains : 456/456 places, 681/681 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 32353 steps (1621 resets) in 244 ms. (132 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4894 reset in 645 ms.
Product exploration explored 100000 steps with 4901 reset in 662 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 25 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-31 19:22:43] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:22:43] [INFO ] Invariant cache hit.
[2024-05-31 19:22:43] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-31 19:22:43] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:22:43] [INFO ] Invariant cache hit.
[2024-05-31 19:22:44] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2024-05-31 19:22:44] [INFO ] Redundant transitions in 4 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-31 19:22:44] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:22:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18712 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23801 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42758ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42762ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43392 ms. Remains : 456/456 places, 681/681 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-11 finished in 137345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 733 edges and 781 vertex of which 85 / 781 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 709 transition count 894
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 639 transition count 894
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 141 place count 639 transition count 860
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 209 place count 605 transition count 860
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 257 place count 557 transition count 812
Iterating global reduction 2 with 48 rules applied. Total rules applied 305 place count 557 transition count 812
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 308 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 308 place count 557 transition count 808
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 310 place count 556 transition count 808
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 321 place count 545 transition count 797
Iterating global reduction 3 with 11 rules applied. Total rules applied 332 place count 545 transition count 797
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 343 place count 545 transition count 786
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 513 place count 460 transition count 701
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 516 place count 457 transition count 698
Iterating global reduction 4 with 3 rules applied. Total rules applied 519 place count 457 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 522 place count 457 transition count 695
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 536 place count 457 transition count 681
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 538 place count 455 transition count 679
Applied a total of 538 rules in 146 ms. Remains 455 /781 variables (removed 326) and now considering 679/1036 (removed 357) transitions.
[2024-05-31 19:23:27] [INFO ] Flow matrix only has 652 transitions (discarded 27 similar events)
// Phase 1: matrix 652 rows 455 cols
[2024-05-31 19:23:27] [INFO ] Computed 16 invariants in 14 ms
[2024-05-31 19:23:27] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-31 19:23:27] [INFO ] Flow matrix only has 652 transitions (discarded 27 similar events)
[2024-05-31 19:23:27] [INFO ] Invariant cache hit.
[2024-05-31 19:23:27] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2024-05-31 19:23:27] [INFO ] Redundant transitions in 3 ms returned []
Running 298 sub problems to find dead transitions.
[2024-05-31 19:23:27] [INFO ] Flow matrix only has 652 transitions (discarded 27 similar events)
[2024-05-31 19:23:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 14/455 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 651/1106 variables, 455/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1106 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 0/1106 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1106/1107 variables, and 471 constraints, problems are : Problem set: 0 solved, 298 unsolved in 18649 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 14/455 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 651/1106 variables, 455/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1106 variables, 298/769 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1106 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 0/1106 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1106/1107 variables, and 769 constraints, problems are : Problem set: 0 solved, 298 unsolved in 23363 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
After SMT, in 42253ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 42256ms
Starting structural reductions in SI_LTL mode, iteration 1 : 455/781 places, 679/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43048 ms. Remains : 455/781 places, 679/1036 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-14
Stuttering criterion allowed to conclude after 455 steps with 22 reset in 5 ms.
FORMULA FlexibleBarrier-PT-14b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-14 finished in 43123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((X(p2)&&p1))))))'
Support contains 8 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 765 transition count 1020
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 765 transition count 1020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 765 transition count 1019
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 752 transition count 1006
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 752 transition count 1006
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 69 place count 752 transition count 996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 751 transition count 995
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 751 transition count 995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 751 transition count 994
Applied a total of 72 rules in 63 ms. Remains 751 /781 variables (removed 30) and now considering 994/1036 (removed 42) transitions.
// Phase 1: matrix 994 rows 751 cols
[2024-05-31 19:24:10] [INFO ] Computed 16 invariants in 14 ms
[2024-05-31 19:24:10] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-31 19:24:10] [INFO ] Invariant cache hit.
[2024-05-31 19:24:11] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Running 993 sub problems to find dead transitions.
[2024-05-31 19:24:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
[2024-05-31 19:24:32] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 4 ms to minimize.
[2024-05-31 19:24:32] [INFO ] Deduced a trap composed of 128 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/1745 variables, and 18 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 993 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/751 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/751 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 4 (OVERLAPS) 994/1745 variables, 751/769 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1745 variables, 993/1762 constraints. Problems are: Problem set: 0 solved, 993 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 1762 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
After SMT, in 60835ms problems are : Problem set: 0 solved, 993 unsolved
Search for dead transitions found 0 dead transitions in 60846ms
Starting structural reductions in LTL mode, iteration 1 : 751/781 places, 994/1036 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61793 ms. Remains : 751/781 places, 994/1036 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-15
Product exploration explored 100000 steps with 999 reset in 239 ms.
Product exploration explored 100000 steps with 995 reset in 219 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 124 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (397 resets) in 814 ms. (49 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (39 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 296 ms. (134 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (40 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (40 resets) in 265 ms. (150 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (40 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (39 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (38 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (39 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (41 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (42 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 194009 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 11
Probabilistic random walk after 194009 steps, saw 77595 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-31 19:25:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf6 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 385/393 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 358/751 variables, 10/16 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 994/1745 variables, 751/767 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1745 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/1745 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 767 constraints, problems are : Problem set: 2 solved, 9 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 385/393 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 358/751 variables, 10/16 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-31 19:25:17] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 4 ms to minimize.
[2024-05-31 19:25:18] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:25:18] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 6 ms to minimize.
[2024-05-31 19:25:18] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-31 19:25:18] [INFO ] Deduced a trap composed of 120 places in 178 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 5/21 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 994/1745 variables, 751/772 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1745 variables, 9/781 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1745 variables, 0/781 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/1745 variables, 0/781 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 781 constraints, problems are : Problem set: 2 solved, 9 unsolved in 2271 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 3098ms problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 5 properties in 1899 ms.
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 994/994 transitions.
Graph (trivial) has 696 edges and 751 vertex of which 85 / 751 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 680 transition count 841
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 613 transition count 841
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 135 place count 613 transition count 811
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 195 place count 583 transition count 811
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 222 place count 556 transition count 784
Iterating global reduction 2 with 27 rules applied. Total rules applied 249 place count 556 transition count 784
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 251 place count 554 transition count 782
Iterating global reduction 2 with 2 rules applied. Total rules applied 253 place count 554 transition count 782
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 427 place count 467 transition count 695
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 455 place count 467 transition count 667
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 469 place count 453 transition count 653
Iterating global reduction 3 with 14 rules applied. Total rules applied 483 place count 453 transition count 653
Free-agglomeration rule applied 369 times.
Iterating global reduction 3 with 369 rules applied. Total rules applied 852 place count 453 transition count 284
Reduce places removed 369 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 225 edges and 84 vertex of which 64 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 538 rules applied. Total rules applied 1390 place count 64 transition count 116
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1418 place count 64 transition count 88
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1419 place count 64 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1420 place count 63 transition count 87
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 50 edges and 62 vertex of which 20 / 62 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
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 5 with 3 rules applied. Total rules applied 1423 place count 52 transition count 86
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1444 place count 51 transition count 66
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1444 place count 51 transition count 57
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1462 place count 42 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1471 place count 42 transition count 48
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1489 place count 33 transition count 39
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 8 with 2 rules applied. Total rules applied 1491 place count 32 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1492 place count 32 transition count 37
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 1501 place count 32 transition count 28
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1525 place count 17 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1526 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1527 place count 16 transition count 18
Applied a total of 1527 rules in 106 ms. Remains 16 /751 variables (removed 735) and now considering 18/994 (removed 976) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 16/751 places, 18/994 transitions.
RANDOM walk for 1302 steps (0 resets) in 6 ms. (186 steps per ms) remains 0/4 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1))), (G (OR p0 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p0 p2 p1))), (F (NOT p0))]
Knowledge based reduction with 25 factoid took 380 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 751/751 places, 994/994 transitions.
Applied a total of 0 rules in 20 ms. Remains 751 /751 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2024-05-31 19:25:22] [INFO ] Invariant cache hit.
[2024-05-31 19:25:22] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-31 19:25:22] [INFO ] Invariant cache hit.
[2024-05-31 19:25:23] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Running 993 sub problems to find dead transitions.
[2024-05-31 19:25:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
[2024-05-31 19:25:44] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 4 ms to minimize.
[2024-05-31 19:25:44] [INFO ] Deduced a trap composed of 128 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/1745 variables, and 18 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 993 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/751 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/751 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 4 (OVERLAPS) 994/1745 variables, 751/769 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1745 variables, 993/1762 constraints. Problems are: Problem set: 0 solved, 993 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 1762 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
After SMT, in 60819ms problems are : Problem set: 0 solved, 993 unsolved
Search for dead transitions found 0 dead transitions in 60829ms
Finished structural reductions in LTL mode , in 1 iterations and 61685 ms. Remains : 751/751 places, 994/994 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 191 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (393 resets) in 970 ms. (41 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (38 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (40 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (38 resets) in 27 ms. (1428 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (41 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (40 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
[2024-05-31 19:26:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 385/393 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 358/751 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 994/1745 variables, 751/767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1745 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1745 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1745/1745 variables, and 767 constraints, problems are : Problem set: 0 solved, 5 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 385/393 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 358/751 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:26:26] [INFO ] Deduced a trap composed of 241 places in 179 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 994/1745 variables, 751/768 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1745 variables, 5/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:26:26] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1745 variables, 1/774 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1745 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1745 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 774 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1348 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 1979ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 3 properties in 788 ms.
Support contains 6 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 994/994 transitions.
Graph (trivial) has 700 edges and 751 vertex of which 85 / 751 are part of one of the 14 SCC in 7 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 680 transition count 839
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 611 transition count 839
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 139 place count 611 transition count 808
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 201 place count 580 transition count 808
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 230 place count 551 transition count 779
Iterating global reduction 2 with 29 rules applied. Total rules applied 259 place count 551 transition count 779
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 549 transition count 777
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 549 transition count 777
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 549 transition count 776
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 438 place count 462 transition count 689
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 466 place count 462 transition count 661
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 480 place count 448 transition count 647
Iterating global reduction 4 with 14 rules applied. Total rules applied 494 place count 448 transition count 647
Free-agglomeration rule applied 368 times.
Iterating global reduction 4 with 368 rules applied. Total rules applied 862 place count 448 transition count 279
Reduce places removed 368 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Graph (complete) has 218 edges and 80 vertex of which 55 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 537 rules applied. Total rules applied 1399 place count 55 transition count 111
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 1434 place count 55 transition count 76
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1435 place count 55 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1436 place count 54 transition count 75
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 45 edges and 53 vertex of which 18 / 53 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
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 6 with 3 rules applied. Total rules applied 1439 place count 44 transition count 74
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1458 place count 43 transition count 56
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 1458 place count 43 transition count 48
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1474 place count 35 transition count 48
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1482 place count 35 transition count 40
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 1498 place count 27 transition count 32
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 9 with 2 rules applied. Total rules applied 1500 place count 26 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1501 place count 26 transition count 30
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1509 place count 26 transition count 22
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1530 place count 13 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1531 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1532 place count 12 transition count 13
Applied a total of 1532 rules in 125 ms. Remains 12 /751 variables (removed 739) and now considering 13/994 (removed 981) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 12/751 places, 13/994 transitions.
RANDOM walk for 381 steps (0 resets) in 5 ms. (63 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 p2))), (F p1)]
Knowledge based reduction with 13 factoid took 524 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 994 reset in 192 ms.
Product exploration explored 100000 steps with 996 reset in 226 ms.
Support contains 8 out of 751 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 751/751 places, 994/994 transitions.
Applied a total of 0 rules in 20 ms. Remains 751 /751 variables (removed 0) and now considering 994/994 (removed 0) transitions.
[2024-05-31 19:26:29] [INFO ] Invariant cache hit.
[2024-05-31 19:26:29] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-31 19:26:29] [INFO ] Invariant cache hit.
[2024-05-31 19:26:30] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Running 993 sub problems to find dead transitions.
[2024-05-31 19:26:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
[2024-05-31 19:26:52] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 4 ms to minimize.
[2024-05-31 19:26:52] [INFO ] Deduced a trap composed of 128 places in 88 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/1745 variables, and 18 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 993 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 1 (OVERLAPS) 1/751 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/751 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/751 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 4 (OVERLAPS) 994/1745 variables, 751/769 constraints. Problems are: Problem set: 0 solved, 993 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1745 variables, 993/1762 constraints. Problems are: Problem set: 0 solved, 993 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1745 variables, and 1762 constraints, problems are : Problem set: 0 solved, 993 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 751/751 constraints, PredecessorRefiner: 993/993 constraints, Known Traps: 2/2 constraints]
After SMT, in 60786ms problems are : Problem set: 0 solved, 993 unsolved
Search for dead transitions found 0 dead transitions in 60798ms
Finished structural reductions in LTL mode , in 1 iterations and 61640 ms. Remains : 751/751 places, 994/994 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-15 finished in 201028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((X(p2)&&p1))))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-14b-LTLCardinality-15
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 8 out of 781 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 781/781 places, 1036/1036 transitions.
Graph (trivial) has 726 edges and 781 vertex of which 86 / 781 are part of one of the 14 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 708 transition count 895
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 641 transition count 895
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 135 place count 641 transition count 862
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 201 place count 608 transition count 862
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 243 place count 566 transition count 820
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 566 transition count 820
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 566 transition count 819
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 297 place count 555 transition count 808
Iterating global reduction 3 with 11 rules applied. Total rules applied 308 place count 555 transition count 808
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 317 place count 555 transition count 799
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 487 place count 470 transition count 714
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 489 place count 468 transition count 712
Iterating global reduction 4 with 2 rules applied. Total rules applied 491 place count 468 transition count 712
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 493 place count 468 transition count 710
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 507 place count 468 transition count 696
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 508 place count 468 transition count 696
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 510 place count 466 transition count 694
Applied a total of 510 rules in 108 ms. Remains 466 /781 variables (removed 315) and now considering 694/1036 (removed 342) transitions.
[2024-05-31 19:27:31] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
// Phase 1: matrix 667 rows 466 cols
[2024-05-31 19:27:31] [INFO ] Computed 16 invariants in 7 ms
[2024-05-31 19:27:31] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-31 19:27:31] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:27:31] [INFO ] Invariant cache hit.
[2024-05-31 19:27:32] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-31 19:27:32] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:27:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 0 solved, 323 unsolved in 20994 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 323/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 805 constraints, problems are : Problem set: 0 solved, 323 unsolved in 25551 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
After SMT, in 46864ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 46872ms
Starting structural reductions in LI_LTL mode, iteration 1 : 466/781 places, 694/1036 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 47594 ms. Remains : 466/781 places, 694/1036 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLCardinality-15
Product exploration explored 100000 steps with 4437 reset in 585 ms.
Product exploration explored 100000 steps with 4453 reset in 605 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 118 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1826 resets) in 931 ms. (42 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 25 ms. (1538 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 46 ms. (851 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 39 ms. (1000 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (19 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 24 ms. (1600 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 242243 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :2 out of 11
Probabilistic random walk after 242243 steps, saw 79987 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :2
[2024-05-31 19:28:24] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:28:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf6 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 274/282 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 465/747 variables, 282/288 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 295/1042 variables, 130/418 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 1/419 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 0/419 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 54/1096 variables, 9/428 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1096 variables, 18/446 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1096 variables, 0/446 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 36/1132 variables, 36/482 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 2 solved, 7 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 274/282 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 465/747 variables, 282/288 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 1/289 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 0/289 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 295/1042 variables, 130/419 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 1/420 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1042 variables, 6/426 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 0/426 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 54/1096 variables, 9/435 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1096 variables, 18/453 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1096 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 36/1132 variables, 36/489 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1132 variables, 0/489 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1132 variables, 0/489 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 489 constraints, problems are : Problem set: 2 solved, 7 unsolved in 826 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1458ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 126 steps, including 3 resets, run visited all 3 properties in 2 ms. (steps per millisecond=63 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 92 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1))), (G (OR p0 (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 25 factoid took 450 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 8 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 694/694 transitions.
Applied a total of 0 rules in 10 ms. Remains 466 /466 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2024-05-31 19:28:26] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:28:26] [INFO ] Invariant cache hit.
[2024-05-31 19:28:26] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-31 19:28:26] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:28:26] [INFO ] Invariant cache hit.
[2024-05-31 19:28:27] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-31 19:28:27] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:28:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 0 solved, 323 unsolved in 20253 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 323/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 805 constraints, problems are : Problem set: 0 solved, 323 unsolved in 26217 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
After SMT, in 46708ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 46711ms
Finished structural reductions in LTL mode , in 1 iterations and 47352 ms. Remains : 466/466 places, 694/694 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 136 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (1831 resets) in 1303 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (18 resets) in 30 ms. (1290 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 26 ms. (1481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 268846 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :2 out of 8
Probabilistic random walk after 268846 steps, saw 89001 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :2
[2024-05-31 19:29:17] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:29:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 274/282 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 465/747 variables, 282/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 295/1042 variables, 130/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 54/1096 variables, 9/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1096 variables, 18/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1096 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 36/1132 variables, 36/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 0 solved, 6 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 274/282 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 465/747 variables, 282/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 295/1042 variables, 130/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1042 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1042 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 54/1096 variables, 9/434 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1096 variables, 18/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1096 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 36/1132 variables, 36/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1132 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1132 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 488 constraints, problems are : Problem set: 0 solved, 6 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1315ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 4064 steps, including 210 resets, run visited all 1 properties in 11 ms. (steps per millisecond=369 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 111 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 p2))), (F p1)]
Knowledge based reduction with 13 factoid took 490 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4447 reset in 578 ms.
Product exploration explored 100000 steps with 4427 reset in 574 ms.
Support contains 8 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 694/694 transitions.
Applied a total of 0 rules in 9 ms. Remains 466 /466 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2024-05-31 19:29:21] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:29:21] [INFO ] Invariant cache hit.
[2024-05-31 19:29:21] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-31 19:29:21] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:29:21] [INFO ] Invariant cache hit.
[2024-05-31 19:29:22] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-31 19:29:22] [INFO ] Flow matrix only has 667 transitions (discarded 27 similar events)
[2024-05-31 19:29:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/1132 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1132/1133 variables, and 482 constraints, problems are : Problem set: 0 solved, 323 unsolved in 20467 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 14/466 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 666/1132 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1132 variables, 323/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/1132 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1132/1133 variables, and 805 constraints, problems are : Problem set: 0 solved, 323 unsolved in 25554 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
After SMT, in 46284ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 46287ms
Finished structural reductions in LTL mode , in 1 iterations and 46892 ms. Remains : 466/466 places, 694/694 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLCardinality-15 finished in 157094 ms.
[2024-05-31 19:30:08] [INFO ] Flatten gal took : 46 ms
[2024-05-31 19:30:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 19:30:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 781 places, 1036 transitions and 3027 arcs took 6 ms.
Total runtime 986376 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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="FlexibleBarrier-PT-14b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-14b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602600091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-14b.tgz
mv FlexibleBarrier-PT-14b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;