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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 ASLink-PT-07b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2023-10
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2023-11
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2023-12
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2023-13
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717220179903

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:36:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:36:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:36:22] [INFO ] Load time of PNML (sax parser for PT used): 601 ms
[2024-06-01 05:36:22] [INFO ] Transformed 3222 places.
[2024-06-01 05:36:22] [INFO ] Transformed 3986 transitions.
[2024-06-01 05:36:22] [INFO ] Found NUPN structural information;
[2024-06-01 05:36:22] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 897 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (58 resets) in 2033 ms. (19 steps per ms) remains 10/16 properties
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 814 ms. (49 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 435 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
// Phase 1: matrix 3986 rows 3222 cols
[2024-06-01 05:36:25] [INFO ] Computed 316 invariants in 376 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 781/913 variables, 75/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/913 variables, 781/988 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/913 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-07b-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2024-01 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 2204/3117 variables, 226/1214 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3117 variables, 2204/3418 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3117 variables, 0/3418 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 105/3222 variables, 15/3433 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3222 variables, 105/3538 constraints. Problems are: Problem set: 2 solved, 8 unsolved
(s499 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.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 1.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 1.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 1.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 (/ 1.0 8.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 (/ 7.0 8.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 (/ 1.0 8.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)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 (/ 7.0 8.0))
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 (/ 7.0 8.0))
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 (/ 7.0 8.0))
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 (/ 1.0 8.0))
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 (/ 3.0 4.0))
(s491 0.0)
(s492 (/ 1.0 8.0))
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 (/ 1.0 8.0))
(s498 0.0)
(s499 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3222/7208 variables, and 3538 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5083 ms.
Refiners :[Domain max(s): 3222/3222 constraints, Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 241/241 constraints, State Equation: 0/3222 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 786/864 variables, 75/153 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/864 variables, 786/939 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/864 variables, 0/939 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2253/3117 variables, 226/1165 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3117 variables, 2253/3418 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-01 05:36:36] [INFO ] Deduced a trap composed of 20 places in 3174 ms of which 305 ms to minimize.
SMT process timed out in 11375ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 78 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 723 transitions
Trivial Post-agglo rules discarded 723 transitions
Performed 723 trivial Post agglomeration. Transition count delta: 723
Iterating post reduction 0 with 723 rules applied. Total rules applied 723 place count 3222 transition count 3263
Reduce places removed 723 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 757 rules applied. Total rules applied 1480 place count 2499 transition count 3229
Reduce places removed 9 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 18 rules applied. Total rules applied 1498 place count 2490 transition count 3220
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1507 place count 2481 transition count 3220
Performed 727 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 727 Pre rules applied. Total rules applied 1507 place count 2481 transition count 2493
Deduced a syphon composed of 727 places in 7 ms
Ensure Unique test removed 72 places
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 4 with 1526 rules applied. Total rules applied 3033 place count 1682 transition count 2493
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 4 with 49 rules applied. Total rules applied 3082 place count 1676 transition count 2450
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 5 with 43 rules applied. Total rules applied 3125 place count 1633 transition count 2450
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 3125 place count 1633 transition count 2424
Deduced a syphon composed of 26 places in 21 ms
Ensure Unique test removed 25 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 77 rules applied. Total rules applied 3202 place count 1582 transition count 2424
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 3202 place count 1582 transition count 2399
Deduced a syphon composed of 25 places in 20 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 3252 place count 1557 transition count 2399
Discarding 97 places :
Symmetric choice reduction at 6 with 97 rule applications. Total rules 3349 place count 1460 transition count 2302
Iterating global reduction 6 with 97 rules applied. Total rules applied 3446 place count 1460 transition count 2302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3447 place count 1460 transition count 2301
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 28 Pre rules applied. Total rules applied 3447 place count 1460 transition count 2273
Deduced a syphon composed of 28 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 57 rules applied. Total rules applied 3504 place count 1431 transition count 2273
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3506 place count 1430 transition count 2272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3507 place count 1429 transition count 2272
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 3514 place count 1422 transition count 2227
Iterating global reduction 9 with 7 rules applied. Total rules applied 3521 place count 1422 transition count 2227
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 3521 place count 1422 transition count 2222
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 3531 place count 1417 transition count 2222
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3532 place count 1416 transition count 2214
Iterating global reduction 9 with 1 rules applied. Total rules applied 3533 place count 1416 transition count 2214
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3534 place count 1415 transition count 2206
Iterating global reduction 9 with 1 rules applied. Total rules applied 3535 place count 1415 transition count 2206
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3536 place count 1414 transition count 2198
Iterating global reduction 9 with 1 rules applied. Total rules applied 3537 place count 1414 transition count 2198
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3538 place count 1413 transition count 2190
Iterating global reduction 9 with 1 rules applied. Total rules applied 3539 place count 1413 transition count 2190
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3540 place count 1412 transition count 2182
Iterating global reduction 9 with 1 rules applied. Total rules applied 3541 place count 1412 transition count 2182
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3542 place count 1411 transition count 2174
Iterating global reduction 9 with 1 rules applied. Total rules applied 3543 place count 1411 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3544 place count 1410 transition count 2166
Iterating global reduction 9 with 1 rules applied. Total rules applied 3545 place count 1410 transition count 2166
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 9 with 359 rules applied. Total rules applied 3904 place count 1230 transition count 1987
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3905 place count 1229 transition count 1986
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 3907 place count 1228 transition count 1986
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3908 place count 1227 transition count 1985
Iterating global reduction 9 with 1 rules applied. Total rules applied 3909 place count 1227 transition count 1985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 3911 place count 1227 transition count 1983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3912 place count 1226 transition count 1983
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3914 place count 1225 transition count 1992
Free-agglomeration rule applied 10 times.
Iterating global reduction 11 with 10 rules applied. Total rules applied 3924 place count 1225 transition count 1982
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 3934 place count 1215 transition count 1982
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 3941 place count 1215 transition count 1975
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 3948 place count 1208 transition count 1975
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 3949 place count 1208 transition count 1975
Applied a total of 3949 rules in 3102 ms. Remains 1208 /3222 variables (removed 2014) and now considering 1975/3986 (removed 2011) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3122 ms. Remains : 1208/3222 places, 1975/3986 transitions.
RANDOM walk for 40000 steps (246 resets) in 565 ms. (70 steps per ms) remains 6/8 properties
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (39 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (44 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 344 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (39 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (41 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
// Phase 1: matrix 1975 rows 1208 cols
[2024-06-01 05:36:40] [INFO ] Computed 209 invariants in 64 ms
[2024-06-01 05:36:40] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 151/189 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 258/447 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 717/1164 variables, 144/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1164 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 44/1208 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1208 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1975/3183 variables, 1208/1417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3183 variables, 54/1471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3183 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/3183 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3183/3183 variables, and 1471 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3144 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 153/153 constraints, State Equation: 1208/1208 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 151/189 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 258/447 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 717/1164 variables, 144/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:36:44] [INFO ] Deduced a trap composed of 127 places in 836 ms of which 11 ms to minimize.
[2024-06-01 05:36:45] [INFO ] Deduced a trap composed of 30 places in 893 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1164 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:36:46] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1164 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 44/1208 variables, 9/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1208 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ASLink-PT-07b-ReachabilityFireability-2023-11 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2023-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2023-12 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2023-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-07b-ReachabilityFireability-2024-15 is UNSAT
FORMULA ASLink-PT-07b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 1975/3183 variables, 1208/1420 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3183 variables, 54/1474 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3183 variables, 3/1477 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3183 variables, 0/1477 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/3183 variables, 0/1477 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3183/3183 variables, and 1477 constraints, problems are : Problem set: 3 solved, 3 unsolved in 14546 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 153/153 constraints, State Equation: 1208/1208 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 17822ms problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6239 ms.
Support contains 6 out of 1208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1208/1208 places, 1975/1975 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 0 with 4 rules applied. Total rules applied 4 place count 1208 transition count 1971
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1204 transition count 1971
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 8 place count 1204 transition count 1936
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 1169 transition count 1936
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 1168 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 1167 transition count 1928
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 1167 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 1166 transition count 1920
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 1166 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 1165 transition count 1912
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 1165 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 1164 transition count 1904
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 1164 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 1163 transition count 1896
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 1163 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 1162 transition count 1888
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 1162 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 1161 transition count 1880
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 1161 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 1160 transition count 1872
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 1160 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 1159 transition count 1864
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 1159 transition count 1864
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 133 place count 1141 transition count 1846
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 1140 transition count 1840
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 1140 transition count 1840
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 1140 transition count 1838
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 1138 transition count 1838
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 1138 transition count 1838
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 1137 transition count 1837
Reduce places removed 14 places and 0 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 18 rules applied. Total rules applied 159 place count 1123 transition count 1833
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 165 place count 1119 transition count 1831
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 167 place count 1117 transition count 1831
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 167 place count 1117 transition count 1810
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 43 rules applied. Total rules applied 210 place count 1095 transition count 1810
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 7 with 8 rules applied. Total rules applied 218 place count 1087 transition count 1810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 218 place count 1087 transition count 1809
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 220 place count 1086 transition count 1809
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 248 place count 1072 transition count 1795
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 255 place count 1065 transition count 1788
Iterating global reduction 8 with 7 rules applied. Total rules applied 262 place count 1065 transition count 1788
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 269 place count 1065 transition count 1781
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 276 place count 1058 transition count 1781
Applied a total of 276 rules in 828 ms. Remains 1058 /1208 variables (removed 150) and now considering 1781/1975 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 828 ms. Remains : 1058/1208 places, 1781/1975 transitions.
RANDOM walk for 40000 steps (432 resets) in 382 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (60 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (58 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (61 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 179846 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 3
Probabilistic random walk after 179846 steps, saw 33324 distinct states, run finished after 3007 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 1781 rows 1058 cols
[2024-06-01 05:37:08] [INFO ] Computed 185 invariants in 29 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/97 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 368/468 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 95/563 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/567 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 308/875 variables, 62/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/875 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 20/895 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/895 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/896 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/896 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 123/1019 variables, 22/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1019 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/1021 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1021 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 35/1056 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1056 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/1058 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1058 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1781/2839 variables, 1058/1243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2839 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/2839 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2839/2839 variables, and 1243 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2123 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 137/137 constraints, State Equation: 1058/1058 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/97 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 368/468 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 95/563 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/567 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 308/875 variables, 62/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/875 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 20/895 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/895 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/896 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/896 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 123/1019 variables, 22/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1019 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/1021 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1021 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 35/1056 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1056 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/1058 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1058 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1781/2839 variables, 1058/1243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2839 variables, 3/1246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2839 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/2839 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2839/2839 variables, and 1246 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3059 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 137/137 constraints, State Equation: 1058/1058 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 5232ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10533 ms.
Support contains 6 out of 1058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1058/1058 places, 1781/1781 transitions.
Applied a total of 0 rules in 69 ms. Remains 1058 /1058 variables (removed 0) and now considering 1781/1781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1058/1058 places, 1781/1781 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1058/1058 places, 1781/1781 transitions.
Applied a total of 0 rules in 81 ms. Remains 1058 /1058 variables (removed 0) and now considering 1781/1781 (removed 0) transitions.
[2024-06-01 05:37:24] [INFO ] Invariant cache hit.
[2024-06-01 05:37:26] [INFO ] Implicit Places using invariants in 2039 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 349, 383, 387, 388, 399, 400, 402, 419, 437, 475, 509, 513, 514, 525, 526, 528, 545, 563, 632, 636, 637, 648, 649, 650, 668, 686, 746, 759, 763, 764, 775, 776, 778, 795, 813, 884, 888, 889, 892, 903, 904, 905, 923, 925, 929, 947, 948, 949, 950, 962, 968, 974, 980, 986, 992, 998, 1004, 1010, 1016, 1022]
[2024-06-01 05:37:26] [INFO ] Actually due to overlaps returned [923, 905, 48, 168, 291, 419, 545, 668, 795, 929, 31, 150, 274, 402, 528, 650, 778, 148, 271, 399, 526, 648, 775, 903, 947, 149, 272, 400, 525, 649, 776, 904, 925, 948, 1, 18, 259, 260, 387, 388, 513, 514, 636, 637, 763, 764, 888, 889, 66, 186, 309, 437, 563, 686, 813, 949, 992, 1010, 1022, 19, 892, 950, 962, 968, 974, 980, 986, 998, 1004, 1016]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 2062 ms to find 70 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 988/1058 places, 1781/1781 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 978 transition count 1645
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 148 rules applied. Total rules applied 294 place count 842 transition count 1633
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 301 place count 835 transition count 1633
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 301 place count 835 transition count 1598
Deduced a syphon composed of 35 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 372 place count 799 transition count 1598
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 384 place count 795 transition count 1590
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 392 place count 787 transition count 1590
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 407 place count 772 transition count 1575
Iterating global reduction 5 with 15 rules applied. Total rules applied 422 place count 772 transition count 1575
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 425 place count 772 transition count 1572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 425 place count 772 transition count 1571
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 427 place count 771 transition count 1571
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 430 place count 768 transition count 1565
Iterating global reduction 6 with 3 rules applied. Total rules applied 433 place count 768 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 434 place count 767 transition count 1564
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 767 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 436 place count 766 transition count 1562
Iterating global reduction 6 with 1 rules applied. Total rules applied 437 place count 766 transition count 1562
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 539 place count 715 transition count 1511
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 546 place count 708 transition count 1504
Iterating global reduction 6 with 7 rules applied. Total rules applied 553 place count 708 transition count 1504
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 560 place count 708 transition count 1497
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 564 place count 706 transition count 1498
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 7 with 17 rules applied. Total rules applied 581 place count 706 transition count 1481
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 599 place count 688 transition count 1481
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 601 place count 688 transition count 1479
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 622 place count 688 transition count 1479
Applied a total of 622 rules in 629 ms. Remains 688 /988 variables (removed 300) and now considering 1479/1781 (removed 302) transitions.
// Phase 1: matrix 1479 rows 688 cols
[2024-06-01 05:37:27] [INFO ] Computed 99 invariants in 27 ms
[2024-06-01 05:37:28] [INFO ] Implicit Places using invariants in 1107 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 263, 269, 272, 274, 279, 280, 332, 351, 357, 360, 362, 367, 368, 420, 437, 443, 446, 448, 453, 454, 506, 524, 535, 537, 542, 543, 595, 613, 619, 622, 624]
[2024-06-01 05:37:28] [INFO ] Actually due to overlaps returned [104, 190, 279, 367, 453, 542, 105, 191, 280, 368, 454, 543, 89, 95, 100, 174, 180, 185, 263, 269, 274, 351, 357, 362, 437, 443, 448, 524, 537, 613, 619, 624, 72, 101, 157, 243, 332, 420, 506, 595]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1110 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 648/1058 places, 1479/1781 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 622 transition count 1453
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 622 transition count 1453
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 616 transition count 1447
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 616 transition count 1447
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 92 place count 602 transition count 1433
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 112 place count 602 transition count 1413
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 132 place count 582 transition count 1413
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 137 place count 582 transition count 1408
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 142 place count 577 transition count 1408
Applied a total of 142 rules in 192 ms. Remains 577 /648 variables (removed 71) and now considering 1408/1479 (removed 71) transitions.
// Phase 1: matrix 1408 rows 577 cols
[2024-06-01 05:37:28] [INFO ] Computed 59 invariants in 25 ms
[2024-06-01 05:37:29] [INFO ] Implicit Places using invariants in 853 ms returned []
[2024-06-01 05:37:29] [INFO ] Invariant cache hit.
[2024-06-01 05:37:32] [INFO ] Implicit Places using invariants and state equation in 3001 ms returned []
Implicit Place search using SMT with State Equation took 3863 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 577/1058 places, 1408/1781 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7937 ms. Remains : 577/1058 places, 1408/1781 transitions.
RANDOM walk for 40000 steps (657 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (115 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (129 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (128 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 165655 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 3
Probabilistic random walk after 165655 steps, saw 102092 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-01 05:37:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 307/364 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 25/389 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 173/562 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/566 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 11/577 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/577 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1408/1985 variables, 577/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1985 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1985 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1985/1985 variables, and 636 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 307/364 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 25/389 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 173/562 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/566 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 11/577 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/577 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1408/1985 variables, 577/636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1985 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1985 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1985 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1985/1985 variables, and 639 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2285 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3694ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2745 ms.
Support contains 6 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 1408/1408 transitions.
Applied a total of 0 rules in 26 ms. Remains 577 /577 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 577/577 places, 1408/1408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 1408/1408 transitions.
Applied a total of 0 rules in 23 ms. Remains 577 /577 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
[2024-06-01 05:37:41] [INFO ] Invariant cache hit.
[2024-06-01 05:37:42] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2024-06-01 05:37:42] [INFO ] Invariant cache hit.
[2024-06-01 05:37:46] [INFO ] Implicit Places using invariants and state equation in 3169 ms returned []
Implicit Place search using SMT with State Equation took 4188 ms to find 0 implicit places.
[2024-06-01 05:37:46] [INFO ] Redundant transitions in 197 ms returned []
Running 1371 sub problems to find dead transitions.
[2024-06-01 05:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/1985 variables, and 54 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 44/46 constraints, State Equation: 0/577 constraints, PredecessorRefiner: 1371/1371 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/1985 variables, and 54 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 44/46 constraints, State Equation: 0/577 constraints, PredecessorRefiner: 0/1371 constraints, Known Traps: 0/0 constraints]
After SMT, in 61395ms problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 61428ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65865 ms. Remains : 577/577 places, 1408/1408 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 41 ms. Remains 577 /577 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-06-01 05:38:47] [INFO ] Invariant cache hit.
[2024-06-01 05:38:48] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 05:38:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 05:38:48] [INFO ] [Nat]Absence check using 13 positive and 46 generalized place invariants in 44 ms returned sat
[2024-06-01 05:38:49] [INFO ] After 910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 05:38:49] [INFO ] After 1258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 05:38:49] [INFO ] After 1784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 2038 ms.
[2024-06-01 05:38:49] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 05:38:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 577 places, 1408 transitions and 5730 arcs took 25 ms.
[2024-06-01 05:38:50] [INFO ] Flatten gal took : 311 ms
Total runtime 148617 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-07b-ReachabilityFireability-2024-05
Could not compute solution for formula : ASLink-PT-07b-ReachabilityFireability-2023-10
Could not compute solution for formula : ASLink-PT-07b-ReachabilityFireability-2023-13

BK_STOP 1717220331019

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-07b-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/596/inv_0_
rfs formula name ASLink-PT-07b-ReachabilityFireability-2023-10
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_1_
rfs formula name ASLink-PT-07b-ReachabilityFireability-2023-13
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-07b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-07b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117900119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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