fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r508-tall-171654350800047
Last Updated
July 7, 2024

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3114.359 433226.00 518931.00 1124.40 ??T??F??TF?FFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350800047.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 MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 12 06:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 06:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.7M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717196731232

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:05:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:05:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:05:32] [INFO ] Load time of PNML (sax parser for PT used): 409 ms
[2024-05-31 23:05:32] [INFO ] Transformed 6222 places.
[2024-05-31 23:05:32] [INFO ] Transformed 8685 transitions.
[2024-05-31 23:05:32] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 568 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (549 resets) in 2635 ms. (15 steps per ms) remains 11/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (152 resets) in 452 ms. (88 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (152 resets) in 512 ms. (77 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (152 resets) in 318 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (152 resets) in 325 ms. (122 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (152 resets) in 251 ms. (158 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (152 resets) in 204 ms. (195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (152 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (152 resets) in 958 ms. (41 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (152 resets) in 487 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (152 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (152 resets) in 295 ms. (135 steps per ms) remains 11/11 properties
[2024-05-31 23:05:35] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2024-05-31 23:05:35] [INFO ] Computed 611 invariants in 540 ms
[2024-05-31 23:05:35] [INFO ] State equation strengthened by 2450 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 698/947 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/947 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/947 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 11/958 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/958 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 3493/4451 variables, 212/269 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4451 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1756/6207 variables, 327/596 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6207 variables, 0/596 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 15/6222 variables, 15/611 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/6222 variables, 0/611 constraints. Problems are: Problem set: 3 solved, 8 unsolved
SMT process timed out in 5989ms, After SMT, problems are : Problem set: 3 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.23 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1829 transitions
Trivial Post-agglo rules discarded 1829 transitions
Performed 1829 trivial Post agglomeration. Transition count delta: 1829
Iterating post reduction 0 with 1829 rules applied. Total rules applied 1830 place count 6188 transition count 6856
Reduce places removed 1829 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 1892 rules applied. Total rules applied 3722 place count 4359 transition count 6793
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 3785 place count 4296 transition count 6793
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 228 Pre rules applied. Total rules applied 3785 place count 4296 transition count 6565
Deduced a syphon composed of 228 places in 7 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 3 with 456 rules applied. Total rules applied 4241 place count 4068 transition count 6565
Discarding 1646 places :
Symmetric choice reduction at 3 with 1646 rule applications. Total rules 5887 place count 2422 transition count 4919
Iterating global reduction 3 with 1646 rules applied. Total rules applied 7533 place count 2422 transition count 4919
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 7533 place count 2422 transition count 4916
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 7539 place count 2419 transition count 4916
Discarding 209 places :
Symmetric choice reduction at 3 with 209 rule applications. Total rules 7748 place count 2210 transition count 3453
Iterating global reduction 3 with 209 rules applied. Total rules applied 7957 place count 2210 transition count 3453
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 7981 place count 2198 transition count 3441
Free-agglomeration rule (complex) applied 101 times.
Iterating global reduction 3 with 101 rules applied. Total rules applied 8082 place count 2198 transition count 3340
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 3 with 101 rules applied. Total rules applied 8183 place count 2097 transition count 3340
Partial Free-agglomeration rule applied 179 times.
Drop transitions (Partial Free agglomeration) removed 179 transitions
Iterating global reduction 4 with 179 rules applied. Total rules applied 8362 place count 2097 transition count 3340
Applied a total of 8362 rules in 1676 ms. Remains 2097 /6222 variables (removed 4125) and now considering 3340/8685 (removed 5345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1687 ms. Remains : 2097/6222 places, 3340/8685 transitions.
RANDOM walk for 40000 steps (779 resets) in 749 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (164 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (164 resets) in 306 ms. (130 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (164 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (164 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (164 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (164 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (164 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (164 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 50940 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 8
Probabilistic random walk after 50940 steps, saw 23329 distinct states, run finished after 3007 ms. (steps per millisecond=16 ) properties seen :0
[2024-05-31 23:05:46] [INFO ] Flow matrix only has 2967 transitions (discarded 373 similar events)
// Phase 1: matrix 2967 rows 2097 cols
[2024-05-31 23:05:46] [INFO ] Computed 577 invariants in 48 ms
[2024-05-31 23:05:46] [INFO ] State equation strengthened by 1196 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1274/1366 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1366 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/1368 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1368 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 618/1986 variables, 445/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1986 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 12/1998 variables, 12/478 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1998 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 99/2097 variables, 99/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2097 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2967/5064 variables, 2097/2674 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5064 variables, 1196/3870 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:05:51] [INFO ] Deduced a trap composed of 316 places in 1406 ms of which 103 ms to minimize.
[2024-05-31 23:05:51] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2024-05-31 23:05:53] [INFO ] Deduced a trap composed of 297 places in 1360 ms of which 14 ms to minimize.
[2024-05-31 23:05:54] [INFO ] Deduced a trap composed of 313 places in 1337 ms of which 14 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/5064 variables, 4/3874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5064 variables, 0/3874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/5064 variables, 0/3874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5064/5064 variables, and 3874 constraints, problems are : Problem set: 0 solved, 8 unsolved in 13229 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 544/544 constraints, State Equation: 2097/2097 constraints, ReadFeed: 1196/1196 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1274/1366 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:06:01] [INFO ] Deduced a trap composed of 503 places in 739 ms of which 9 ms to minimize.
[2024-05-31 23:06:01] [INFO ] Deduced a trap composed of 490 places in 545 ms of which 7 ms to minimize.
[2024-05-31 23:06:02] [INFO ] Deduced a trap composed of 545 places in 578 ms of which 7 ms to minimize.
[2024-05-31 23:06:02] [INFO ] Deduced a trap composed of 541 places in 580 ms of which 8 ms to minimize.
[2024-05-31 23:06:03] [INFO ] Deduced a trap composed of 493 places in 549 ms of which 7 ms to minimize.
[2024-05-31 23:06:04] [INFO ] Deduced a trap composed of 658 places in 540 ms of which 6 ms to minimize.
[2024-05-31 23:06:04] [INFO ] Deduced a trap composed of 692 places in 545 ms of which 7 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 523 places in 532 ms of which 7 ms to minimize.
[2024-05-31 23:06:05] [INFO ] Deduced a trap composed of 542 places in 544 ms of which 7 ms to minimize.
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 508 places in 522 ms of which 7 ms to minimize.
[2024-05-31 23:06:06] [INFO ] Deduced a trap composed of 490 places in 594 ms of which 6 ms to minimize.
[2024-05-31 23:06:07] [INFO ] Deduced a trap composed of 274 places in 235 ms of which 4 ms to minimize.
[2024-05-31 23:06:07] [INFO ] Deduced a trap composed of 339 places in 231 ms of which 4 ms to minimize.
[2024-05-31 23:06:07] [INFO ] Deduced a trap composed of 353 places in 238 ms of which 4 ms to minimize.
[2024-05-31 23:06:08] [INFO ] Deduced a trap composed of 428 places in 735 ms of which 8 ms to minimize.
[2024-05-31 23:06:09] [INFO ] Deduced a trap composed of 348 places in 694 ms of which 9 ms to minimize.
[2024-05-31 23:06:09] [INFO ] Deduced a trap composed of 676 places in 703 ms of which 8 ms to minimize.
[2024-05-31 23:06:10] [INFO ] Deduced a trap composed of 374 places in 668 ms of which 9 ms to minimize.
[2024-05-31 23:06:10] [INFO ] Deduced a trap composed of 348 places in 211 ms of which 4 ms to minimize.
[2024-05-31 23:06:11] [INFO ] Deduced a trap composed of 562 places in 671 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1366 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:06:12] [INFO ] Deduced a trap composed of 273 places in 743 ms of which 8 ms to minimize.
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 419 places in 519 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1366 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:06:13] [INFO ] Deduced a trap composed of 491 places in 500 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1366 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1366 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/1368 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1368 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 618/1986 variables, 445/489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1986 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:06:16] [INFO ] Deduced a trap composed of 5 places in 1309 ms of which 13 ms to minimize.
[2024-05-31 23:06:17] [INFO ] Deduced a trap composed of 504 places in 1245 ms of which 13 ms to minimize.
[2024-05-31 23:06:18] [INFO ] Deduced a trap composed of 221 places in 1297 ms of which 13 ms to minimize.
[2024-05-31 23:06:20] [INFO ] Deduced a trap composed of 493 places in 1320 ms of which 13 ms to minimize.
[2024-05-31 23:06:21] [INFO ] Deduced a trap composed of 496 places in 1330 ms of which 14 ms to minimize.
[2024-05-31 23:06:22] [INFO ] Deduced a trap composed of 326 places in 1261 ms of which 13 ms to minimize.
[2024-05-31 23:06:24] [INFO ] Deduced a trap composed of 517 places in 1281 ms of which 14 ms to minimize.
[2024-05-31 23:06:25] [INFO ] Deduced a trap composed of 497 places in 1304 ms of which 14 ms to minimize.
[2024-05-31 23:06:26] [INFO ] Deduced a trap composed of 316 places in 1304 ms of which 13 ms to minimize.
[2024-05-31 23:06:27] [INFO ] Deduced a trap composed of 320 places in 1253 ms of which 13 ms to minimize.
[2024-05-31 23:06:29] [INFO ] Deduced a trap composed of 312 places in 1296 ms of which 14 ms to minimize.
[2024-05-31 23:06:30] [INFO ] Deduced a trap composed of 535 places in 1320 ms of which 13 ms to minimize.
[2024-05-31 23:06:31] [INFO ] Deduced a trap composed of 490 places in 1253 ms of which 13 ms to minimize.
[2024-05-31 23:06:33] [INFO ] Deduced a trap composed of 470 places in 1252 ms of which 13 ms to minimize.
[2024-05-31 23:06:34] [INFO ] Deduced a trap composed of 271 places in 1237 ms of which 13 ms to minimize.
[2024-05-31 23:06:35] [INFO ] Deduced a trap composed of 350 places in 1189 ms of which 12 ms to minimize.
[2024-05-31 23:06:36] [INFO ] Deduced a trap composed of 410 places in 1173 ms of which 12 ms to minimize.
[2024-05-31 23:06:38] [INFO ] Deduced a trap composed of 492 places in 1271 ms of which 12 ms to minimize.
[2024-05-31 23:06:39] [INFO ] Deduced a trap composed of 468 places in 1246 ms of which 12 ms to minimize.
[2024-05-31 23:06:40] [INFO ] Deduced a trap composed of 403 places in 1235 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1986 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 23:06:42] [INFO ] Deduced a trap composed of 298 places in 1301 ms of which 13 ms to minimize.
[2024-05-31 23:06:43] [INFO ] Deduced a trap composed of 333 places in 1307 ms of which 13 ms to minimize.
[2024-05-31 23:06:44] [INFO ] Deduced a trap composed of 518 places in 1262 ms of which 12 ms to minimize.
[2024-05-31 23:06:46] [INFO ] Deduced a trap composed of 409 places in 1303 ms of which 14 ms to minimize.
SMT process timed out in 59614ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 92 out of 2097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2097/2097 places, 3340/3340 transitions.
Applied a total of 0 rules in 106 ms. Remains 2097 /2097 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2097/2097 places, 3340/3340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2097/2097 places, 3340/3340 transitions.
Applied a total of 0 rules in 111 ms. Remains 2097 /2097 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2024-05-31 23:06:46] [INFO ] Flow matrix only has 2967 transitions (discarded 373 similar events)
[2024-05-31 23:06:46] [INFO ] Invariant cache hit.
[2024-05-31 23:06:48] [INFO ] Implicit Places using invariants in 2297 ms returned [4, 7, 10, 11, 12, 13, 14, 15, 16, 17, 22, 28, 37, 48, 60, 74, 89, 104, 105, 106, 107, 108, 109, 110, 111, 123, 133, 141, 147, 151, 154, 171, 177, 181, 182, 185, 186, 188, 193, 197, 204, 213, 228, 240, 253, 266, 268, 269, 270, 271, 272, 273, 283, 291, 297, 301, 303, 305, 325, 332, 336, 337, 338, 339, 340, 341, 342, 344, 346, 353, 360, 368, 378, 392, 403, 404, 405, 406, 407, 408, 409, 410, 418, 424, 428, 430, 432, 434, 452, 458, 461, 462, 463, 464, 465, 466, 468, 470, 475, 478, 483, 489, 497, 507, 516, 517, 518, 519, 520, 521, 522, 523, 529, 533, 535, 537, 540, 542, 560, 567, 570, 572, 573, 575, 576, 577, 582, 586, 588, 591, 596, 602, 609, 616, 617, 618, 619, 622, 623, 624, 630, 632, 634, 636, 638, 640, 658, 665, 668, 670, 671, 672, 674, 675, 679, 681, 683, 685, 687, 691, 699, 704, 705, 706, 707, 708, 709, 710, 711, 713, 715, 717, 719, 721, 723, 741, 747, 750, 751, 752, 753, 754, 755, 756, 757, 759, 761, 763, 765, 767, 769, 772, 775, 776, 777, 778, 779, 780, 782, 786, 790, 792, 794, 796, 814, 820, 825, 826, 827, 828, 829, 830, 831, 835, 837, 839, 841, 843, 845, 847, 850, 851, 852, 853, 854, 855, 856, 857, 859, 861, 863, 865, 867, 869, 886, 888, 891, 894, 895, 896, 897, 898, 899, 900, 901, 903, 905, 907, 909, 911, 913, 915, 918, 919, 920, 921, 922, 923, 924, 925, 927, 930, 932, 934, 936, 938, 955, 961, 964, 965, 966, 967, 968, 969, 971, 973, 975, 977, 981, 983, 985, 987, 990, 991, 992, 993, 994, 995, 996, 997, 999, 1001, 1003, 1005, 1007, 1009, 1027, 1033, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1045, 1047, 1050, 1052, 1054, 1056, 1058, 1062, 1063, 1064, 1065, 1066, 1067, 1069, 1071, 1073, 1075, 1077, 1082, 1084, 1101, 1107, 1110, 1111, 1112, 1113, 1114, 1115, 1117, 1119, 1121, 1123, 1125, 1130, 1132, 1136, 1142, 1143, 1144, 1146, 1147, 1148, 1149, 1154, 1158, 1160, 1162, 1164, 1166, 1185, 1191, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1201, 1203, 1205, 1207, 1209, 1212, 1216, 1222, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1243, 1247, 1250, 1252, 1254, 1256, 1279, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1292, 1294, 1296, 1299, 1304, 1310, 1318, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1343, 1349, 1353, 1355, 1357, 1359, 1376, 1382, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1394, 1396, 1398, 1403, 1410, 1418, 1428, 1440, 1441, 1442, 1443, 1444, 1446, 1447, 1457, 1465, 1471, 1475, 1477, 1481, 1499, 1506, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1518, 1521, 1525, 1532, 1541, 1551, 1563, 1577, 1578, 1579, 1580, 1581, 1583, 1584, 1596, 1606, 1616, 1622, 1626, 1628, 1646, 1648, 1652, 1655, 1656, 1657, 1658, 1659, 1660, 1661, 1662, 1664, 1669, 1676, 1685, 1696, 1708, 1723, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1760, 1772, 1782, 1790, 1797, 1801, 1819]
[2024-05-31 23:06:48] [INFO ] Actually due to overlaps returned [171, 325, 452, 560, 658, 741, 814, 886, 955, 1027, 1101, 1185, 1376, 1499, 1646, 1819, 4, 10, 11, 12, 13, 14, 15, 16, 104, 105, 106, 107, 108, 109, 110, 133, 181, 182, 185, 186, 266, 268, 269, 270, 271, 272, 291, 336, 337, 338, 339, 340, 341, 403, 404, 405, 406, 407, 408, 409, 424, 461, 462, 463, 464, 465, 466, 516, 517, 518, 519, 520, 521, 522, 533, 570, 572, 573, 575, 576, 616, 617, 618, 619, 622, 623, 632, 668, 670, 671, 672, 674, 704, 705, 706, 707, 708, 709, 710, 715, 750, 751, 752, 753, 754, 755, 756, 775, 776, 777, 778, 779, 780, 825, 826, 827, 828, 829, 830, 850, 851, 852, 853, 854, 855, 856, 861, 888, 894, 895, 896, 897, 898, 899, 900, 918, 919, 920, 921, 922, 923, 924, 930, 964, 965, 966, 967, 968, 969, 990, 991, 992, 993, 994, 995, 996, 1001, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1062, 1063, 1064, 1065, 1066, 1067, 1073, 1110, 1111, 1112, 1113, 1114, 1115, 1142, 1143, 1144, 1146, 1147, 1148, 1158, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1353, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1440, 1441, 1442, 1443, 1444, 1446, 1471, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1577, 1578, 1579, 1580, 1581, 1583, 1616, 1648, 1655, 1656, 1657, 1658, 1659, 1660, 1661, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1782]
Discarding 253 places :
Implicit Place search using SMT only with invariants took 2313 ms to find 253 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1844/2097 places, 3340/3340 transitions.
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 205 place count 1639 transition count 3135
Iterating global reduction 0 with 205 rules applied. Total rules applied 410 place count 1639 transition count 3135
Discarding 204 places :
Symmetric choice reduction at 0 with 204 rule applications. Total rules 614 place count 1435 transition count 2931
Iterating global reduction 0 with 204 rules applied. Total rules applied 818 place count 1435 transition count 2931
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 834 place count 1419 transition count 2819
Iterating global reduction 0 with 16 rules applied. Total rules applied 850 place count 1419 transition count 2819
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 851 place count 1419 transition count 2818
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 852 place count 1418 transition count 2818
Applied a total of 852 rules in 287 ms. Remains 1418 /1844 variables (removed 426) and now considering 2818/3340 (removed 522) transitions.
[2024-05-31 23:06:49] [INFO ] Flow matrix only has 2445 transitions (discarded 373 similar events)
// Phase 1: matrix 2445 rows 1418 cols
[2024-05-31 23:06:49] [INFO ] Computed 324 invariants in 48 ms
[2024-05-31 23:06:50] [INFO ] Implicit Places using invariants in 1293 ms returned [6, 9, 14, 20, 29, 40, 52, 66, 81, 96, 108, 125, 131, 135, 138, 160, 167, 172, 176, 183, 192, 207, 219, 232, 246, 256, 269, 273, 275, 277, 293, 297, 299, 301, 308, 315, 323, 333, 347, 357, 365, 374, 376, 378, 380, 390, 394, 396, 401, 404, 409, 415, 423, 433, 442, 448, 453, 455, 458, 460, 472, 477, 482, 486, 488, 491, 496, 502, 509, 518, 524, 527, 529, 531, 533, 546, 551, 555, 557, 559, 561, 563, 567, 575, 579, 581, 584, 586, 588, 590, 601, 603, 605, 607, 609, 611, 613, 615, 618, 622, 626, 630, 632, 634, 636, 646, 651, 655, 657, 659, 661, 663, 665, 667, 669, 671, 674, 676, 678, 680, 687, 689, 691, 693, 695, 697, 699, 701, 703, 705, 707, 711, 713, 715, 717, 725, 729, 731, 733, 735, 739, 741, 743, 745, 747, 749, 752, 754, 756, 758, 768, 770, 772, 774, 777, 779, 781, 783, 785, 790, 792, 795, 797, 802, 804, 813, 817, 819, 821, 823, 825, 830, 832, 836, 843, 848, 853, 855, 857, 859, 871, 873, 875, 877, 879, 881, 884, 888, 894, 901, 907, 911, 914, 916, 918, 920, 929, 931, 934, 936, 938, 941, 946, 952, 960, 969, 977, 983, 988, 990, 992, 1000, 1002, 1004, 1006, 1008, 1013, 1020, 1028, 1038, 1051, 1061, 1069, 1078, 1080, 1084, 1095, 1097, 1099, 1102, 1106, 1113, 1122, 1132, 1144, 1159, 1171, 1181, 1196, 1200, 1202, 1211, 1213, 1215, 1220, 1227, 1236, 1247, 1259, 1274, 1289, 1303, 1315, 1332, 1339, 1343]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 1298 ms to find 256 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1162/2097 places, 2818/3340 transitions.
Applied a total of 0 rules in 64 ms. Remains 1162 /1162 variables (removed 0) and now considering 2818/2818 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4073 ms. Remains : 1162/2097 places, 2818/3340 transitions.
RANDOM walk for 40000 steps (795 resets) in 362 ms. (110 steps per ms) remains 7/8 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (158 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (157 resets) in 145 ms. (273 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (157 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (168 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (148 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (157 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (150 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
[2024-05-31 23:06:50] [INFO ] Flow matrix only has 2445 transitions (discarded 373 similar events)
// Phase 1: matrix 2445 rows 1162 cols
[2024-05-31 23:06:50] [INFO ] Computed 68 invariants in 26 ms
[2024-05-31 23:06:50] [INFO ] State equation strengthened by 1100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1000/1066 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1066 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/1068 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1068 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 77/1145 variables, 32/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1145 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/1157 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1157 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 5/1162 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1162 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2445/3607 variables, 1162/1230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3607 variables, 1100/2330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3607 variables, 0/2330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/3607 variables, 0/2330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3607/3607 variables, and 2330 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3220 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 1162/1162 constraints, ReadFeed: 1100/1100 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1000/1066 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:06:54] [INFO ] Deduced a trap composed of 209 places in 477 ms of which 6 ms to minimize.
[2024-05-31 23:06:55] [INFO ] Deduced a trap composed of 573 places in 478 ms of which 7 ms to minimize.
[2024-05-31 23:06:55] [INFO ] Deduced a trap composed of 550 places in 463 ms of which 7 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 209 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:06:56] [INFO ] Deduced a trap composed of 257 places in 471 ms of which 6 ms to minimize.
[2024-05-31 23:06:57] [INFO ] Deduced a trap composed of 227 places in 439 ms of which 6 ms to minimize.
[2024-05-31 23:06:57] [INFO ] Deduced a trap composed of 192 places in 460 ms of which 7 ms to minimize.
[2024-05-31 23:06:58] [INFO ] Deduced a trap composed of 301 places in 451 ms of which 6 ms to minimize.
[2024-05-31 23:06:58] [INFO ] Deduced a trap composed of 241 places in 489 ms of which 7 ms to minimize.
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 254 places in 474 ms of which 6 ms to minimize.
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 245 places in 503 ms of which 7 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 568 places in 499 ms of which 7 ms to minimize.
[2024-05-31 23:07:00] [INFO ] Deduced a trap composed of 245 places in 493 ms of which 7 ms to minimize.
[2024-05-31 23:07:01] [INFO ] Deduced a trap composed of 274 places in 482 ms of which 7 ms to minimize.
[2024-05-31 23:07:01] [INFO ] Deduced a trap composed of 234 places in 464 ms of which 6 ms to minimize.
[2024-05-31 23:07:02] [INFO ] Deduced a trap composed of 256 places in 458 ms of which 7 ms to minimize.
[2024-05-31 23:07:02] [INFO ] Deduced a trap composed of 256 places in 451 ms of which 6 ms to minimize.
[2024-05-31 23:07:03] [INFO ] Deduced a trap composed of 194 places in 454 ms of which 6 ms to minimize.
[2024-05-31 23:07:03] [INFO ] Deduced a trap composed of 219 places in 479 ms of which 7 ms to minimize.
[2024-05-31 23:07:04] [INFO ] Deduced a trap composed of 547 places in 445 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1066 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:07:04] [INFO ] Deduced a trap composed of 502 places in 511 ms of which 6 ms to minimize.
[2024-05-31 23:07:05] [INFO ] Deduced a trap composed of 237 places in 500 ms of which 7 ms to minimize.
[2024-05-31 23:07:05] [INFO ] Deduced a trap composed of 245 places in 501 ms of which 7 ms to minimize.
[2024-05-31 23:07:06] [INFO ] Deduced a trap composed of 215 places in 489 ms of which 7 ms to minimize.
[2024-05-31 23:07:06] [INFO ] Deduced a trap composed of 201 places in 500 ms of which 7 ms to minimize.
[2024-05-31 23:07:07] [INFO ] Deduced a trap composed of 204 places in 509 ms of which 7 ms to minimize.
[2024-05-31 23:07:07] [INFO ] Deduced a trap composed of 503 places in 460 ms of which 6 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 507 places in 497 ms of which 7 ms to minimize.
[2024-05-31 23:07:08] [INFO ] Deduced a trap composed of 295 places in 481 ms of which 7 ms to minimize.
[2024-05-31 23:07:09] [INFO ] Deduced a trap composed of 187 places in 476 ms of which 6 ms to minimize.
[2024-05-31 23:07:09] [INFO ] Deduced a trap composed of 508 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:07:10] [INFO ] Deduced a trap composed of 219 places in 493 ms of which 18 ms to minimize.
[2024-05-31 23:07:10] [INFO ] Deduced a trap composed of 241 places in 471 ms of which 6 ms to minimize.
[2024-05-31 23:07:11] [INFO ] Deduced a trap composed of 513 places in 454 ms of which 7 ms to minimize.
[2024-05-31 23:07:11] [INFO ] Deduced a trap composed of 217 places in 516 ms of which 7 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 569 places in 458 ms of which 7 ms to minimize.
[2024-05-31 23:07:12] [INFO ] Deduced a trap composed of 261 places in 504 ms of which 7 ms to minimize.
[2024-05-31 23:07:13] [INFO ] Deduced a trap composed of 250 places in 498 ms of which 7 ms to minimize.
[2024-05-31 23:07:13] [INFO ] Deduced a trap composed of 223 places in 506 ms of which 7 ms to minimize.
[2024-05-31 23:07:14] [INFO ] Deduced a trap composed of 215 places in 504 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:07:14] [INFO ] Deduced a trap composed of 274 places in 117 ms of which 3 ms to minimize.
[2024-05-31 23:07:14] [INFO ] Deduced a trap composed of 202 places in 455 ms of which 6 ms to minimize.
[2024-05-31 23:07:15] [INFO ] Deduced a trap composed of 213 places in 455 ms of which 7 ms to minimize.
[2024-05-31 23:07:15] [INFO ] Deduced a trap composed of 339 places in 221 ms of which 4 ms to minimize.
[2024-05-31 23:07:16] [INFO ] Deduced a trap composed of 210 places in 497 ms of which 6 ms to minimize.
[2024-05-31 23:07:16] [INFO ] Deduced a trap composed of 353 places in 218 ms of which 4 ms to minimize.
[2024-05-31 23:07:17] [INFO ] Deduced a trap composed of 348 places in 470 ms of which 6 ms to minimize.
[2024-05-31 23:07:17] [INFO ] Deduced a trap composed of 374 places in 460 ms of which 6 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 348 places in 474 ms of which 6 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 211 places in 488 ms of which 7 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 704 places in 423 ms of which 6 ms to minimize.
[2024-05-31 23:07:19] [INFO ] Deduced a trap composed of 273 places in 479 ms of which 7 ms to minimize.
[2024-05-31 23:07:19] [INFO ] Deduced a trap composed of 447 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:07:20] [INFO ] Deduced a trap composed of 597 places in 452 ms of which 7 ms to minimize.
[2024-05-31 23:07:20] [INFO ] Deduced a trap composed of 296 places in 490 ms of which 7 ms to minimize.
[2024-05-31 23:07:21] [INFO ] Deduced a trap composed of 186 places in 509 ms of which 6 ms to minimize.
[2024-05-31 23:07:21] [INFO ] Deduced a trap composed of 611 places in 443 ms of which 6 ms to minimize.
[2024-05-31 23:07:22] [INFO ] Deduced a trap composed of 643 places in 500 ms of which 6 ms to minimize.
[2024-05-31 23:07:22] [INFO ] Deduced a trap composed of 238 places in 474 ms of which 7 ms to minimize.
[2024-05-31 23:07:23] [INFO ] Deduced a trap composed of 615 places in 429 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:07:24] [INFO ] Deduced a trap composed of 197 places in 507 ms of which 7 ms to minimize.
[2024-05-31 23:07:24] [INFO ] Deduced a trap composed of 200 places in 509 ms of which 6 ms to minimize.
[2024-05-31 23:07:25] [INFO ] Deduced a trap composed of 601 places in 445 ms of which 6 ms to minimize.
[2024-05-31 23:07:25] [INFO ] Deduced a trap composed of 218 places in 488 ms of which 7 ms to minimize.
[2024-05-31 23:07:26] [INFO ] Deduced a trap composed of 202 places in 516 ms of which 6 ms to minimize.
[2024-05-31 23:07:26] [INFO ] Deduced a trap composed of 199 places in 462 ms of which 6 ms to minimize.
[2024-05-31 23:07:27] [INFO ] Deduced a trap composed of 223 places in 501 ms of which 6 ms to minimize.
[2024-05-31 23:07:27] [INFO ] Deduced a trap composed of 236 places in 494 ms of which 7 ms to minimize.
[2024-05-31 23:07:28] [INFO ] Deduced a trap composed of 701 places in 425 ms of which 6 ms to minimize.
[2024-05-31 23:07:28] [INFO ] Deduced a trap composed of 267 places in 461 ms of which 6 ms to minimize.
[2024-05-31 23:07:29] [INFO ] Deduced a trap composed of 234 places in 462 ms of which 7 ms to minimize.
[2024-05-31 23:07:29] [INFO ] Deduced a trap composed of 658 places in 412 ms of which 6 ms to minimize.
[2024-05-31 23:07:30] [INFO ] Deduced a trap composed of 565 places in 418 ms of which 6 ms to minimize.
[2024-05-31 23:07:30] [INFO ] Deduced a trap composed of 190 places in 471 ms of which 6 ms to minimize.
[2024-05-31 23:07:31] [INFO ] Deduced a trap composed of 251 places in 479 ms of which 7 ms to minimize.
[2024-05-31 23:07:31] [INFO ] Deduced a trap composed of 205 places in 462 ms of which 7 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 241 places in 475 ms of which 7 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 612 places in 423 ms of which 6 ms to minimize.
[2024-05-31 23:07:33] [INFO ] Deduced a trap composed of 694 places in 413 ms of which 6 ms to minimize.
[2024-05-31 23:07:33] [INFO ] Deduced a trap composed of 253 places in 454 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:07:34] [INFO ] Deduced a trap composed of 252 places in 504 ms of which 7 ms to minimize.
[2024-05-31 23:07:34] [INFO ] Deduced a trap composed of 541 places in 409 ms of which 6 ms to minimize.
[2024-05-31 23:07:35] [INFO ] Deduced a trap composed of 541 places in 450 ms of which 6 ms to minimize.
[2024-05-31 23:07:35] [INFO ] Deduced a trap composed of 171 places in 457 ms of which 7 ms to minimize.
[2024-05-31 23:07:36] [INFO ] Deduced a trap composed of 732 places in 404 ms of which 6 ms to minimize.
[2024-05-31 23:07:36] [INFO ] Deduced a trap composed of 223 places in 470 ms of which 8 ms to minimize.
[2024-05-31 23:07:37] [INFO ] Deduced a trap composed of 708 places in 445 ms of which 6 ms to minimize.
[2024-05-31 23:07:37] [INFO ] Deduced a trap composed of 233 places in 477 ms of which 6 ms to minimize.
[2024-05-31 23:07:38] [INFO ] Deduced a trap composed of 563 places in 457 ms of which 6 ms to minimize.
[2024-05-31 23:07:38] [INFO ] Deduced a trap composed of 228 places in 498 ms of which 6 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 603 places in 482 ms of which 7 ms to minimize.
[2024-05-31 23:07:39] [INFO ] Deduced a trap composed of 271 places in 473 ms of which 6 ms to minimize.
[2024-05-31 23:07:40] [INFO ] Deduced a trap composed of 190 places in 483 ms of which 7 ms to minimize.
[2024-05-31 23:07:40] [INFO ] Deduced a trap composed of 222 places in 492 ms of which 7 ms to minimize.
[2024-05-31 23:07:41] [INFO ] Deduced a trap composed of 646 places in 427 ms of which 6 ms to minimize.
[2024-05-31 23:07:41] [INFO ] Deduced a trap composed of 572 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:07:42] [INFO ] Deduced a trap composed of 279 places in 469 ms of which 7 ms to minimize.
[2024-05-31 23:07:42] [INFO ] Deduced a trap composed of 578 places in 407 ms of which 6 ms to minimize.
[2024-05-31 23:07:42] [INFO ] Deduced a trap composed of 208 places in 451 ms of which 6 ms to minimize.
[2024-05-31 23:07:43] [INFO ] Deduced a trap composed of 707 places in 416 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1066 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:07:43] [INFO ] Deduced a trap composed of 186 places in 459 ms of which 7 ms to minimize.
[2024-05-31 23:07:44] [INFO ] Deduced a trap composed of 632 places in 419 ms of which 6 ms to minimize.
[2024-05-31 23:07:44] [INFO ] Deduced a trap composed of 249 places in 472 ms of which 7 ms to minimize.
[2024-05-31 23:07:45] [INFO ] Deduced a trap composed of 232 places in 456 ms of which 6 ms to minimize.
[2024-05-31 23:07:45] [INFO ] Deduced a trap composed of 231 places in 476 ms of which 7 ms to minimize.
[2024-05-31 23:07:46] [INFO ] Deduced a trap composed of 247 places in 466 ms of which 6 ms to minimize.
[2024-05-31 23:07:46] [INFO ] Deduced a trap composed of 636 places in 443 ms of which 7 ms to minimize.
[2024-05-31 23:07:47] [INFO ] Deduced a trap composed of 312 places in 454 ms of which 6 ms to minimize.
[2024-05-31 23:07:47] [INFO ] Deduced a trap composed of 826 places in 463 ms of which 6 ms to minimize.
[2024-05-31 23:07:48] [INFO ] Deduced a trap composed of 270 places in 507 ms of which 7 ms to minimize.
[2024-05-31 23:07:48] [INFO ] Deduced a trap composed of 185 places in 470 ms of which 7 ms to minimize.
[2024-05-31 23:07:49] [INFO ] Deduced a trap composed of 683 places in 411 ms of which 6 ms to minimize.
[2024-05-31 23:07:49] [INFO ] Deduced a trap composed of 686 places in 409 ms of which 6 ms to minimize.
[2024-05-31 23:07:50] [INFO ] Deduced a trap composed of 684 places in 435 ms of which 6 ms to minimize.
[2024-05-31 23:07:50] [INFO ] Deduced a trap composed of 166 places in 496 ms of which 6 ms to minimize.
[2024-05-31 23:07:51] [INFO ] Deduced a trap composed of 620 places in 474 ms of which 7 ms to minimize.
[2024-05-31 23:07:51] [INFO ] Deduced a trap composed of 180 places in 477 ms of which 6 ms to minimize.
[2024-05-31 23:07:52] [INFO ] Deduced a trap composed of 850 places in 414 ms of which 6 ms to minimize.
[2024-05-31 23:07:52] [INFO ] Deduced a trap composed of 589 places in 436 ms of which 6 ms to minimize.
[2024-05-31 23:07:53] [INFO ] Deduced a trap composed of 216 places in 492 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1066 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:07:54] [INFO ] Deduced a trap composed of 294 places in 517 ms of which 6 ms to minimize.
[2024-05-31 23:07:54] [INFO ] Deduced a trap composed of 240 places in 509 ms of which 7 ms to minimize.
[2024-05-31 23:07:55] [INFO ] Deduced a trap composed of 678 places in 451 ms of which 6 ms to minimize.
[2024-05-31 23:07:55] [INFO ] Deduced a trap composed of 219 places in 498 ms of which 6 ms to minimize.
[2024-05-31 23:07:56] [INFO ] Deduced a trap composed of 656 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:07:56] [INFO ] Deduced a trap composed of 600 places in 441 ms of which 7 ms to minimize.
[2024-05-31 23:07:57] [INFO ] Deduced a trap composed of 252 places in 519 ms of which 7 ms to minimize.
[2024-05-31 23:07:57] [INFO ] Deduced a trap composed of 606 places in 487 ms of which 7 ms to minimize.
[2024-05-31 23:07:58] [INFO ] Deduced a trap composed of 178 places in 482 ms of which 7 ms to minimize.
[2024-05-31 23:07:58] [INFO ] Deduced a trap composed of 254 places in 475 ms of which 7 ms to minimize.
[2024-05-31 23:07:59] [INFO ] Deduced a trap composed of 247 places in 458 ms of which 7 ms to minimize.
[2024-05-31 23:07:59] [INFO ] Deduced a trap composed of 683 places in 426 ms of which 6 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 655 places in 468 ms of which 6 ms to minimize.
[2024-05-31 23:08:00] [INFO ] Deduced a trap composed of 683 places in 492 ms of which 7 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 687 places in 488 ms of which 7 ms to minimize.
[2024-05-31 23:08:01] [INFO ] Deduced a trap composed of 212 places in 492 ms of which 7 ms to minimize.
[2024-05-31 23:08:02] [INFO ] Deduced a trap composed of 618 places in 494 ms of which 7 ms to minimize.
[2024-05-31 23:08:02] [INFO ] Deduced a trap composed of 290 places in 486 ms of which 6 ms to minimize.
[2024-05-31 23:08:03] [INFO ] Deduced a trap composed of 688 places in 442 ms of which 7 ms to minimize.
[2024-05-31 23:08:03] [INFO ] Deduced a trap composed of 170 places in 482 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1066 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:08:04] [INFO ] Deduced a trap composed of 341 places in 460 ms of which 6 ms to minimize.
[2024-05-31 23:08:05] [INFO ] Deduced a trap composed of 885 places in 425 ms of which 7 ms to minimize.
[2024-05-31 23:08:05] [INFO ] Deduced a trap composed of 378 places in 489 ms of which 7 ms to minimize.
[2024-05-31 23:08:06] [INFO ] Deduced a trap composed of 888 places in 435 ms of which 6 ms to minimize.
[2024-05-31 23:08:06] [INFO ] Deduced a trap composed of 246 places in 473 ms of which 6 ms to minimize.
[2024-05-31 23:08:07] [INFO ] Deduced a trap composed of 208 places in 471 ms of which 7 ms to minimize.
[2024-05-31 23:08:07] [INFO ] Deduced a trap composed of 652 places in 416 ms of which 6 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 262 places in 483 ms of which 6 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 244 places in 486 ms of which 7 ms to minimize.
[2024-05-31 23:08:08] [INFO ] Deduced a trap composed of 687 places in 426 ms of which 6 ms to minimize.
[2024-05-31 23:08:09] [INFO ] Deduced a trap composed of 207 places in 473 ms of which 7 ms to minimize.
SMT process timed out in 78737ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 1162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1162/1162 places, 2818/2818 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1162 transition count 2815
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1159 transition count 2815
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1159 transition count 2812
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1156 transition count 2812
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 19 place count 1149 transition count 2781
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 1149 transition count 2781
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 1149 transition count 2780
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 1148 transition count 2780
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 1145 transition count 2759
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 1145 transition count 2759
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 1143 transition count 2757
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 1143 transition count 2750
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 52 place count 1136 transition count 2750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 1135 transition count 2749
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 1135 transition count 2749
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 1134 transition count 2742
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 1134 transition count 2742
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 1134 transition count 2742
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 1132 transition count 2740
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1132 transition count 2740
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 1131 transition count 2733
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 1131 transition count 2733
Applied a total of 66 rules in 465 ms. Remains 1131 /1162 variables (removed 31) and now considering 2733/2818 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 1131/1162 places, 2733/2818 transitions.
RANDOM walk for 40000 steps (816 resets) in 411 ms. (97 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (126 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (126 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (126 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (140 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (110 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (124 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (112 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 64289 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 7
Probabilistic random walk after 64289 steps, saw 27800 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 23:08:13] [INFO ] Flow matrix only has 2356 transitions (discarded 377 similar events)
// Phase 1: matrix 2356 rows 1131 cols
[2024-05-31 23:08:13] [INFO ] Computed 68 invariants in 22 ms
[2024-05-31 23:08:13] [INFO ] State equation strengthened by 1046 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 975/1041 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/1043 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1043 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 71/1114 variables, 32/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1114 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/1126 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1126 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 5/1131 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2356/3487 variables, 1131/1199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3487 variables, 1046/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3487 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/3487 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3487/3487 variables, and 2245 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3219 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 1131/1131 constraints, ReadFeed: 1046/1046 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 975/1041 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:08:17] [INFO ] Deduced a trap composed of 257 places in 451 ms of which 6 ms to minimize.
[2024-05-31 23:08:17] [INFO ] Deduced a trap composed of 556 places in 443 ms of which 6 ms to minimize.
[2024-05-31 23:08:18] [INFO ] Deduced a trap composed of 233 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:08:18] [INFO ] Deduced a trap composed of 239 places in 465 ms of which 6 ms to minimize.
[2024-05-31 23:08:19] [INFO ] Deduced a trap composed of 269 places in 463 ms of which 6 ms to minimize.
[2024-05-31 23:08:19] [INFO ] Deduced a trap composed of 506 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:08:20] [INFO ] Deduced a trap composed of 559 places in 448 ms of which 6 ms to minimize.
[2024-05-31 23:08:20] [INFO ] Deduced a trap composed of 557 places in 474 ms of which 7 ms to minimize.
[2024-05-31 23:08:21] [INFO ] Deduced a trap composed of 232 places in 469 ms of which 7 ms to minimize.
[2024-05-31 23:08:21] [INFO ] Deduced a trap composed of 233 places in 458 ms of which 7 ms to minimize.
[2024-05-31 23:08:22] [INFO ] Deduced a trap composed of 234 places in 459 ms of which 7 ms to minimize.
[2024-05-31 23:08:22] [INFO ] Deduced a trap composed of 203 places in 448 ms of which 6 ms to minimize.
[2024-05-31 23:08:23] [INFO ] Deduced a trap composed of 221 places in 444 ms of which 7 ms to minimize.
[2024-05-31 23:08:23] [INFO ] Deduced a trap composed of 560 places in 386 ms of which 6 ms to minimize.
[2024-05-31 23:08:23] [INFO ] Deduced a trap composed of 176 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:08:24] [INFO ] Deduced a trap composed of 181 places in 444 ms of which 7 ms to minimize.
[2024-05-31 23:08:24] [INFO ] Deduced a trap composed of 199 places in 438 ms of which 6 ms to minimize.
[2024-05-31 23:08:25] [INFO ] Deduced a trap composed of 171 places in 444 ms of which 6 ms to minimize.
[2024-05-31 23:08:25] [INFO ] Deduced a trap composed of 189 places in 450 ms of which 6 ms to minimize.
[2024-05-31 23:08:26] [INFO ] Deduced a trap composed of 162 places in 453 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1041 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:08:26] [INFO ] Deduced a trap composed of 217 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 590 places in 437 ms of which 6 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 195 places in 432 ms of which 6 ms to minimize.
[2024-05-31 23:08:28] [INFO ] Deduced a trap composed of 190 places in 431 ms of which 6 ms to minimize.
[2024-05-31 23:08:28] [INFO ] Deduced a trap composed of 163 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:08:29] [INFO ] Deduced a trap composed of 187 places in 451 ms of which 6 ms to minimize.
[2024-05-31 23:08:29] [INFO ] Deduced a trap composed of 223 places in 472 ms of which 7 ms to minimize.
[2024-05-31 23:08:29] [INFO ] Deduced a trap composed of 274 places in 119 ms of which 3 ms to minimize.
[2024-05-31 23:08:30] [INFO ] Deduced a trap composed of 182 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:08:30] [INFO ] Deduced a trap composed of 256 places in 432 ms of which 7 ms to minimize.
[2024-05-31 23:08:31] [INFO ] Deduced a trap composed of 182 places in 451 ms of which 9 ms to minimize.
[2024-05-31 23:08:31] [INFO ] Deduced a trap composed of 227 places in 455 ms of which 6 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 195 places in 443 ms of which 6 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 347 places in 215 ms of which 4 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 195 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:08:33] [INFO ] Deduced a trap composed of 368 places in 195 ms of which 4 ms to minimize.
[2024-05-31 23:08:33] [INFO ] Deduced a trap composed of 190 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:08:33] [INFO ] Deduced a trap composed of 342 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:08:34] [INFO ] Deduced a trap composed of 593 places in 407 ms of which 5 ms to minimize.
[2024-05-31 23:08:34] [INFO ] Deduced a trap composed of 666 places in 436 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1041 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:08:35] [INFO ] Deduced a trap composed of 156 places in 449 ms of which 6 ms to minimize.
[2024-05-31 23:08:35] [INFO ] Deduced a trap composed of 632 places in 437 ms of which 6 ms to minimize.
[2024-05-31 23:08:36] [INFO ] Deduced a trap composed of 194 places in 444 ms of which 7 ms to minimize.
[2024-05-31 23:08:36] [INFO ] Deduced a trap composed of 211 places in 451 ms of which 6 ms to minimize.
[2024-05-31 23:08:37] [INFO ] Deduced a trap composed of 196 places in 445 ms of which 6 ms to minimize.
[2024-05-31 23:08:37] [INFO ] Deduced a trap composed of 275 places in 463 ms of which 7 ms to minimize.
[2024-05-31 23:08:38] [INFO ] Deduced a trap composed of 203 places in 440 ms of which 6 ms to minimize.
[2024-05-31 23:08:38] [INFO ] Deduced a trap composed of 182 places in 444 ms of which 7 ms to minimize.
[2024-05-31 23:08:39] [INFO ] Deduced a trap composed of 290 places in 473 ms of which 7 ms to minimize.
[2024-05-31 23:08:39] [INFO ] Deduced a trap composed of 264 places in 492 ms of which 6 ms to minimize.
[2024-05-31 23:08:40] [INFO ] Deduced a trap composed of 201 places in 477 ms of which 6 ms to minimize.
[2024-05-31 23:08:40] [INFO ] Deduced a trap composed of 194 places in 435 ms of which 6 ms to minimize.
[2024-05-31 23:08:41] [INFO ] Deduced a trap composed of 209 places in 432 ms of which 6 ms to minimize.
[2024-05-31 23:08:41] [INFO ] Deduced a trap composed of 267 places in 459 ms of which 6 ms to minimize.
[2024-05-31 23:08:42] [INFO ] Deduced a trap composed of 227 places in 450 ms of which 6 ms to minimize.
[2024-05-31 23:08:42] [INFO ] Deduced a trap composed of 286 places in 447 ms of which 7 ms to minimize.
[2024-05-31 23:08:42] [INFO ] Deduced a trap composed of 192 places in 450 ms of which 6 ms to minimize.
[2024-05-31 23:08:43] [INFO ] Deduced a trap composed of 237 places in 452 ms of which 6 ms to minimize.
[2024-05-31 23:08:43] [INFO ] Deduced a trap composed of 192 places in 474 ms of which 6 ms to minimize.
[2024-05-31 23:08:44] [INFO ] Deduced a trap composed of 258 places in 460 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1041 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:08:45] [INFO ] Deduced a trap composed of 293 places in 486 ms of which 6 ms to minimize.
[2024-05-31 23:08:45] [INFO ] Deduced a trap composed of 261 places in 475 ms of which 7 ms to minimize.
[2024-05-31 23:08:46] [INFO ] Deduced a trap composed of 441 places in 457 ms of which 6 ms to minimize.
[2024-05-31 23:08:46] [INFO ] Deduced a trap composed of 683 places in 405 ms of which 6 ms to minimize.
[2024-05-31 23:08:47] [INFO ] Deduced a trap composed of 213 places in 477 ms of which 7 ms to minimize.
[2024-05-31 23:08:47] [INFO ] Deduced a trap composed of 627 places in 420 ms of which 6 ms to minimize.
[2024-05-31 23:08:48] [INFO ] Deduced a trap composed of 209 places in 446 ms of which 6 ms to minimize.
[2024-05-31 23:08:48] [INFO ] Deduced a trap composed of 213 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:08:48] [INFO ] Deduced a trap composed of 715 places in 402 ms of which 6 ms to minimize.
[2024-05-31 23:08:49] [INFO ] Deduced a trap composed of 190 places in 445 ms of which 6 ms to minimize.
[2024-05-31 23:08:49] [INFO ] Deduced a trap composed of 170 places in 452 ms of which 6 ms to minimize.
[2024-05-31 23:08:50] [INFO ] Deduced a trap composed of 628 places in 416 ms of which 7 ms to minimize.
[2024-05-31 23:08:50] [INFO ] Deduced a trap composed of 188 places in 437 ms of which 6 ms to minimize.
[2024-05-31 23:08:51] [INFO ] Deduced a trap composed of 664 places in 402 ms of which 6 ms to minimize.
[2024-05-31 23:08:51] [INFO ] Deduced a trap composed of 185 places in 435 ms of which 7 ms to minimize.
[2024-05-31 23:08:52] [INFO ] Deduced a trap composed of 633 places in 388 ms of which 6 ms to minimize.
[2024-05-31 23:08:52] [INFO ] Deduced a trap composed of 580 places in 416 ms of which 6 ms to minimize.
[2024-05-31 23:08:53] [INFO ] Deduced a trap composed of 254 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:08:53] [INFO ] Deduced a trap composed of 577 places in 407 ms of which 6 ms to minimize.
[2024-05-31 23:08:53] [INFO ] Deduced a trap composed of 259 places in 428 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:08:54] [INFO ] Deduced a trap composed of 151 places in 454 ms of which 6 ms to minimize.
[2024-05-31 23:08:54] [INFO ] Deduced a trap composed of 623 places in 396 ms of which 6 ms to minimize.
[2024-05-31 23:08:55] [INFO ] Deduced a trap composed of 251 places in 430 ms of which 6 ms to minimize.
[2024-05-31 23:08:55] [INFO ] Deduced a trap composed of 210 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:08:56] [INFO ] Deduced a trap composed of 217 places in 422 ms of which 6 ms to minimize.
[2024-05-31 23:08:56] [INFO ] Deduced a trap composed of 205 places in 431 ms of which 6 ms to minimize.
[2024-05-31 23:08:57] [INFO ] Deduced a trap composed of 292 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:08:57] [INFO ] Deduced a trap composed of 255 places in 437 ms of which 6 ms to minimize.
[2024-05-31 23:08:58] [INFO ] Deduced a trap composed of 217 places in 430 ms of which 5 ms to minimize.
[2024-05-31 23:08:58] [INFO ] Deduced a trap composed of 193 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:08:59] [INFO ] Deduced a trap composed of 622 places in 406 ms of which 5 ms to minimize.
[2024-05-31 23:08:59] [INFO ] Deduced a trap composed of 191 places in 463 ms of which 6 ms to minimize.
[2024-05-31 23:09:00] [INFO ] Deduced a trap composed of 628 places in 410 ms of which 6 ms to minimize.
[2024-05-31 23:09:00] [INFO ] Deduced a trap composed of 194 places in 445 ms of which 6 ms to minimize.
[2024-05-31 23:09:00] [INFO ] Deduced a trap composed of 512 places in 405 ms of which 5 ms to minimize.
[2024-05-31 23:09:01] [INFO ] Deduced a trap composed of 210 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:09:01] [INFO ] Deduced a trap composed of 569 places in 399 ms of which 6 ms to minimize.
[2024-05-31 23:09:02] [INFO ] Deduced a trap composed of 547 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:09:02] [INFO ] Deduced a trap composed of 207 places in 450 ms of which 6 ms to minimize.
[2024-05-31 23:09:03] [INFO ] Deduced a trap composed of 603 places in 384 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:09:03] [INFO ] Deduced a trap composed of 654 places in 411 ms of which 6 ms to minimize.
[2024-05-31 23:09:04] [INFO ] Deduced a trap composed of 169 places in 448 ms of which 8 ms to minimize.
[2024-05-31 23:09:04] [INFO ] Deduced a trap composed of 634 places in 438 ms of which 6 ms to minimize.
[2024-05-31 23:09:05] [INFO ] Deduced a trap composed of 227 places in 456 ms of which 6 ms to minimize.
[2024-05-31 23:09:05] [INFO ] Deduced a trap composed of 706 places in 423 ms of which 6 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 550 places in 445 ms of which 5 ms to minimize.
[2024-05-31 23:09:06] [INFO ] Deduced a trap composed of 553 places in 456 ms of which 6 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 170 places in 431 ms of which 6 ms to minimize.
[2024-05-31 23:09:07] [INFO ] Deduced a trap composed of 605 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 273 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:09:08] [INFO ] Deduced a trap composed of 711 places in 396 ms of which 6 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 609 places in 446 ms of which 6 ms to minimize.
[2024-05-31 23:09:09] [INFO ] Deduced a trap composed of 171 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:09:10] [INFO ] Deduced a trap composed of 251 places in 439 ms of which 7 ms to minimize.
[2024-05-31 23:09:10] [INFO ] Deduced a trap composed of 581 places in 447 ms of which 7 ms to minimize.
[2024-05-31 23:09:10] [INFO ] Deduced a trap composed of 277 places in 421 ms of which 6 ms to minimize.
[2024-05-31 23:09:11] [INFO ] Deduced a trap composed of 170 places in 449 ms of which 6 ms to minimize.
[2024-05-31 23:09:11] [INFO ] Deduced a trap composed of 871 places in 437 ms of which 6 ms to minimize.
[2024-05-31 23:09:12] [INFO ] Deduced a trap composed of 196 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:09:12] [INFO ] Deduced a trap composed of 261 places in 422 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1041 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:09:13] [INFO ] Deduced a trap composed of 209 places in 427 ms of which 7 ms to minimize.
[2024-05-31 23:09:14] [INFO ] Deduced a trap composed of 205 places in 431 ms of which 6 ms to minimize.
[2024-05-31 23:09:14] [INFO ] Deduced a trap composed of 585 places in 392 ms of which 6 ms to minimize.
[2024-05-31 23:09:14] [INFO ] Deduced a trap composed of 171 places in 451 ms of which 6 ms to minimize.
[2024-05-31 23:09:15] [INFO ] Deduced a trap composed of 665 places in 398 ms of which 6 ms to minimize.
[2024-05-31 23:09:15] [INFO ] Deduced a trap composed of 206 places in 438 ms of which 6 ms to minimize.
[2024-05-31 23:09:16] [INFO ] Deduced a trap composed of 667 places in 394 ms of which 5 ms to minimize.
[2024-05-31 23:09:16] [INFO ] Deduced a trap composed of 218 places in 463 ms of which 7 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 668 places in 391 ms of which 6 ms to minimize.
[2024-05-31 23:09:17] [INFO ] Deduced a trap composed of 707 places in 392 ms of which 6 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 708 places in 383 ms of which 5 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 192 places in 438 ms of which 6 ms to minimize.
[2024-05-31 23:09:18] [INFO ] Deduced a trap composed of 713 places in 409 ms of which 6 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 868 places in 381 ms of which 6 ms to minimize.
[2024-05-31 23:09:19] [INFO ] Deduced a trap composed of 864 places in 390 ms of which 5 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 603 places in 407 ms of which 6 ms to minimize.
[2024-05-31 23:09:20] [INFO ] Deduced a trap composed of 817 places in 387 ms of which 6 ms to minimize.
[2024-05-31 23:09:21] [INFO ] Deduced a trap composed of 605 places in 444 ms of which 6 ms to minimize.
[2024-05-31 23:09:21] [INFO ] Deduced a trap composed of 257 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:09:21] [INFO ] Deduced a trap composed of 867 places in 412 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1041 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:09:22] [INFO ] Deduced a trap composed of 193 places in 432 ms of which 6 ms to minimize.
[2024-05-31 23:09:23] [INFO ] Deduced a trap composed of 869 places in 386 ms of which 6 ms to minimize.
[2024-05-31 23:09:23] [INFO ] Deduced a trap composed of 872 places in 386 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1041 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:09:24] [INFO ] Deduced a trap composed of 638 places in 411 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1041 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1041 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/1043 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1043 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 71/1114 variables, 32/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:09:25] [INFO ] Deduced a trap composed of 212 places in 538 ms of which 7 ms to minimize.
[2024-05-31 23:09:26] [INFO ] Deduced a trap composed of 223 places in 533 ms of which 19 ms to minimize.
[2024-05-31 23:09:26] [INFO ] Deduced a trap composed of 217 places in 511 ms of which 7 ms to minimize.
[2024-05-31 23:09:27] [INFO ] Deduced a trap composed of 220 places in 504 ms of which 7 ms to minimize.
[2024-05-31 23:09:27] [INFO ] Deduced a trap composed of 5 places in 501 ms of which 7 ms to minimize.
[2024-05-31 23:09:28] [INFO ] Deduced a trap composed of 213 places in 520 ms of which 6 ms to minimize.
[2024-05-31 23:09:28] [INFO ] Deduced a trap composed of 242 places in 500 ms of which 7 ms to minimize.
[2024-05-31 23:09:29] [INFO ] Deduced a trap composed of 214 places in 487 ms of which 7 ms to minimize.
[2024-05-31 23:09:29] [INFO ] Deduced a trap composed of 265 places in 510 ms of which 7 ms to minimize.
[2024-05-31 23:09:30] [INFO ] Deduced a trap composed of 251 places in 495 ms of which 7 ms to minimize.
[2024-05-31 23:09:30] [INFO ] Deduced a trap composed of 315 places in 499 ms of which 7 ms to minimize.
[2024-05-31 23:09:31] [INFO ] Deduced a trap composed of 247 places in 529 ms of which 6 ms to minimize.
[2024-05-31 23:09:31] [INFO ] Deduced a trap composed of 258 places in 505 ms of which 7 ms to minimize.
[2024-05-31 23:09:32] [INFO ] Deduced a trap composed of 231 places in 506 ms of which 6 ms to minimize.
[2024-05-31 23:09:33] [INFO ] Deduced a trap composed of 146 places in 535 ms of which 7 ms to minimize.
[2024-05-31 23:09:33] [INFO ] Deduced a trap composed of 203 places in 502 ms of which 7 ms to minimize.
[2024-05-31 23:09:34] [INFO ] Deduced a trap composed of 163 places in 509 ms of which 7 ms to minimize.
[2024-05-31 23:09:34] [INFO ] Deduced a trap composed of 128 places in 531 ms of which 7 ms to minimize.
[2024-05-31 23:09:35] [INFO ] Deduced a trap composed of 162 places in 519 ms of which 7 ms to minimize.
[2024-05-31 23:09:35] [INFO ] Deduced a trap composed of 171 places in 536 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1114 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:09:36] [INFO ] Deduced a trap composed of 144 places in 493 ms of which 6 ms to minimize.
[2024-05-31 23:09:37] [INFO ] Deduced a trap composed of 152 places in 523 ms of which 7 ms to minimize.
[2024-05-31 23:09:37] [INFO ] Deduced a trap composed of 144 places in 527 ms of which 7 ms to minimize.
[2024-05-31 23:09:38] [INFO ] Deduced a trap composed of 151 places in 499 ms of which 6 ms to minimize.
[2024-05-31 23:09:38] [INFO ] Deduced a trap composed of 151 places in 500 ms of which 7 ms to minimize.
[2024-05-31 23:09:39] [INFO ] Deduced a trap composed of 166 places in 499 ms of which 7 ms to minimize.
[2024-05-31 23:09:39] [INFO ] Deduced a trap composed of 144 places in 496 ms of which 7 ms to minimize.
[2024-05-31 23:09:40] [INFO ] Deduced a trap composed of 176 places in 490 ms of which 10 ms to minimize.
[2024-05-31 23:09:40] [INFO ] Deduced a trap composed of 153 places in 492 ms of which 7 ms to minimize.
[2024-05-31 23:09:41] [INFO ] Deduced a trap composed of 186 places in 521 ms of which 7 ms to minimize.
[2024-05-31 23:09:41] [INFO ] Deduced a trap composed of 156 places in 531 ms of which 7 ms to minimize.
[2024-05-31 23:09:42] [INFO ] Deduced a trap composed of 146 places in 507 ms of which 8 ms to minimize.
[2024-05-31 23:09:42] [INFO ] Deduced a trap composed of 213 places in 516 ms of which 7 ms to minimize.
[2024-05-31 23:09:43] [INFO ] Deduced a trap composed of 147 places in 513 ms of which 7 ms to minimize.
[2024-05-31 23:09:43] [INFO ] Deduced a trap composed of 155 places in 493 ms of which 7 ms to minimize.
[2024-05-31 23:09:44] [INFO ] Deduced a trap composed of 147 places in 474 ms of which 7 ms to minimize.
[2024-05-31 23:09:44] [INFO ] Deduced a trap composed of 155 places in 480 ms of which 6 ms to minimize.
[2024-05-31 23:09:45] [INFO ] Deduced a trap composed of 150 places in 478 ms of which 7 ms to minimize.
[2024-05-31 23:09:45] [INFO ] Deduced a trap composed of 160 places in 475 ms of which 7 ms to minimize.
[2024-05-31 23:09:46] [INFO ] Deduced a trap composed of 176 places in 482 ms of which 7 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1114 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1114/3487 variables, and 235 constraints, problems are : Problem set: 0 solved, 7 unsolved in 90010 ms.
Refiners :[Positive P Invariants (semi-flows): 19/31 constraints, Generalized P Invariants (flows): 32/37 constraints, State Equation: 0/1131 constraints, ReadFeed: 0/1046 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 184/184 constraints]
After SMT, in 93299ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 1131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1131/1131 places, 2733/2733 transitions.
Applied a total of 0 rules in 63 ms. Remains 1131 /1131 variables (removed 0) and now considering 2733/2733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1131/1131 places, 2733/2733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1131/1131 places, 2733/2733 transitions.
Applied a total of 0 rules in 59 ms. Remains 1131 /1131 variables (removed 0) and now considering 2733/2733 (removed 0) transitions.
[2024-05-31 23:09:46] [INFO ] Flow matrix only has 2356 transitions (discarded 377 similar events)
[2024-05-31 23:09:46] [INFO ] Invariant cache hit.
[2024-05-31 23:09:47] [INFO ] Implicit Places using invariants in 798 ms returned [145, 437, 530, 651, 900]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 802 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1126/1131 places, 2733/2733 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1121 transition count 2728
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1121 transition count 2728
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1116 transition count 2723
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1116 transition count 2723
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1112 transition count 2695
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1112 transition count 2695
Applied a total of 28 rules in 176 ms. Remains 1112 /1126 variables (removed 14) and now considering 2695/2733 (removed 38) transitions.
[2024-05-31 23:09:47] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
// Phase 1: matrix 2318 rows 1112 cols
[2024-05-31 23:09:47] [INFO ] Computed 63 invariants in 28 ms
[2024-05-31 23:09:48] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-31 23:09:48] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
[2024-05-31 23:09:48] [INFO ] Invariant cache hit.
[2024-05-31 23:09:49] [INFO ] State equation strengthened by 1022 read => feed constraints.
[2024-05-31 23:10:03] [INFO ] Implicit Places using invariants and state equation in 14744 ms returned []
Implicit Place search using SMT with State Equation took 15563 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1112/1131 places, 2695/2733 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16604 ms. Remains : 1112/1131 places, 2695/2733 transitions.
RANDOM walk for 40000 steps (815 resets) in 401 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (129 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (127 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (125 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (140 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (112 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (126 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (111 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 65998 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 7
Probabilistic random walk after 65998 steps, saw 28371 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-31 23:10:06] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
[2024-05-31 23:10:06] [INFO ] Invariant cache hit.
[2024-05-31 23:10:06] [INFO ] State equation strengthened by 1022 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 961/1027 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/1029 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 67/1096 variables, 28/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1096 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/1108 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/1112 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1112 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2318/3430 variables, 1112/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3430 variables, 1022/2197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3430 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/3430 variables, 0/2197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3430/3430 variables, and 2197 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2979 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 1112/1112 constraints, ReadFeed: 1022/1022 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 961/1027 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:10:10] [INFO ] Deduced a trap composed of 214 places in 427 ms of which 6 ms to minimize.
[2024-05-31 23:10:10] [INFO ] Deduced a trap composed of 258 places in 417 ms of which 6 ms to minimize.
[2024-05-31 23:10:11] [INFO ] Deduced a trap composed of 218 places in 429 ms of which 5 ms to minimize.
[2024-05-31 23:10:11] [INFO ] Deduced a trap composed of 221 places in 408 ms of which 5 ms to minimize.
[2024-05-31 23:10:12] [INFO ] Deduced a trap composed of 172 places in 425 ms of which 6 ms to minimize.
[2024-05-31 23:10:12] [INFO ] Deduced a trap composed of 175 places in 414 ms of which 6 ms to minimize.
[2024-05-31 23:10:13] [INFO ] Deduced a trap composed of 157 places in 415 ms of which 6 ms to minimize.
[2024-05-31 23:10:13] [INFO ] Deduced a trap composed of 179 places in 421 ms of which 6 ms to minimize.
[2024-05-31 23:10:13] [INFO ] Deduced a trap composed of 197 places in 423 ms of which 5 ms to minimize.
[2024-05-31 23:10:14] [INFO ] Deduced a trap composed of 173 places in 422 ms of which 6 ms to minimize.
[2024-05-31 23:10:14] [INFO ] Deduced a trap composed of 546 places in 370 ms of which 6 ms to minimize.
[2024-05-31 23:10:15] [INFO ] Deduced a trap composed of 573 places in 376 ms of which 6 ms to minimize.
[2024-05-31 23:10:15] [INFO ] Deduced a trap composed of 154 places in 423 ms of which 6 ms to minimize.
[2024-05-31 23:10:16] [INFO ] Deduced a trap composed of 203 places in 441 ms of which 6 ms to minimize.
[2024-05-31 23:10:16] [INFO ] Deduced a trap composed of 311 places in 436 ms of which 5 ms to minimize.
[2024-05-31 23:10:17] [INFO ] Deduced a trap composed of 276 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:10:17] [INFO ] Deduced a trap composed of 160 places in 426 ms of which 5 ms to minimize.
[2024-05-31 23:10:17] [INFO ] Deduced a trap composed of 193 places in 423 ms of which 6 ms to minimize.
[2024-05-31 23:10:18] [INFO ] Deduced a trap composed of 173 places in 439 ms of which 5 ms to minimize.
[2024-05-31 23:10:18] [INFO ] Deduced a trap composed of 152 places in 432 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:10:19] [INFO ] Deduced a trap composed of 195 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:10:19] [INFO ] Deduced a trap composed of 161 places in 413 ms of which 6 ms to minimize.
[2024-05-31 23:10:20] [INFO ] Deduced a trap composed of 174 places in 446 ms of which 7 ms to minimize.
[2024-05-31 23:10:20] [INFO ] Deduced a trap composed of 161 places in 413 ms of which 6 ms to minimize.
[2024-05-31 23:10:21] [INFO ] Deduced a trap composed of 161 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:10:21] [INFO ] Deduced a trap composed of 196 places in 430 ms of which 6 ms to minimize.
[2024-05-31 23:10:21] [INFO ] Deduced a trap composed of 574 places in 435 ms of which 6 ms to minimize.
[2024-05-31 23:10:22] [INFO ] Deduced a trap composed of 227 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:10:22] [INFO ] Deduced a trap composed of 205 places in 426 ms of which 6 ms to minimize.
[2024-05-31 23:10:23] [INFO ] Deduced a trap composed of 161 places in 420 ms of which 6 ms to minimize.
[2024-05-31 23:10:23] [INFO ] Deduced a trap composed of 523 places in 417 ms of which 6 ms to minimize.
[2024-05-31 23:10:24] [INFO ] Deduced a trap composed of 207 places in 473 ms of which 7 ms to minimize.
[2024-05-31 23:10:24] [INFO ] Deduced a trap composed of 160 places in 445 ms of which 7 ms to minimize.
[2024-05-31 23:10:25] [INFO ] Deduced a trap composed of 185 places in 425 ms of which 6 ms to minimize.
[2024-05-31 23:10:25] [INFO ] Deduced a trap composed of 189 places in 427 ms of which 6 ms to minimize.
[2024-05-31 23:10:26] [INFO ] Deduced a trap composed of 258 places in 420 ms of which 6 ms to minimize.
[2024-05-31 23:10:26] [INFO ] Deduced a trap composed of 232 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:10:26] [INFO ] Deduced a trap composed of 552 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:10:27] [INFO ] Deduced a trap composed of 174 places in 426 ms of which 5 ms to minimize.
[2024-05-31 23:10:27] [INFO ] Deduced a trap composed of 154 places in 426 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:10:28] [INFO ] Deduced a trap composed of 274 places in 116 ms of which 2 ms to minimize.
[2024-05-31 23:10:28] [INFO ] Deduced a trap composed of 184 places in 419 ms of which 6 ms to minimize.
[2024-05-31 23:10:28] [INFO ] Deduced a trap composed of 195 places in 419 ms of which 6 ms to minimize.
[2024-05-31 23:10:29] [INFO ] Deduced a trap composed of 142 places in 435 ms of which 6 ms to minimize.
[2024-05-31 23:10:29] [INFO ] Deduced a trap composed of 178 places in 418 ms of which 6 ms to minimize.
[2024-05-31 23:10:30] [INFO ] Deduced a trap composed of 170 places in 417 ms of which 7 ms to minimize.
[2024-05-31 23:10:30] [INFO ] Deduced a trap composed of 182 places in 414 ms of which 6 ms to minimize.
[2024-05-31 23:10:31] [INFO ] Deduced a trap composed of 142 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:10:31] [INFO ] Deduced a trap composed of 195 places in 417 ms of which 6 ms to minimize.
[2024-05-31 23:10:32] [INFO ] Deduced a trap composed of 185 places in 426 ms of which 6 ms to minimize.
[2024-05-31 23:10:32] [INFO ] Deduced a trap composed of 258 places in 416 ms of which 6 ms to minimize.
[2024-05-31 23:10:32] [INFO ] Deduced a trap composed of 180 places in 420 ms of which 6 ms to minimize.
[2024-05-31 23:10:33] [INFO ] Deduced a trap composed of 227 places in 417 ms of which 6 ms to minimize.
[2024-05-31 23:10:33] [INFO ] Deduced a trap composed of 184 places in 452 ms of which 6 ms to minimize.
[2024-05-31 23:10:34] [INFO ] Deduced a trap composed of 395 places in 202 ms of which 3 ms to minimize.
[2024-05-31 23:10:34] [INFO ] Deduced a trap composed of 185 places in 440 ms of which 6 ms to minimize.
[2024-05-31 23:10:34] [INFO ] Deduced a trap composed of 347 places in 207 ms of which 3 ms to minimize.
[2024-05-31 23:10:35] [INFO ] Deduced a trap composed of 192 places in 424 ms of which 6 ms to minimize.
[2024-05-31 23:10:35] [INFO ] Deduced a trap composed of 191 places in 417 ms of which 6 ms to minimize.
[2024-05-31 23:10:35] [INFO ] Deduced a trap composed of 333 places in 203 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:10:36] [INFO ] Deduced a trap composed of 174 places in 427 ms of which 6 ms to minimize.
[2024-05-31 23:10:36] [INFO ] Deduced a trap composed of 199 places in 425 ms of which 6 ms to minimize.
[2024-05-31 23:10:37] [INFO ] Deduced a trap composed of 199 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:10:37] [INFO ] Deduced a trap composed of 171 places in 417 ms of which 6 ms to minimize.
[2024-05-31 23:10:38] [INFO ] Deduced a trap composed of 284 places in 449 ms of which 5 ms to minimize.
[2024-05-31 23:10:38] [INFO ] Deduced a trap composed of 156 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 197 places in 422 ms of which 18 ms to minimize.
[2024-05-31 23:10:39] [INFO ] Deduced a trap composed of 186 places in 409 ms of which 6 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 233 places in 424 ms of which 6 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 215 places in 416 ms of which 6 ms to minimize.
[2024-05-31 23:10:40] [INFO ] Deduced a trap composed of 368 places in 204 ms of which 4 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 204 places in 419 ms of which 5 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 441 places in 200 ms of which 3 ms to minimize.
[2024-05-31 23:10:41] [INFO ] Deduced a trap composed of 826 places in 388 ms of which 6 ms to minimize.
[2024-05-31 23:10:42] [INFO ] Deduced a trap composed of 160 places in 449 ms of which 6 ms to minimize.
[2024-05-31 23:10:42] [INFO ] Deduced a trap composed of 365 places in 447 ms of which 6 ms to minimize.
[2024-05-31 23:10:43] [INFO ] Deduced a trap composed of 145 places in 458 ms of which 6 ms to minimize.
[2024-05-31 23:10:43] [INFO ] Deduced a trap composed of 160 places in 456 ms of which 7 ms to minimize.
[2024-05-31 23:10:44] [INFO ] Deduced a trap composed of 262 places in 484 ms of which 7 ms to minimize.
[2024-05-31 23:10:44] [INFO ] Deduced a trap composed of 336 places in 420 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1027 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:10:45] [INFO ] Deduced a trap composed of 177 places in 494 ms of which 7 ms to minimize.
[2024-05-31 23:10:45] [INFO ] Deduced a trap composed of 188 places in 476 ms of which 6 ms to minimize.
[2024-05-31 23:10:46] [INFO ] Deduced a trap composed of 199 places in 460 ms of which 6 ms to minimize.
[2024-05-31 23:10:46] [INFO ] Deduced a trap composed of 162 places in 427 ms of which 6 ms to minimize.
[2024-05-31 23:10:47] [INFO ] Deduced a trap composed of 141 places in 442 ms of which 6 ms to minimize.
[2024-05-31 23:10:47] [INFO ] Deduced a trap composed of 241 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:10:48] [INFO ] Deduced a trap composed of 182 places in 432 ms of which 6 ms to minimize.
[2024-05-31 23:10:48] [INFO ] Deduced a trap composed of 234 places in 425 ms of which 6 ms to minimize.
[2024-05-31 23:10:49] [INFO ] Deduced a trap composed of 147 places in 424 ms of which 6 ms to minimize.
[2024-05-31 23:10:49] [INFO ] Deduced a trap composed of 180 places in 440 ms of which 6 ms to minimize.
[2024-05-31 23:10:50] [INFO ] Deduced a trap composed of 206 places in 424 ms of which 6 ms to minimize.
[2024-05-31 23:10:50] [INFO ] Deduced a trap composed of 271 places in 426 ms of which 6 ms to minimize.
[2024-05-31 23:10:51] [INFO ] Deduced a trap composed of 238 places in 430 ms of which 6 ms to minimize.
[2024-05-31 23:10:51] [INFO ] Deduced a trap composed of 147 places in 436 ms of which 6 ms to minimize.
[2024-05-31 23:10:51] [INFO ] Deduced a trap composed of 186 places in 416 ms of which 6 ms to minimize.
[2024-05-31 23:10:52] [INFO ] Deduced a trap composed of 192 places in 437 ms of which 6 ms to minimize.
[2024-05-31 23:10:53] [INFO ] Deduced a trap composed of 224 places in 431 ms of which 6 ms to minimize.
[2024-05-31 23:10:53] [INFO ] Deduced a trap composed of 173 places in 436 ms of which 6 ms to minimize.
[2024-05-31 23:10:54] [INFO ] Deduced a trap composed of 160 places in 425 ms of which 6 ms to minimize.
[2024-05-31 23:10:54] [INFO ] Deduced a trap composed of 251 places in 435 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1027 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:10:55] [INFO ] Deduced a trap composed of 249 places in 429 ms of which 5 ms to minimize.
[2024-05-31 23:10:56] [INFO ] Deduced a trap composed of 289 places in 435 ms of which 6 ms to minimize.
[2024-05-31 23:10:56] [INFO ] Deduced a trap composed of 166 places in 427 ms of which 6 ms to minimize.
[2024-05-31 23:10:57] [INFO ] Deduced a trap composed of 228 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:10:57] [INFO ] Deduced a trap composed of 160 places in 425 ms of which 6 ms to minimize.
[2024-05-31 23:10:58] [INFO ] Deduced a trap composed of 163 places in 419 ms of which 6 ms to minimize.
[2024-05-31 23:10:58] [INFO ] Deduced a trap composed of 269 places in 429 ms of which 5 ms to minimize.
[2024-05-31 23:10:58] [INFO ] Deduced a trap composed of 259 places in 417 ms of which 6 ms to minimize.
[2024-05-31 23:10:59] [INFO ] Deduced a trap composed of 249 places in 416 ms of which 6 ms to minimize.
[2024-05-31 23:10:59] [INFO ] Deduced a trap composed of 157 places in 421 ms of which 6 ms to minimize.
[2024-05-31 23:11:00] [INFO ] Deduced a trap composed of 239 places in 424 ms of which 6 ms to minimize.
[2024-05-31 23:11:00] [INFO ] Deduced a trap composed of 298 places in 440 ms of which 6 ms to minimize.
[2024-05-31 23:11:01] [INFO ] Deduced a trap composed of 220 places in 420 ms of which 6 ms to minimize.
[2024-05-31 23:11:01] [INFO ] Deduced a trap composed of 157 places in 414 ms of which 6 ms to minimize.
[2024-05-31 23:11:02] [INFO ] Deduced a trap composed of 274 places in 419 ms of which 6 ms to minimize.
[2024-05-31 23:11:02] [INFO ] Deduced a trap composed of 164 places in 429 ms of which 7 ms to minimize.
[2024-05-31 23:11:03] [INFO ] Deduced a trap composed of 243 places in 429 ms of which 5 ms to minimize.
[2024-05-31 23:11:03] [INFO ] Deduced a trap composed of 167 places in 426 ms of which 7 ms to minimize.
[2024-05-31 23:11:04] [INFO ] Deduced a trap composed of 858 places in 421 ms of which 6 ms to minimize.
[2024-05-31 23:11:04] [INFO ] Deduced a trap composed of 860 places in 416 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1027 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:11:05] [INFO ] Deduced a trap composed of 182 places in 419 ms of which 6 ms to minimize.
[2024-05-31 23:11:05] [INFO ] Deduced a trap composed of 256 places in 426 ms of which 5 ms to minimize.
[2024-05-31 23:11:05] [INFO ] Deduced a trap composed of 224 places in 421 ms of which 6 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 148 places in 443 ms of which 6 ms to minimize.
[2024-05-31 23:11:06] [INFO ] Deduced a trap composed of 207 places in 421 ms of which 6 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 231 places in 420 ms of which 6 ms to minimize.
[2024-05-31 23:11:07] [INFO ] Deduced a trap composed of 213 places in 423 ms of which 6 ms to minimize.
[2024-05-31 23:11:08] [INFO ] Deduced a trap composed of 669 places in 430 ms of which 6 ms to minimize.
[2024-05-31 23:11:08] [INFO ] Deduced a trap composed of 220 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:11:09] [INFO ] Deduced a trap composed of 241 places in 413 ms of which 5 ms to minimize.
[2024-05-31 23:11:09] [INFO ] Deduced a trap composed of 189 places in 412 ms of which 6 ms to minimize.
[2024-05-31 23:11:10] [INFO ] Deduced a trap composed of 620 places in 379 ms of which 6 ms to minimize.
[2024-05-31 23:11:10] [INFO ] Deduced a trap composed of 828 places in 377 ms of which 6 ms to minimize.
[2024-05-31 23:11:10] [INFO ] Deduced a trap composed of 149 places in 411 ms of which 6 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 208 places in 422 ms of which 6 ms to minimize.
[2024-05-31 23:11:11] [INFO ] Deduced a trap composed of 259 places in 430 ms of which 6 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 148 places in 434 ms of which 6 ms to minimize.
[2024-05-31 23:11:12] [INFO ] Deduced a trap composed of 203 places in 422 ms of which 5 ms to minimize.
[2024-05-31 23:11:13] [INFO ] Deduced a trap composed of 260 places in 421 ms of which 6 ms to minimize.
[2024-05-31 23:11:13] [INFO ] Deduced a trap composed of 215 places in 428 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:11:14] [INFO ] Deduced a trap composed of 208 places in 423 ms of which 6 ms to minimize.
[2024-05-31 23:11:14] [INFO ] Deduced a trap composed of 162 places in 428 ms of which 6 ms to minimize.
[2024-05-31 23:11:15] [INFO ] Deduced a trap composed of 162 places in 429 ms of which 6 ms to minimize.
[2024-05-31 23:11:15] [INFO ] Deduced a trap composed of 169 places in 426 ms of which 6 ms to minimize.
[2024-05-31 23:11:16] [INFO ] Deduced a trap composed of 682 places in 379 ms of which 6 ms to minimize.
[2024-05-31 23:11:16] [INFO ] Deduced a trap composed of 902 places in 389 ms of which 6 ms to minimize.
[2024-05-31 23:11:17] [INFO ] Deduced a trap composed of 148 places in 421 ms of which 6 ms to minimize.
[2024-05-31 23:11:17] [INFO ] Deduced a trap composed of 256 places in 417 ms of which 5 ms to minimize.
[2024-05-31 23:11:18] [INFO ] Deduced a trap composed of 245 places in 419 ms of which 6 ms to minimize.
[2024-05-31 23:11:18] [INFO ] Deduced a trap composed of 197 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:11:19] [INFO ] Deduced a trap composed of 263 places in 426 ms of which 6 ms to minimize.
[2024-05-31 23:11:19] [INFO ] Deduced a trap composed of 162 places in 420 ms of which 5 ms to minimize.
[2024-05-31 23:11:19] [INFO ] Deduced a trap composed of 210 places in 413 ms of which 6 ms to minimize.
[2024-05-31 23:11:20] [INFO ] Deduced a trap composed of 246 places in 422 ms of which 6 ms to minimize.
[2024-05-31 23:11:20] [INFO ] Deduced a trap composed of 163 places in 409 ms of which 5 ms to minimize.
[2024-05-31 23:11:21] [INFO ] Deduced a trap composed of 163 places in 419 ms of which 6 ms to minimize.
[2024-05-31 23:11:21] [INFO ] Deduced a trap composed of 802 places in 416 ms of which 6 ms to minimize.
[2024-05-31 23:11:22] [INFO ] Deduced a trap composed of 169 places in 433 ms of which 6 ms to minimize.
[2024-05-31 23:11:22] [INFO ] Deduced a trap composed of 149 places in 421 ms of which 6 ms to minimize.
[2024-05-31 23:11:23] [INFO ] Deduced a trap composed of 198 places in 422 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1027 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 180 places in 420 ms of which 6 ms to minimize.
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 168 places in 412 ms of which 5 ms to minimize.
[2024-05-31 23:11:25] [INFO ] Deduced a trap composed of 147 places in 408 ms of which 6 ms to minimize.
[2024-05-31 23:11:25] [INFO ] Deduced a trap composed of 289 places in 413 ms of which 6 ms to minimize.
[2024-05-31 23:11:25] [INFO ] Deduced a trap composed of 230 places in 407 ms of which 6 ms to minimize.
[2024-05-31 23:11:26] [INFO ] Deduced a trap composed of 147 places in 402 ms of which 6 ms to minimize.
[2024-05-31 23:11:26] [INFO ] Deduced a trap composed of 162 places in 414 ms of which 6 ms to minimize.
[2024-05-31 23:11:27] [INFO ] Deduced a trap composed of 239 places in 419 ms of which 6 ms to minimize.
[2024-05-31 23:11:27] [INFO ] Deduced a trap composed of 193 places in 424 ms of which 5 ms to minimize.
[2024-05-31 23:11:28] [INFO ] Deduced a trap composed of 210 places in 422 ms of which 6 ms to minimize.
[2024-05-31 23:11:28] [INFO ] Deduced a trap composed of 181 places in 422 ms of which 6 ms to minimize.
[2024-05-31 23:11:29] [INFO ] Deduced a trap composed of 209 places in 411 ms of which 5 ms to minimize.
[2024-05-31 23:11:29] [INFO ] Deduced a trap composed of 149 places in 407 ms of which 6 ms to minimize.
[2024-05-31 23:11:30] [INFO ] Deduced a trap composed of 196 places in 420 ms of which 6 ms to minimize.
[2024-05-31 23:11:30] [INFO ] Deduced a trap composed of 175 places in 413 ms of which 6 ms to minimize.
[2024-05-31 23:11:31] [INFO ] Deduced a trap composed of 542 places in 375 ms of which 6 ms to minimize.
[2024-05-31 23:11:31] [INFO ] Deduced a trap composed of 598 places in 380 ms of which 6 ms to minimize.
[2024-05-31 23:11:32] [INFO ] Deduced a trap composed of 221 places in 417 ms of which 5 ms to minimize.
[2024-05-31 23:11:32] [INFO ] Deduced a trap composed of 194 places in 407 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1027 variables, 19/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:11:32] [INFO ] Deduced a trap composed of 196 places in 401 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1027 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1027 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 2/1029 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1029 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 67/1096 variables, 28/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:11:34] [INFO ] Deduced a trap composed of 125 places in 474 ms of which 6 ms to minimize.
[2024-05-31 23:11:34] [INFO ] Deduced a trap composed of 153 places in 469 ms of which 6 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 130 places in 472 ms of which 7 ms to minimize.
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 153 places in 489 ms of which 7 ms to minimize.
[2024-05-31 23:11:36] [INFO ] Deduced a trap composed of 177 places in 475 ms of which 7 ms to minimize.
[2024-05-31 23:11:36] [INFO ] Deduced a trap composed of 140 places in 497 ms of which 7 ms to minimize.
[2024-05-31 23:11:37] [INFO ] Deduced a trap composed of 283 places in 508 ms of which 7 ms to minimize.
[2024-05-31 23:11:37] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 3 ms to minimize.
[2024-05-31 23:11:38] [INFO ] Deduced a trap composed of 303 places in 490 ms of which 7 ms to minimize.
[2024-05-31 23:11:38] [INFO ] Deduced a trap composed of 141 places in 496 ms of which 6 ms to minimize.
[2024-05-31 23:11:39] [INFO ] Deduced a trap composed of 171 places in 505 ms of which 7 ms to minimize.
[2024-05-31 23:11:39] [INFO ] Deduced a trap composed of 154 places in 507 ms of which 7 ms to minimize.
[2024-05-31 23:11:40] [INFO ] Deduced a trap composed of 115 places in 501 ms of which 6 ms to minimize.
[2024-05-31 23:11:40] [INFO ] Deduced a trap composed of 140 places in 499 ms of which 7 ms to minimize.
[2024-05-31 23:11:41] [INFO ] Deduced a trap composed of 139 places in 469 ms of which 6 ms to minimize.
[2024-05-31 23:11:41] [INFO ] Deduced a trap composed of 175 places in 486 ms of which 6 ms to minimize.
[2024-05-31 23:11:42] [INFO ] Deduced a trap composed of 118 places in 477 ms of which 7 ms to minimize.
[2024-05-31 23:11:42] [INFO ] Deduced a trap composed of 151 places in 455 ms of which 6 ms to minimize.
[2024-05-31 23:11:43] [INFO ] Deduced a trap composed of 138 places in 475 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1096 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:11:43] [INFO ] Deduced a trap composed of 379 places in 484 ms of which 7 ms to minimize.
[2024-05-31 23:11:44] [INFO ] Deduced a trap composed of 123 places in 499 ms of which 7 ms to minimize.
[2024-05-31 23:11:44] [INFO ] Deduced a trap composed of 113 places in 462 ms of which 7 ms to minimize.
[2024-05-31 23:11:45] [INFO ] Deduced a trap composed of 140 places in 496 ms of which 6 ms to minimize.
[2024-05-31 23:11:46] [INFO ] Deduced a trap composed of 165 places in 501 ms of which 6 ms to minimize.
[2024-05-31 23:11:46] [INFO ] Deduced a trap composed of 134 places in 490 ms of which 7 ms to minimize.
[2024-05-31 23:11:47] [INFO ] Deduced a trap composed of 151 places in 472 ms of which 7 ms to minimize.
[2024-05-31 23:11:47] [INFO ] Deduced a trap composed of 146 places in 488 ms of which 7 ms to minimize.
[2024-05-31 23:11:48] [INFO ] Deduced a trap composed of 133 places in 501 ms of which 7 ms to minimize.
[2024-05-31 23:11:48] [INFO ] Deduced a trap composed of 292 places in 502 ms of which 7 ms to minimize.
[2024-05-31 23:11:49] [INFO ] Deduced a trap composed of 172 places in 507 ms of which 10 ms to minimize.
[2024-05-31 23:11:49] [INFO ] Deduced a trap composed of 174 places in 474 ms of which 6 ms to minimize.
[2024-05-31 23:11:50] [INFO ] Deduced a trap composed of 155 places in 475 ms of which 7 ms to minimize.
[2024-05-31 23:11:50] [INFO ] Deduced a trap composed of 173 places in 458 ms of which 6 ms to minimize.
[2024-05-31 23:11:51] [INFO ] Deduced a trap composed of 147 places in 447 ms of which 7 ms to minimize.
[2024-05-31 23:11:51] [INFO ] Deduced a trap composed of 139 places in 510 ms of which 6 ms to minimize.
[2024-05-31 23:11:52] [INFO ] Deduced a trap composed of 146 places in 480 ms of which 6 ms to minimize.
[2024-05-31 23:11:52] [INFO ] Deduced a trap composed of 143 places in 456 ms of which 7 ms to minimize.
[2024-05-31 23:11:53] [INFO ] Deduced a trap composed of 151 places in 491 ms of which 6 ms to minimize.
[2024-05-31 23:11:53] [INFO ] Deduced a trap composed of 183 places in 451 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1096 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:11:54] [INFO ] Deduced a trap composed of 135 places in 496 ms of which 7 ms to minimize.
[2024-05-31 23:11:55] [INFO ] Deduced a trap composed of 122 places in 498 ms of which 6 ms to minimize.
SMT process timed out in 108192ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 out of 1112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1112/1112 places, 2695/2695 transitions.
Applied a total of 0 rules in 65 ms. Remains 1112 /1112 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1112/1112 places, 2695/2695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1112/1112 places, 2695/2695 transitions.
Applied a total of 0 rules in 59 ms. Remains 1112 /1112 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
[2024-05-31 23:11:55] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
[2024-05-31 23:11:55] [INFO ] Invariant cache hit.
[2024-05-31 23:11:55] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-05-31 23:11:55] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
[2024-05-31 23:11:55] [INFO ] Invariant cache hit.
[2024-05-31 23:11:56] [INFO ] State equation strengthened by 1022 read => feed constraints.
[2024-05-31 23:12:10] [INFO ] Implicit Places using invariants and state equation in 14662 ms returned []
Implicit Place search using SMT with State Equation took 15418 ms to find 0 implicit places.
[2024-05-31 23:12:10] [INFO ] Redundant transitions in 152 ms returned []
Running 2633 sub problems to find dead transitions.
[2024-05-31 23:12:10] [INFO ] Flow matrix only has 2318 transitions (discarded 377 similar events)
[2024-05-31 23:12:10] [INFO ] Invariant cache hit.
[2024-05-31 23:12:10] [INFO ] State equation strengthened by 1022 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.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 1.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 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 1.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 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.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 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 1.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 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.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 1.0)
(s287 1.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 1.0)
(s298 1.0)
(s299 1.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 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 0.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 1.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 1.0)
(s744 0.0)
(s745 0.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 0.0)
(s752 0.0)
(s753 1.0)
(s754 0.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 1.0)
(s787 1.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 1.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 1.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 1.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 0.0)
(s831 0.0)
(s832 1.0)
(s833 0.0)
(s834 1.0)
(s835 0.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 0.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 1.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 1.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 1.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 1.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 timeout
0.0)
(s896 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2633 unsolved
SMT process timed out in 32878ms, After SMT, problems are : Problem set: 0 solved, 2633 unsolved
Search for dead transitions found 0 dead transitions in 32902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48551 ms. Remains : 1112/1112 places, 2695/2695 transitions.
[2024-05-31 23:12:43] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2024-05-31 23:12:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1112 places, 2695 transitions and 12499 arcs took 14 ms.
[2024-05-31 23:12:44] [INFO ] Flatten gal took : 226 ms
Total runtime 431773 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 : MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-00
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2023-01
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-03
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2023-04
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-06
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-07
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-10

BK_STOP 1717197164458

--------------------
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 MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/2417/inv_0_
rfs formula name MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2023-01
rfs formula type EF
rfs formula formula --invariant=/tmp/2417/inv_1_
rfs formula name MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/2417/inv_2_
rfs formula name MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2023-04
rfs formula type EF
rfs formula formula --invariant=/tmp/2417/inv_3_
rfs formula name MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/2417/inv_4_
rfs formula name MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/2417/inv_5_
rfs formula name MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/2417/inv_6_
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="MultiCrashLeafsetExtension-PT-S16C07"
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 MultiCrashLeafsetExtension-PT-S16C07, 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 r508-tall-171654350800047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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