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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 1020K Apr 12 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 356K Apr 12 21:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 21:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 377K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 386K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 1010K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 23:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.4M Apr 12 23:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 22:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.1M Apr 12 22:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 172K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 2.4M 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 BART-PT-010-LTLFireability-00
FORMULA_NAME BART-PT-010-LTLFireability-01
FORMULA_NAME BART-PT-010-LTLFireability-02
FORMULA_NAME BART-PT-010-LTLFireability-03
FORMULA_NAME BART-PT-010-LTLFireability-04
FORMULA_NAME BART-PT-010-LTLFireability-05
FORMULA_NAME BART-PT-010-LTLFireability-06
FORMULA_NAME BART-PT-010-LTLFireability-07
FORMULA_NAME BART-PT-010-LTLFireability-08
FORMULA_NAME BART-PT-010-LTLFireability-09
FORMULA_NAME BART-PT-010-LTLFireability-10
FORMULA_NAME BART-PT-010-LTLFireability-11
FORMULA_NAME BART-PT-010-LTLFireability-12
FORMULA_NAME BART-PT-010-LTLFireability-13
FORMULA_NAME BART-PT-010-LTLFireability-14
FORMULA_NAME BART-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716379939237

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 12:12:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 12:12:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:12:21] [INFO ] Load time of PNML (sax parser for PT used): 484 ms
[2024-05-22 12:12:21] [INFO ] Transformed 1530 places.
[2024-05-22 12:12:21] [INFO ] Transformed 2020 transitions.
[2024-05-22 12:12:21] [INFO ] Found NUPN structural information;
[2024-05-22 12:12:21] [INFO ] Parsed PT model containing 1530 places and 2020 transitions and 16200 arcs in 697 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 297 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1320 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 38 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
// Phase 1: matrix 2020 rows 1320 cols
[2024-05-22 12:12:22] [INFO ] Computed 10 invariants in 43 ms
[2024-05-22 12:12:23] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-22 12:12:23] [INFO ] Invariant cache hit.
[2024-05-22 12:12:25] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 2596 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-22 12:12:25] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30123 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "ParserException while parsing response: ((s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30039 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 61114ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 61203ms
Finished structural reductions in LTL mode , in 1 iterations and 63881 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Support contains 1320 out of 1320 places after structural reductions.
[2024-05-22 12:13:27] [INFO ] Flatten gal took : 238 ms
[2024-05-22 12:13:27] [INFO ] Flatten gal took : 184 ms
[2024-05-22 12:13:27] [INFO ] Input system was already deterministic with 2020 transitions.
Reduction of identical properties reduced properties to check from 17 to 15
RANDOM walk for 16920 steps (3 resets) in 676 ms. (24 steps per ms) remains 0/15 properties
FORMULA BART-PT-010-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-PT-010-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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(F((p0&&F(p1)))))'
Support contains 100 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 230 places :
Symmetric choice reduction at 0 with 230 rule applications. Total rules 230 place count 1090 transition count 1790
Iterating global reduction 0 with 230 rules applied. Total rules applied 460 place count 1090 transition count 1790
Discarding 190 places :
Symmetric choice reduction at 0 with 190 rule applications. Total rules 650 place count 900 transition count 1600
Iterating global reduction 0 with 190 rules applied. Total rules applied 840 place count 900 transition count 1600
Applied a total of 840 rules in 245 ms. Remains 900 /1320 variables (removed 420) and now considering 1600/2020 (removed 420) transitions.
// Phase 1: matrix 1600 rows 900 cols
[2024-05-22 12:13:28] [INFO ] Computed 10 invariants in 10 ms
[2024-05-22 12:13:29] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-22 12:13:29] [INFO ] Invariant cache hit.
[2024-05-22 12:13:29] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
Running 1240 sub problems to find dead transitions.
[2024-05-22 12:13:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/890 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
SMT process timed out in 30540ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 30557ms
Starting structural reductions in LTL mode, iteration 1 : 900/1320 places, 1600/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31696 ms. Remains : 900/1320 places, 1600/2020 transitions.
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-01
Product exploration explored 100000 steps with 1657 reset in 1409 ms.
Product exploration explored 100000 steps with 1650 reset in 922 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 : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 231 steps (0 resets) in 27 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 367 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 434 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-22 12:14:05] [INFO ] Invariant cache hit.
[2024-05-22 12:14:07] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2024-05-22 12:14:09] [INFO ] [Real]Absence check using state equation in 1568 ms returned sat
[2024-05-22 12:14:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 12:14:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2024-05-22 12:14:13] [INFO ] [Nat]Absence check using state equation in 1431 ms returned sat
[2024-05-22 12:14:13] [INFO ] Computed and/alt/rep : 1240/2280/1240 causal constraints (skipped 0 transitions) in 205 ms.
Could not prove EG (NOT p0)
Support contains 100 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 900 transition count 1490
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 220 place count 790 transition count 1490
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 220 place count 790 transition count 1440
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 320 place count 740 transition count 1440
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 720 place count 540 transition count 1240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 730 place count 540 transition count 1230
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 750 place count 530 transition count 1220
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 760 place count 530 transition count 1210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 780 place count 520 transition count 1200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 790 place count 520 transition count 1190
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 810 place count 510 transition count 1180
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 820 place count 510 transition count 1170
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 840 place count 500 transition count 1160
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 860 place count 500 transition count 1140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 880 place count 490 transition count 1130
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 900 place count 490 transition count 1110
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 920 place count 480 transition count 1100
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 940 place count 480 transition count 1080
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 960 place count 470 transition count 1070
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 980 place count 470 transition count 1050
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 1000 place count 460 transition count 1040
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 1020 place count 460 transition count 1020
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 1040 place count 450 transition count 1010
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1060 place count 450 transition count 990
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1080 place count 440 transition count 980
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 1100 place count 440 transition count 960
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 20 rules applied. Total rules applied 1120 place count 430 transition count 950
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 1140 place count 430 transition count 930
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 1160 place count 420 transition count 920
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 14 with 20 rules applied. Total rules applied 1180 place count 420 transition count 900
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 15 with 20 rules applied. Total rules applied 1200 place count 410 transition count 890
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 15 with 20 rules applied. Total rules applied 1220 place count 410 transition count 870
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 1240 place count 400 transition count 860
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 16 with 20 rules applied. Total rules applied 1260 place count 400 transition count 840
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 17 with 20 rules applied. Total rules applied 1280 place count 390 transition count 830
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 17 with 20 rules applied. Total rules applied 1300 place count 390 transition count 810
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 18 with 20 rules applied. Total rules applied 1320 place count 380 transition count 800
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 18 with 20 rules applied. Total rules applied 1340 place count 380 transition count 780
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 19 with 20 rules applied. Total rules applied 1360 place count 370 transition count 770
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 19 with 20 rules applied. Total rules applied 1380 place count 370 transition count 750
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 20 with 20 rules applied. Total rules applied 1400 place count 360 transition count 740
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 20 with 20 rules applied. Total rules applied 1420 place count 360 transition count 720
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 21 with 20 rules applied. Total rules applied 1440 place count 350 transition count 710
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 21 with 20 rules applied. Total rules applied 1460 place count 350 transition count 690
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 22 with 20 rules applied. Total rules applied 1480 place count 340 transition count 680
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 22 with 20 rules applied. Total rules applied 1500 place count 340 transition count 660
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 23 with 20 rules applied. Total rules applied 1520 place count 330 transition count 650
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 23 with 20 rules applied. Total rules applied 1540 place count 330 transition count 630
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 24 with 20 rules applied. Total rules applied 1560 place count 320 transition count 620
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 24 with 20 rules applied. Total rules applied 1580 place count 320 transition count 600
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 25 with 20 rules applied. Total rules applied 1600 place count 310 transition count 590
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 25 with 10 rules applied. Total rules applied 1610 place count 310 transition count 580
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 26 with 20 rules applied. Total rules applied 1630 place count 300 transition count 570
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 26 with 10 rules applied. Total rules applied 1640 place count 300 transition count 560
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 27 with 20 rules applied. Total rules applied 1660 place count 290 transition count 550
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 10 rules applied. Total rules applied 1670 place count 290 transition count 540
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 28 with 20 rules applied. Total rules applied 1690 place count 280 transition count 530
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 28 with 20 rules applied. Total rules applied 1710 place count 280 transition count 510
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 29 with 20 rules applied. Total rules applied 1730 place count 270 transition count 500
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 29 with 20 rules applied. Total rules applied 1750 place count 270 transition count 480
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 30 with 20 rules applied. Total rules applied 1770 place count 260 transition count 470
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 30 with 20 rules applied. Total rules applied 1790 place count 260 transition count 450
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 31 with 20 rules applied. Total rules applied 1810 place count 250 transition count 440
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 31 with 20 rules applied. Total rules applied 1830 place count 250 transition count 420
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 32 with 20 rules applied. Total rules applied 1850 place count 240 transition count 410
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 32 with 10 rules applied. Total rules applied 1860 place count 240 transition count 400
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 33 with 20 rules applied. Total rules applied 1880 place count 230 transition count 390
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 33 with 10 rules applied. Total rules applied 1890 place count 230 transition count 380
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 34 with 20 rules applied. Total rules applied 1910 place count 220 transition count 370
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 34 with 20 rules applied. Total rules applied 1930 place count 220 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 35 with 20 rules applied. Total rules applied 1950 place count 210 transition count 340
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 35 with 20 rules applied. Total rules applied 1970 place count 210 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 36 with 10 rules applied. Total rules applied 1980 place count 210 transition count 310
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 36 with 10 rules applied. Total rules applied 1990 place count 210 transition count 310
Discarding 10 places :
Symmetric choice reduction at 36 with 10 rule applications. Total rules 2000 place count 200 transition count 300
Iterating global reduction 36 with 10 rules applied. Total rules applied 2010 place count 200 transition count 300
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 36 with 10 rules applied. Total rules applied 2020 place count 200 transition count 290
Applied a total of 2020 rules in 880 ms. Remains 200 /900 variables (removed 700) and now considering 290/1600 (removed 1310) transitions.
// Phase 1: matrix 290 rows 200 cols
[2024-05-22 12:14:25] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 12:14:25] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 12:14:25] [INFO ] Invariant cache hit.
[2024-05-22 12:14:25] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-22 12:14:25] [INFO ] Redundant transitions in 16 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-22 12:14:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 10/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 290/490 variables, 200/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/490 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 210 constraints, problems are : Problem set: 0 solved, 190 unsolved in 9680 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 10/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 290/490 variables, 200/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 190/400 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 400 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7614 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 17322ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 17325ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/900 places, 290/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18476 ms. Remains : 200/900 places, 290/1600 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 : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 212 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 76 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 356 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-22 12:14:44] [INFO ] Invariant cache hit.
[2024-05-22 12:14:44] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-22 12:14:45] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-05-22 12:14:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 12:14:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-22 12:14:46] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-05-22 12:14:46] [INFO ] Computed and/alt/rep : 190/280/190 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-22 12:14:46] [INFO ] Added : 23 causal constraints over 6 iterations in 209 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8386 reset in 1228 ms.
Stack based approach found an accepted trace after 672 steps with 51 reset with depth 11 and stack size 11 in 8 ms.
FORMULA BART-PT-010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-010-LTLFireability-01 finished in 79591 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 90 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1780 edges and 1320 vertex of which 410 / 1320 are part of one of the 10 SCC in 5 ms
Free SCC test removed 400 places
Ensure Unique test removed 750 transitions
Reduce isomorphic transitions removed 750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 561 place count 920 transition count 710
Reduce places removed 560 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 680 rules applied. Total rules applied 1241 place count 360 transition count 590
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 2 with 120 rules applied. Total rules applied 1361 place count 320 transition count 510
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 120 rules applied. Total rules applied 1481 place count 280 transition count 430
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 1561 place count 240 transition count 390
Discarding 50 places :
Symmetric choice reduction at 5 with 50 rule applications. Total rules 1611 place count 190 transition count 340
Iterating global reduction 5 with 50 rules applied. Total rules applied 1661 place count 190 transition count 340
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 1711 place count 190 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 1721 place count 190 transition count 280
Applied a total of 1721 rules in 42 ms. Remains 190 /1320 variables (removed 1130) and now considering 280/2020 (removed 1740) transitions.
[2024-05-22 12:14:48] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
// Phase 1: matrix 271 rows 190 cols
[2024-05-22 12:14:48] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 12:14:48] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 12:14:48] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
[2024-05-22 12:14:48] [INFO ] Invariant cache hit.
[2024-05-22 12:14:48] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-22 12:14:48] [INFO ] Redundant transitions in 4 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-22 12:14:48] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
[2024-05-22 12:14:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 10/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 270/460 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 0/460 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/461 variables, and 200 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7804 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 10/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 270/460 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 180/380 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/461 variables, and 380 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7077 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
After SMT, in 14930ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 14932ms
Starting structural reductions in SI_LTL mode, iteration 1 : 190/1320 places, 280/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15229 ms. Remains : 190/1320 places, 280/2020 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-03 finished in 15359 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(G((F(G(p0)) U (p0 U p1)))))'
Support contains 890 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 1230 transition count 1930
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 1230 transition count 1930
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 240 place count 1170 transition count 1870
Iterating global reduction 0 with 60 rules applied. Total rules applied 300 place count 1170 transition count 1870
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 330 place count 1140 transition count 1840
Iterating global reduction 0 with 30 rules applied. Total rules applied 360 place count 1140 transition count 1840
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 390 place count 1110 transition count 1810
Iterating global reduction 0 with 30 rules applied. Total rules applied 420 place count 1110 transition count 1810
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 450 place count 1080 transition count 1780
Iterating global reduction 0 with 30 rules applied. Total rules applied 480 place count 1080 transition count 1780
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 510 place count 1050 transition count 1750
Iterating global reduction 0 with 30 rules applied. Total rules applied 540 place count 1050 transition count 1750
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 560 place count 1030 transition count 1730
Iterating global reduction 0 with 20 rules applied. Total rules applied 580 place count 1030 transition count 1730
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 600 place count 1010 transition count 1710
Iterating global reduction 0 with 20 rules applied. Total rules applied 620 place count 1010 transition count 1710
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 630 place count 1000 transition count 1700
Iterating global reduction 0 with 10 rules applied. Total rules applied 640 place count 1000 transition count 1700
Applied a total of 640 rules in 94 ms. Remains 1000 /1320 variables (removed 320) and now considering 1700/2020 (removed 320) transitions.
// Phase 1: matrix 1700 rows 1000 cols
[2024-05-22 12:15:03] [INFO ] Computed 10 invariants in 15 ms
[2024-05-22 12:15:03] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-22 12:15:03] [INFO ] Invariant cache hit.
[2024-05-22 12:15:04] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
Running 1340 sub problems to find dead transitions.
[2024-05-22 12:15:04] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1340/1340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1340 unsolved
Error getting values : (error "ParserException while parsing response: ((s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1340 constraints, Known Traps: 0/0 constraints]
After SMT, in 60608ms problems are : Problem set: 0 solved, 1340 unsolved
Search for dead transitions found 0 dead transitions in 60624ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1320 places, 1700/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62008 ms. Remains : 1000/1320 places, 1700/2020 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-04
Product exploration explored 100000 steps with 4 reset in 3399 ms.
Product exploration explored 100000 steps with 24 reset in 3153 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 : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 382 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 196 steps (0 resets) in 10 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 482 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-22 12:16:14] [INFO ] Invariant cache hit.
[2024-05-22 12:16:15] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-22 12:16:16] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2024-05-22 12:16:16] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 169 ms.
[2024-05-22 12:16:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 12:16:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-22 12:16:19] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2024-05-22 12:16:19] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 171 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 12:16:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2024-05-22 12:16:32] [INFO ] Invariant cache hit.
[2024-05-22 12:16:32] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-22 12:16:32] [INFO ] Invariant cache hit.
[2024-05-22 12:16:33] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
Running 1340 sub problems to find dead transitions.
[2024-05-22 12:16:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1340/1340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1340 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1340 constraints, Known Traps: 0/0 constraints]
After SMT, in 60505ms problems are : Problem set: 0 solved, 1340 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Finished structural reductions in LTL mode , in 1 iterations and 62020 ms. Remains : 1000/1000 places, 1700/1700 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 : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 406 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 243 steps (0 resets) in 9 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 453 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-22 12:17:36] [INFO ] Invariant cache hit.
[2024-05-22 12:17:37] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-05-22 12:17:37] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2024-05-22 12:17:38] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 125 ms.
[2024-05-22 12:17:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 12:17:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2024-05-22 12:17:40] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2024-05-22 12:17:40] [INFO ] Computed and/alt/rep : 1340/2380/1340 causal constraints (skipped 0 transitions) in 180 ms.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 8 reset in 3151 ms.
Product exploration explored 100000 steps with 30 reset in 2900 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 1700
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 10 place count 1000 transition count 1700
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 20 place count 1000 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 990 transition count 1690
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 990 transition count 1690
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 110 place count 990 transition count 1690
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 990 transition count 1680
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 180 place count 930 transition count 1620
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 240 place count 930 transition count 1620
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 240 rules in 97 ms. Remains 930 /1000 variables (removed 70) and now considering 1620/1700 (removed 80) transitions.
[2024-05-22 12:18:00] [INFO ] Redundant transitions in 151 ms returned []
Running 1260 sub problems to find dead transitions.
// Phase 1: matrix 1620 rows 930 cols
[2024-05-22 12:18:00] [INFO ] Computed 10 invariants in 14 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 920/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/930 constraints, PredecessorRefiner: 1260/1260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 1 (OVERLAPS) 10/930 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2024-05-22 12:19:00] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 15 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-22 12:19:00] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-22 12:19:00] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-22 12:19:00] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-22 12:19:00] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 12:19:00] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 12:19:00] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-22 12:19:01] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-22 12:19:01] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 1 ms to minimize.
SMT process timed out in 60426ms, After SMT, problems are : Problem set: 0 solved, 1260 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in SI_LTL mode, iteration 1 : 930/1000 places, 1620/1700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60706 ms. Remains : 930/1000 places, 1620/1700 transitions.
Support contains 890 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1700/1700 transitions.
Applied a total of 0 rules in 8 ms. Remains 1000 /1000 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
// Phase 1: matrix 1700 rows 1000 cols
[2024-05-22 12:19:01] [INFO ] Computed 10 invariants in 11 ms
[2024-05-22 12:19:01] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-05-22 12:19:01] [INFO ] Invariant cache hit.
[2024-05-22 12:19:02] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
Running 1340 sub problems to find dead transitions.
[2024-05-22 12:19:02] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1340/1340 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/990 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1340 unsolved
At refinement iteration 1 (OVERLAPS) 10/1000 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1340 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2700 variables, and 10 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1340 constraints, Known Traps: 0/0 constraints]
After SMT, in 60544ms problems are : Problem set: 0 solved, 1340 unsolved
Search for dead transitions found 0 dead transitions in 60560ms
Finished structural reductions in LTL mode , in 1 iterations and 62272 ms. Remains : 1000/1000 places, 1700/1700 transitions.
Treatment of property BART-PT-010-LTLFireability-04 finished in 300416 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(G(p1))||p0)))'
Support contains 690 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1290 transition count 1990
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1290 transition count 1990
Applied a total of 60 rules in 146 ms. Remains 1290 /1320 variables (removed 30) and now considering 1990/2020 (removed 30) transitions.
// Phase 1: matrix 1990 rows 1290 cols
[2024-05-22 12:20:04] [INFO ] Computed 10 invariants in 16 ms
[2024-05-22 12:20:04] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-22 12:20:04] [INFO ] Invariant cache hit.
[2024-05-22 12:20:05] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-05-22 12:20:05] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/3280 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/3280 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 0/0 constraints]
After SMT, in 60478ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 60496ms
Starting structural reductions in LTL mode, iteration 1 : 1290/1320 places, 1990/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62325 ms. Remains : 1290/1320 places, 1990/2020 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 2028 ms.
Product exploration explored 100000 steps with 50000 reset in 2132 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 : [(AND (NOT p0) p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 41 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-06 finished in 66806 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(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||(!p1&&(X(p0) U ((p1&&X(p0))||X(G(p0))))))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 320 place count 1000 transition count 1700
Iterating global reduction 0 with 320 rules applied. Total rules applied 640 place count 1000 transition count 1700
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 909 place count 731 transition count 1431
Iterating global reduction 0 with 269 rules applied. Total rules applied 1178 place count 731 transition count 1431
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1218 place count 691 transition count 1391
Iterating global reduction 0 with 40 rules applied. Total rules applied 1258 place count 691 transition count 1391
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1288 place count 661 transition count 1361
Iterating global reduction 0 with 30 rules applied. Total rules applied 1318 place count 661 transition count 1361
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1348 place count 631 transition count 1331
Iterating global reduction 0 with 30 rules applied. Total rules applied 1378 place count 631 transition count 1331
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1408 place count 601 transition count 1301
Iterating global reduction 0 with 30 rules applied. Total rules applied 1438 place count 601 transition count 1301
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1468 place count 571 transition count 1271
Iterating global reduction 0 with 30 rules applied. Total rules applied 1498 place count 571 transition count 1271
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1528 place count 541 transition count 1241
Iterating global reduction 0 with 30 rules applied. Total rules applied 1558 place count 541 transition count 1241
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1578 place count 521 transition count 1221
Iterating global reduction 0 with 20 rules applied. Total rules applied 1598 place count 521 transition count 1221
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1618 place count 501 transition count 1201
Iterating global reduction 0 with 20 rules applied. Total rules applied 1638 place count 501 transition count 1201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1648 place count 491 transition count 1191
Iterating global reduction 0 with 10 rules applied. Total rules applied 1658 place count 491 transition count 1191
Applied a total of 1658 rules in 304 ms. Remains 491 /1320 variables (removed 829) and now considering 1191/2020 (removed 829) transitions.
// Phase 1: matrix 1191 rows 491 cols
[2024-05-22 12:21:11] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 12:21:11] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 12:21:11] [INFO ] Invariant cache hit.
[2024-05-22 12:21:11] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Running 831 sub problems to find dead transitions.
[2024-05-22 12:21:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (OVERLAPS) 10/491 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 3 (OVERLAPS) 1191/1682 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1682/1682 variables, and 501 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 831 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 1 (OVERLAPS) 10/491 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 3 (OVERLAPS) 1191/1682 variables, 491/501 constraints. Problems are: Problem set: 0 solved, 831 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1682 variables, 831/1332 constraints. Problems are: Problem set: 0 solved, 831 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1682/1682 variables, and 1332 constraints, problems are : Problem set: 0 solved, 831 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 831/831 constraints, Known Traps: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 831 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 491/1320 places, 1191/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61337 ms. Remains : 491/1320 places, 1191/2020 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Running random walk in product with property : BART-PT-010-LTLFireability-09
Product exploration explored 100000 steps with 12788 reset in 1486 ms.
Product exploration explored 100000 steps with 12697 reset in 1444 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 : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 286 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), false]
RANDOM walk for 38182 steps (8 resets) in 230 ms. (165 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 415 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), false]
[2024-05-22 12:22:16] [INFO ] Invariant cache hit.
[2024-05-22 12:22:17] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 453 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-09 finished in 66756 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(G((p0||X((p1||F(G(p2))))))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 318 place count 1002 transition count 1702
Iterating global reduction 0 with 318 rules applied. Total rules applied 636 place count 1002 transition count 1702
Discarding 268 places :
Symmetric choice reduction at 0 with 268 rule applications. Total rules 904 place count 734 transition count 1434
Iterating global reduction 0 with 268 rules applied. Total rules applied 1172 place count 734 transition count 1434
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1211 place count 695 transition count 1395
Iterating global reduction 0 with 39 rules applied. Total rules applied 1250 place count 695 transition count 1395
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1279 place count 666 transition count 1366
Iterating global reduction 0 with 29 rules applied. Total rules applied 1308 place count 666 transition count 1366
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1336 place count 638 transition count 1338
Iterating global reduction 0 with 28 rules applied. Total rules applied 1364 place count 638 transition count 1338
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1392 place count 610 transition count 1310
Iterating global reduction 0 with 28 rules applied. Total rules applied 1420 place count 610 transition count 1310
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1448 place count 582 transition count 1282
Iterating global reduction 0 with 28 rules applied. Total rules applied 1476 place count 582 transition count 1282
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1504 place count 554 transition count 1254
Iterating global reduction 0 with 28 rules applied. Total rules applied 1532 place count 554 transition count 1254
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 1550 place count 536 transition count 1236
Iterating global reduction 0 with 18 rules applied. Total rules applied 1568 place count 536 transition count 1236
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 1586 place count 518 transition count 1218
Iterating global reduction 0 with 18 rules applied. Total rules applied 1604 place count 518 transition count 1218
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 1612 place count 510 transition count 1210
Iterating global reduction 0 with 8 rules applied. Total rules applied 1620 place count 510 transition count 1210
Applied a total of 1620 rules in 218 ms. Remains 510 /1320 variables (removed 810) and now considering 1210/2020 (removed 810) transitions.
// Phase 1: matrix 1210 rows 510 cols
[2024-05-22 12:22:17] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 12:22:17] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 12:22:17] [INFO ] Invariant cache hit.
[2024-05-22 12:22:18] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-22 12:22:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 520 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1720 variables, 850/1370 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 1370 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 510/1320 places, 1210/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61071 ms. Remains : 510/1320 places, 1210/2020 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BART-PT-010-LTLFireability-10
Product exploration explored 100000 steps with 37 reset in 257 ms.
Product exploration explored 100000 steps with 21 reset in 311 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 : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 13656 steps (2 resets) in 76 ms. (177 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 244 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 1210/1210 transitions.
Applied a total of 0 rules in 11 ms. Remains 510 /510 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
[2024-05-22 12:23:20] [INFO ] Invariant cache hit.
[2024-05-22 12:23:20] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-22 12:23:20] [INFO ] Invariant cache hit.
[2024-05-22 12:23:21] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-22 12:23:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 520 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1720 variables, 850/1370 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 1370 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in LTL mode , in 1 iterations and 61015 ms. Remains : 510/510 places, 1210/1210 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 : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 17541 steps (3 resets) in 76 ms. (227 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33 reset in 262 ms.
Product exploration explored 100000 steps with 34 reset in 287 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 1210/1210 transitions.
Graph (trivial) has 1200 edges and 510 vertex of which 440 / 510 are part of one of the 9 SCC in 2 ms
Free SCC test removed 431 places
Ensure Unique test removed 1042 transitions
Reduce isomorphic transitions removed 1042 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 73 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 73 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 73 transition count 161
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 73 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 72 transition count 160
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 72 transition count 160
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 38 place count 72 transition count 161
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 55 place count 72 transition count 144
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 77 place count 50 transition count 122
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 99 place count 50 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 50 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 49 transition count 119
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 49 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 49 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 49 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 48 transition count 116
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 48 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 48 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 48 transition count 114
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 113 place count 47 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 114 place count 47 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 47 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 117 place count 47 transition count 111
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 118 place count 46 transition count 110
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 119 place count 46 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 46 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 122 place count 46 transition count 108
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 123 place count 45 transition count 107
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 124 place count 45 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 125 place count 45 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 127 place count 45 transition count 105
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 128 place count 44 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 129 place count 44 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 130 place count 44 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 132 place count 44 transition count 102
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 133 place count 43 transition count 101
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 134 place count 43 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 135 place count 43 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 137 place count 43 transition count 99
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 138 place count 42 transition count 98
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 139 place count 42 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 140 place count 42 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 142 place count 42 transition count 96
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 143 place count 41 transition count 95
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 144 place count 41 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 145 place count 41 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 147 place count 41 transition count 93
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 148 place count 40 transition count 92
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 149 place count 40 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 150 place count 40 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 152 place count 40 transition count 90
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 153 place count 39 transition count 89
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 154 place count 39 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 155 place count 39 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 157 place count 39 transition count 87
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 158 place count 38 transition count 86
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 159 place count 38 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 160 place count 38 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 162 place count 38 transition count 84
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 163 place count 37 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 164 place count 37 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 165 place count 37 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 167 place count 37 transition count 81
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 168 place count 36 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 169 place count 36 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 170 place count 36 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 172 place count 36 transition count 78
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 173 place count 35 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 174 place count 35 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 175 place count 35 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 177 place count 35 transition count 75
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 178 place count 34 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 179 place count 34 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 180 place count 34 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 182 place count 34 transition count 72
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 183 place count 33 transition count 71
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 184 place count 33 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 185 place count 33 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 187 place count 33 transition count 69
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 188 place count 32 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 189 place count 32 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 190 place count 32 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 192 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 193 place count 31 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 194 place count 31 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 195 place count 31 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 197 place count 31 transition count 63
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 198 place count 30 transition count 62
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 199 place count 30 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 200 place count 30 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 202 place count 30 transition count 60
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 203 place count 29 transition count 59
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 204 place count 29 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 205 place count 29 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 207 place count 29 transition count 57
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 208 place count 28 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 209 place count 28 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 210 place count 28 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 212 place count 28 transition count 54
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 213 place count 27 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 214 place count 27 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 215 place count 27 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 217 place count 27 transition count 51
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 218 place count 26 transition count 50
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 219 place count 26 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 220 place count 26 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 222 place count 26 transition count 48
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 223 place count 25 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 224 place count 25 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 225 place count 25 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 227 place count 25 transition count 45
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 228 place count 24 transition count 44
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 229 place count 24 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 230 place count 24 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 232 place count 24 transition count 42
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 233 place count 23 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 234 place count 23 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 235 place count 23 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 237 place count 23 transition count 39
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 238 place count 22 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 239 place count 22 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 240 place count 22 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 242 place count 22 transition count 36
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 243 place count 21 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 244 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 245 place count 21 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 247 place count 21 transition count 33
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 248 place count 20 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 249 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 250 place count 20 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 252 place count 20 transition count 30
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 253 place count 19 transition count 29
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 254 place count 19 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 255 place count 19 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 257 place count 19 transition count 27
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 258 place count 18 transition count 26
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 259 place count 18 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 260 place count 18 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 262 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 263 place count 17 transition count 23
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 264 place count 17 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 265 place count 17 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 267 place count 17 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 267 place count 17 transition count 21
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 268 place count 17 transition count 21
Discarding 4 places :
Symmetric choice reduction at 37 with 4 rule applications. Total rules 272 place count 13 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 4 rules applied. Total rules applied 276 place count 13 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 37 with 3 rules applied. Total rules applied 279 place count 13 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 2 Pre rules applied. Total rules applied 279 place count 13 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 281 place count 13 transition count 14
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 283 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 285 place count 11 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 285 rules in 72 ms. Remains 11 /510 variables (removed 499) and now considering 12/1210 (removed 1198) transitions.
[2024-05-22 12:24:23] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 11 cols
[2024-05-22 12:24:23] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 12:24:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-22 12:24:23] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem TDEAD1 is UNSAT
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/17 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 17 constraints, problems are : Problem set: 3 solved, 4 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 11/22 variables, 11/17 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 4/21 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 21 constraints, problems are : Problem set: 3 solved, 4 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 209ms problems are : Problem set: 3 solved, 4 unsolved
Search for dead transitions found 3 dead transitions in 209ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 11/510 places, 9/1210 transitions.
Graph (complete) has 8 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 8 /11 variables (removed 3) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/510 places, 9/1210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 294 ms. Remains : 8/510 places, 9/1210 transitions.
Support contains 4 out of 510 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 1210/1210 transitions.
Applied a total of 0 rules in 10 ms. Remains 510 /510 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
// Phase 1: matrix 1210 rows 510 cols
[2024-05-22 12:24:23] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 12:24:23] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 12:24:23] [INFO ] Invariant cache hit.
[2024-05-22 12:24:24] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-22 12:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 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 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 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 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)timeout

(s332 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 520 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1720 variables, 850/1370 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 1370 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Finished structural reductions in LTL mode , in 1 iterations and 60813 ms. Remains : 510/510 places, 1210/1210 transitions.
Treatment of property BART-PT-010-LTLFireability-10 finished in 187259 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)||X((G(p1)||X(F(p2))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1215 place count 693 transition count 1393
Iterating global reduction 0 with 39 rules applied. Total rules applied 1254 place count 693 transition count 1393
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1284 place count 663 transition count 1363
Iterating global reduction 0 with 30 rules applied. Total rules applied 1314 place count 663 transition count 1363
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1344 place count 633 transition count 1333
Iterating global reduction 0 with 30 rules applied. Total rules applied 1374 place count 633 transition count 1333
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1404 place count 603 transition count 1303
Iterating global reduction 0 with 30 rules applied. Total rules applied 1434 place count 603 transition count 1303
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1463 place count 574 transition count 1274
Iterating global reduction 0 with 29 rules applied. Total rules applied 1492 place count 574 transition count 1274
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1521 place count 545 transition count 1245
Iterating global reduction 0 with 29 rules applied. Total rules applied 1550 place count 545 transition count 1245
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1569 place count 526 transition count 1226
Iterating global reduction 0 with 19 rules applied. Total rules applied 1588 place count 526 transition count 1226
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1607 place count 507 transition count 1207
Iterating global reduction 0 with 19 rules applied. Total rules applied 1626 place count 507 transition count 1207
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 1635 place count 498 transition count 1198
Iterating global reduction 0 with 9 rules applied. Total rules applied 1644 place count 498 transition count 1198
Applied a total of 1644 rules in 184 ms. Remains 498 /1320 variables (removed 822) and now considering 1198/2020 (removed 822) transitions.
// Phase 1: matrix 1198 rows 498 cols
[2024-05-22 12:25:24] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 12:25:25] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 12:25:25] [INFO ] Invariant cache hit.
[2024-05-22 12:25:25] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 838 sub problems to find dead transitions.
[2024-05-22 12:25:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 1 (OVERLAPS) 10/498 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1198/1696 variables, 498/508 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1696/1696 variables, and 508 constraints, problems are : Problem set: 0 solved, 838 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 838/838 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 838 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 1 (OVERLAPS) 10/498 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 3 (OVERLAPS) 1198/1696 variables, 498/508 constraints. Problems are: Problem set: 0 solved, 838 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 838/1346 constraints. Problems are: Problem set: 0 solved, 838 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 1346 constraints, problems are : Problem set: 0 solved, 838 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 838/838 constraints, Known Traps: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 838 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Starting structural reductions in LTL mode, iteration 1 : 498/1320 places, 1198/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61037 ms. Remains : 498/1320 places, 1198/2020 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-010-LTLFireability-11
Product exploration explored 100000 steps with 157 reset in 284 ms.
Product exploration explored 100000 steps with 159 reset in 297 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 : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 158 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
[2024-05-22 12:26:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/184 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/184 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/1696 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/10 constraints, State Equation: 57/498 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 57/1696 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/10 constraints, State Equation: 0/498 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X p1)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND p1 (NOT p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-11 finished in 62723 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(p0))'
Support contains 1 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2018 edges and 1320 vertex of which 1188 / 1320 are part of one of the 9 SCC in 1 ms
Free SCC test removed 1179 places
Ensure Unique test removed 1809 transitions
Reduce isomorphic transitions removed 1809 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 137 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 137 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 145 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 202 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 206 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 214 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 222 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 226 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 230 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 234 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 238 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 242 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 246 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 250 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 254 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 258 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 262 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 266 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 270 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 274 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 278 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 282 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 286 place count 16 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 290 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 294 place count 14 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 298 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 302 place count 12 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 306 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 310 place count 10 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 314 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 318 place count 8 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 322 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 326 place count 6 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 330 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 335 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 337 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 337 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 339 place count 2 transition count 3
Applied a total of 339 rules in 35 ms. Remains 2 /1320 variables (removed 1318) and now considering 3/2020 (removed 2017) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 12:26:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 12:26:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 12:26:27] [INFO ] Invariant cache hit.
[2024-05-22 12:26:27] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-22 12:26:27] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 12:26:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 54ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1320 places, 3/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 2/1320 places, 3/2020 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-15 finished in 234 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(G((F(G(p0)) U (p0 U p1)))))'
Found a Lengthening insensitive property : BART-PT-010-LTLFireability-04
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 890 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1320 transition count 2000
Reduce places removed 20 places and 0 transitions.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Iterating post reduction 1 with 110 rules applied. Total rules applied 130 place count 1300 transition count 1910
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 220 place count 1210 transition count 1910
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 220 place count 1210 transition count 1870
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 300 place count 1170 transition count 1870
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 360 place count 1110 transition count 1810
Iterating global reduction 3 with 60 rules applied. Total rules applied 420 place count 1110 transition count 1810
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 430 place count 1110 transition count 1800
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 460 place count 1080 transition count 1770
Iterating global reduction 4 with 30 rules applied. Total rules applied 490 place count 1080 transition count 1770
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 520 place count 1050 transition count 1740
Iterating global reduction 4 with 30 rules applied. Total rules applied 550 place count 1050 transition count 1740
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 580 place count 1020 transition count 1710
Iterating global reduction 4 with 30 rules applied. Total rules applied 610 place count 1020 transition count 1710
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 630 place count 1000 transition count 1690
Iterating global reduction 4 with 20 rules applied. Total rules applied 650 place count 1000 transition count 1690
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 670 place count 980 transition count 1670
Iterating global reduction 4 with 20 rules applied. Total rules applied 690 place count 980 transition count 1670
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 700 place count 970 transition count 1660
Iterating global reduction 4 with 10 rules applied. Total rules applied 710 place count 970 transition count 1660
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 830 place count 910 transition count 1600
Applied a total of 830 rules in 117 ms. Remains 910 /1320 variables (removed 410) and now considering 1600/2020 (removed 420) transitions.
// Phase 1: matrix 1600 rows 910 cols
[2024-05-22 12:26:28] [INFO ] Computed 10 invariants in 11 ms
[2024-05-22 12:26:28] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-22 12:26:28] [INFO ] Invariant cache hit.
[2024-05-22 12:26:29] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
Running 1240 sub problems to find dead transitions.
[2024-05-22 12:26:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 30318ms
Starting structural reductions in LI_LTL mode, iteration 1 : 910/1320 places, 1600/2020 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31436 ms. Remains : 910/1320 places, 1600/2020 transitions.
Running random walk in product with property : BART-PT-010-LTLFireability-04
Product exploration explored 100000 steps with 24 reset in 1751 ms.
Stack based approach found an accepted trace after 50150 steps with 3 reset with depth 50069 and stack size 50016 in 885 ms.
Treatment of property BART-PT-010-LTLFireability-04 finished in 34402 ms.
FORMULA BART-PT-010-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(G((p0||X((p1||F(G(p2))))))))'
Found a Lengthening insensitive property : BART-PT-010-LTLFireability-10
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2007 edges and 1320 vertex of which 1097 / 1320 are part of one of the 9 SCC in 1 ms
Free SCC test removed 1088 places
Ensure Unique test removed 1684 transitions
Reduce isomorphic transitions removed 1684 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 226 transition count 205
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 138 rules applied. Total rules applied 270 place count 100 transition count 193
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 282 place count 96 transition count 185
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 294 place count 92 transition count 177
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 12 rules applied. Total rules applied 306 place count 88 transition count 169
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 9 rules applied. Total rules applied 315 place count 84 transition count 164
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 321 place count 82 transition count 160
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 326 place count 80 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 328 place count 79 transition count 156
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 328 place count 79 transition count 152
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 336 place count 75 transition count 152
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 345 place count 66 transition count 143
Iterating global reduction 9 with 9 rules applied. Total rules applied 354 place count 66 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 358 place count 66 transition count 139
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 362 place count 62 transition count 135
Iterating global reduction 10 with 4 rules applied. Total rules applied 366 place count 62 transition count 135
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 369 place count 59 transition count 132
Iterating global reduction 10 with 3 rules applied. Total rules applied 372 place count 59 transition count 132
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 375 place count 56 transition count 129
Iterating global reduction 10 with 3 rules applied. Total rules applied 378 place count 56 transition count 129
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 380 place count 54 transition count 127
Iterating global reduction 10 with 2 rules applied. Total rules applied 382 place count 54 transition count 127
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 384 place count 52 transition count 125
Iterating global reduction 10 with 2 rules applied. Total rules applied 386 place count 52 transition count 125
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 387 place count 51 transition count 124
Iterating global reduction 10 with 1 rules applied. Total rules applied 388 place count 51 transition count 124
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 402 place count 44 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 406 place count 44 transition count 113
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 410 place count 42 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 414 place count 42 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 418 place count 40 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 422 place count 40 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 426 place count 38 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 430 place count 38 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 434 place count 36 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 438 place count 36 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 442 place count 34 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 446 place count 34 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 450 place count 32 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 454 place count 32 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 458 place count 30 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 462 place count 30 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 466 place count 28 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 470 place count 28 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 474 place count 26 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 478 place count 26 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 482 place count 24 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 486 place count 24 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 490 place count 22 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 494 place count 22 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 498 place count 20 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 502 place count 20 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 506 place count 18 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 510 place count 18 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 514 place count 16 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 518 place count 16 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 25 with 4 rules applied. Total rules applied 522 place count 14 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 526 place count 14 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 4 rules applied. Total rules applied 530 place count 12 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 26 with 5 rules applied. Total rules applied 535 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 537 place count 11 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 28 with 1 Pre rules applied. Total rules applied 537 place count 11 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 539 place count 10 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 28 with 3 rules applied. Total rules applied 542 place count 10 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 28 with 2 Pre rules applied. Total rules applied 542 place count 10 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 4 rules applied. Total rules applied 546 place count 8 transition count 9
Applied a total of 546 rules in 26 ms. Remains 8 /1320 variables (removed 1312) and now considering 9/2020 (removed 2011) transitions.
// Phase 1: matrix 9 rows 8 cols
[2024-05-22 12:27:02] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 12:27:02] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 12:27:02] [INFO ] Invariant cache hit.
[2024-05-22 12:27:02] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-05-22 12:27:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Starting structural reductions in LI_LTL mode, iteration 1 : 8/1320 places, 9/2020 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 187 ms. Remains : 8/1320 places, 9/2020 transitions.
Running random walk in product with property : BART-PT-010-LTLFireability-10
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 1 ms.
Treatment of property BART-PT-010-LTLFireability-10 finished in 500 ms.
FORMULA BART-PT-010-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-22 12:27:02] [INFO ] Flatten gal took : 86 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 881723 ms.
ITS solved all properties within timeout

BK_STOP 1716380822789

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BART-PT-010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166700460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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