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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5345.447 519346.00 598314.00 1307.70 ?TFTT?TTTT?FTTFF 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-171654350900087.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-S24C05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350900087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 06:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 06:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 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 12M 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-S24C05-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2023-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717202165298

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-S24C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:36:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:36:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:36:07] [INFO ] Load time of PNML (sax parser for PT used): 624 ms
[2024-06-01 00:36:07] [INFO ] Transformed 11106 places.
[2024-06-01 00:36:07] [INFO ] Transformed 16561 transitions.
[2024-06-01 00:36:07] [INFO ] Parsed PT model containing 11106 places and 16561 transitions and 65150 arcs in 817 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (772 resets) in 2809 ms. (14 steps per ms) remains 15/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4001 steps (12 resets) in 70 ms. (56 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 295 ms. (13 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 108 ms. (36 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 267 ms. (14 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (12 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (12 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (12 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 13057 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :1 out of 15
Probabilistic random walk after 13057 steps, saw 6341 distinct states, run finished after 3005 ms. (steps per millisecond=4 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 00:36:11] [INFO ] Flow matrix only has 15961 transitions (discarded 600 similar events)
// Phase 1: matrix 15961 rows 11106 cols
[2024-06-01 00:36:13] [INFO ] Computed 975 invariants in 1112 ms
[2024-06-01 00:36:13] [INFO ] State equation strengthened by 5002 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 2309/2611 variables, 33/57 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2611 variables, 5/62 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2611 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 10/2621 variables, 10/72 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2621 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 5613/8234 variables, 386/458 constraints. Problems are: Problem set: 8 solved, 6 unsolved
[2024-06-01 00:36:29] [INFO ] Deduced a trap composed of 997 places in 12507 ms of which 394 ms to minimize.
SMT process timed out in 17717ms, After SMT, problems are : Problem set: 8 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 11106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Graph (complete) has 37715 edges and 11106 vertex of which 11068 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.37 ms
Discarding 38 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2949 transitions
Trivial Post-agglo rules discarded 2949 transitions
Performed 2949 trivial Post agglomeration. Transition count delta: 2949
Iterating post reduction 0 with 2949 rules applied. Total rules applied 2950 place count 11068 transition count 13612
Reduce places removed 2949 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 2997 rules applied. Total rules applied 5947 place count 8119 transition count 13564
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 5995 place count 8071 transition count 13564
Performed 246 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 246 Pre rules applied. Total rules applied 5995 place count 8071 transition count 13318
Deduced a syphon composed of 246 places in 15 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 3 with 492 rules applied. Total rules applied 6487 place count 7825 transition count 13318
Discarding 2743 places :
Symmetric choice reduction at 3 with 2743 rule applications. Total rules 9230 place count 5082 transition count 10575
Iterating global reduction 3 with 2743 rules applied. Total rules applied 11973 place count 5082 transition count 10575
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 11973 place count 5082 transition count 10570
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 11983 place count 5077 transition count 10570
Discarding 537 places :
Symmetric choice reduction at 3 with 537 rule applications. Total rules 12520 place count 4540 transition count 7885
Iterating global reduction 3 with 537 rules applied. Total rules applied 13057 place count 4540 transition count 7885
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 6 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 13103 place count 4517 transition count 7862
Free-agglomeration rule (complex) applied 328 times.
Iterating global reduction 3 with 328 rules applied. Total rules applied 13431 place count 4517 transition count 9638
Reduce places removed 328 places and 0 transitions.
Iterating post reduction 3 with 328 rules applied. Total rules applied 13759 place count 4189 transition count 9638
Partial Free-agglomeration rule applied 121 times.
Drop transitions (Partial Free agglomeration) removed 121 transitions
Iterating global reduction 4 with 121 rules applied. Total rules applied 13880 place count 4189 transition count 9638
Applied a total of 13880 rules in 5113 ms. Remains 4189 /11106 variables (removed 6917) and now considering 9638/16561 (removed 6923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5125 ms. Remains : 4189/11106 places, 9638/16561 transitions.
RANDOM walk for 40000 steps (1266 resets) in 1729 ms. (23 steps per ms) remains 5/6 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (154 resets) in 277 ms. (143 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (153 resets) in 301 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (156 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (156 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (153 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
[2024-06-01 00:36:35] [INFO ] Flow matrix only has 8766 transitions (discarded 872 similar events)
// Phase 1: matrix 8766 rows 4189 cols
[2024-06-01 00:36:35] [INFO ] Computed 937 invariants in 243 ms
[2024-06-01 00:36:36] [INFO ] State equation strengthened by 4958 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 2927/2975 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2975 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/2980 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2980 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1012/3992 variables, 715/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3992 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 24/4016 variables, 24/764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4016 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 173/4189 variables, 173/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4189 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 8766/12955 variables, 4189/5126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (INCLUDED_ONLY) 0/12955 variables, 4958/10084 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12955 variables, 0/10084 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/12955 variables, 0/10084 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12955/12955 variables, and 10084 constraints, problems are : Problem set: 2 solved, 3 unsolved in 14753 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 888/888 constraints, State Equation: 4189/4189 constraints, ReadFeed: 4958/4958 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2927/2972 variables, 17/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 00:36:53] [INFO ] Deduced a trap composed of 241 places in 2298 ms of which 20 ms to minimize.
[2024-06-01 00:36:55] [INFO ] Deduced a trap composed of 417 places in 2141 ms of which 22 ms to minimize.
[2024-06-01 00:36:57] [INFO ] Deduced a trap composed of 469 places in 2165 ms of which 17 ms to minimize.
[2024-06-01 00:37:00] [INFO ] Deduced a trap composed of 468 places in 2166 ms of which 16 ms to minimize.
[2024-06-01 00:37:02] [INFO ] Deduced a trap composed of 468 places in 2252 ms of which 17 ms to minimize.
[2024-06-01 00:37:04] [INFO ] Deduced a trap composed of 428 places in 2122 ms of which 17 ms to minimize.
[2024-06-01 00:37:06] [INFO ] Deduced a trap composed of 519 places in 2094 ms of which 17 ms to minimize.
[2024-06-01 00:37:08] [INFO ] Deduced a trap composed of 928 places in 1683 ms of which 14 ms to minimize.
[2024-06-01 00:37:10] [INFO ] Deduced a trap composed of 466 places in 2170 ms of which 17 ms to minimize.
[2024-06-01 00:37:12] [INFO ] Deduced a trap composed of 476 places in 2085 ms of which 18 ms to minimize.
[2024-06-01 00:37:15] [INFO ] Deduced a trap composed of 481 places in 2118 ms of which 17 ms to minimize.
[2024-06-01 00:37:17] [INFO ] Deduced a trap composed of 434 places in 2226 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2972 variables, 12/30 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 00:37:19] [INFO ] Deduced a trap composed of 485 places in 2082 ms of which 17 ms to minimize.
[2024-06-01 00:37:21] [INFO ] Deduced a trap composed of 486 places in 2069 ms of which 17 ms to minimize.
[2024-06-01 00:37:24] [INFO ] Deduced a trap composed of 511 places in 2189 ms of which 18 ms to minimize.
[2024-06-01 00:37:25] [INFO ] Deduced a trap composed of 535 places in 1795 ms of which 14 ms to minimize.
[2024-06-01 00:37:28] [INFO ] Deduced a trap composed of 552 places in 2158 ms of which 18 ms to minimize.
[2024-06-01 00:37:29] [INFO ] Deduced a trap composed of 876 places in 1732 ms of which 15 ms to minimize.
[2024-06-01 00:37:31] [INFO ] Deduced a trap composed of 549 places in 1804 ms of which 15 ms to minimize.
[2024-06-01 00:37:33] [INFO ] Deduced a trap composed of 485 places in 2115 ms of which 17 ms to minimize.
[2024-06-01 00:37:35] [INFO ] Deduced a trap composed of 588 places in 1765 ms of which 15 ms to minimize.
[2024-06-01 00:37:37] [INFO ] Deduced a trap composed of 582 places in 2171 ms of which 17 ms to minimize.
SMT process timed out in 62271ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 4189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4189/4189 places, 9638/9638 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4189 transition count 9637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4188 transition count 9637
Applied a total of 2 rules in 1080 ms. Remains 4188 /4189 variables (removed 1) and now considering 9637/9638 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1081 ms. Remains : 4188/4189 places, 9637/9638 transitions.
RANDOM walk for 40000 steps (1268 resets) in 1284 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (155 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (152 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (155 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 24769 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 3
Probabilistic random walk after 24769 steps, saw 11297 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 00:37:42] [INFO ] Flow matrix only has 8765 transitions (discarded 872 similar events)
// Phase 1: matrix 8765 rows 4188 cols
[2024-06-01 00:37:42] [INFO ] Computed 937 invariants in 222 ms
[2024-06-01 00:37:42] [INFO ] State equation strengthened by 4958 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2903/2948 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2948 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/2953 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2953 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1023/3976 variables, 702/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3976 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/4002 variables, 26/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4002 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 186/4188 variables, 186/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4188 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 8765/12953 variables, 4188/5125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12953 variables, 4958/10083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12953 variables, 0/10083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/12953 variables, 0/10083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12953/12953 variables, and 10083 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11751 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 888/888 constraints, State Equation: 4188/4188 constraints, ReadFeed: 4958/4958 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2903/2948 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:37:57] [INFO ] Deduced a trap composed of 241 places in 2155 ms of which 17 ms to minimize.
[2024-06-01 00:37:59] [INFO ] Deduced a trap composed of 452 places in 2051 ms of which 16 ms to minimize.
[2024-06-01 00:38:01] [INFO ] Deduced a trap composed of 919 places in 2036 ms of which 16 ms to minimize.
[2024-06-01 00:38:03] [INFO ] Deduced a trap composed of 522 places in 1579 ms of which 13 ms to minimize.
[2024-06-01 00:38:04] [INFO ] Deduced a trap composed of 496 places in 1700 ms of which 13 ms to minimize.
[2024-06-01 00:38:06] [INFO ] Deduced a trap composed of 445 places in 1624 ms of which 13 ms to minimize.
[2024-06-01 00:38:08] [INFO ] Deduced a trap composed of 433 places in 1606 ms of which 14 ms to minimize.
[2024-06-01 00:38:09] [INFO ] Deduced a trap composed of 903 places in 1696 ms of which 13 ms to minimize.
[2024-06-01 00:38:11] [INFO ] Deduced a trap composed of 955 places in 1607 ms of which 13 ms to minimize.
[2024-06-01 00:38:13] [INFO ] Deduced a trap composed of 495 places in 2062 ms of which 17 ms to minimize.
[2024-06-01 00:38:15] [INFO ] Deduced a trap composed of 526 places in 2112 ms of which 16 ms to minimize.
[2024-06-01 00:38:18] [INFO ] Deduced a trap composed of 918 places in 2122 ms of which 16 ms to minimize.
[2024-06-01 00:38:20] [INFO ] Deduced a trap composed of 466 places in 2049 ms of which 16 ms to minimize.
[2024-06-01 00:38:22] [INFO ] Deduced a trap composed of 451 places in 2143 ms of which 16 ms to minimize.
[2024-06-01 00:38:24] [INFO ] Deduced a trap composed of 462 places in 2134 ms of which 16 ms to minimize.
[2024-06-01 00:38:26] [INFO ] Deduced a trap composed of 441 places in 1596 ms of which 13 ms to minimize.
[2024-06-01 00:38:28] [INFO ] Deduced a trap composed of 867 places in 2057 ms of which 18 ms to minimize.
[2024-06-01 00:38:29] [INFO ] Deduced a trap composed of 434 places in 1514 ms of which 12 ms to minimize.
[2024-06-01 00:38:31] [INFO ] Deduced a trap composed of 466 places in 1511 ms of which 14 ms to minimize.
[2024-06-01 00:38:33] [INFO ] Deduced a trap composed of 903 places in 1536 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2948 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:38:35] [INFO ] Deduced a trap composed of 482 places in 1999 ms of which 16 ms to minimize.
[2024-06-01 00:38:37] [INFO ] Deduced a trap composed of 482 places in 1981 ms of which 16 ms to minimize.
[2024-06-01 00:38:39] [INFO ] Deduced a trap composed of 483 places in 2036 ms of which 15 ms to minimize.
[2024-06-01 00:38:41] [INFO ] Deduced a trap composed of 919 places in 2107 ms of which 16 ms to minimize.
[2024-06-01 00:38:43] [INFO ] Deduced a trap composed of 955 places in 1585 ms of which 13 ms to minimize.
[2024-06-01 00:38:44] [INFO ] Deduced a trap composed of 468 places in 1574 ms of which 14 ms to minimize.
[2024-06-01 00:38:46] [INFO ] Deduced a trap composed of 493 places in 1598 ms of which 13 ms to minimize.
[2024-06-01 00:38:47] [INFO ] Deduced a trap composed of 491 places in 1568 ms of which 12 ms to minimize.
[2024-06-01 00:38:49] [INFO ] Deduced a trap composed of 514 places in 1581 ms of which 12 ms to minimize.
[2024-06-01 00:38:51] [INFO ] Deduced a trap composed of 526 places in 1488 ms of which 12 ms to minimize.
[2024-06-01 00:38:52] [INFO ] Deduced a trap composed of 534 places in 1568 ms of which 13 ms to minimize.
[2024-06-01 00:38:54] [INFO ] Deduced a trap composed of 544 places in 1554 ms of which 13 ms to minimize.
[2024-06-01 00:38:56] [INFO ] Deduced a trap composed of 1006 places in 1551 ms of which 12 ms to minimize.
[2024-06-01 00:38:57] [INFO ] Deduced a trap composed of 1057 places in 1471 ms of which 12 ms to minimize.
[2024-06-01 00:38:59] [INFO ] Deduced a trap composed of 536 places in 1584 ms of which 14 ms to minimize.
[2024-06-01 00:39:00] [INFO ] Deduced a trap composed of 622 places in 1452 ms of which 12 ms to minimize.
[2024-06-01 00:39:02] [INFO ] Deduced a trap composed of 563 places in 1491 ms of which 13 ms to minimize.
[2024-06-01 00:39:03] [INFO ] Deduced a trap composed of 587 places in 1475 ms of which 12 ms to minimize.
[2024-06-01 00:39:05] [INFO ] Deduced a trap composed of 617 places in 1411 ms of which 12 ms to minimize.
[2024-06-01 00:39:06] [INFO ] Deduced a trap composed of 547 places in 1548 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2948 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:39:08] [INFO ] Deduced a trap composed of 451 places in 2016 ms of which 16 ms to minimize.
[2024-06-01 00:39:11] [INFO ] Deduced a trap composed of 862 places in 2153 ms of which 16 ms to minimize.
SMT process timed out in 88492ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 4188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4188/4188 places, 9637/9637 transitions.
Applied a total of 0 rules in 558 ms. Remains 4188 /4188 variables (removed 0) and now considering 9637/9637 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 4188/4188 places, 9637/9637 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4188/4188 places, 9637/9637 transitions.
Applied a total of 0 rules in 532 ms. Remains 4188 /4188 variables (removed 0) and now considering 9637/9637 (removed 0) transitions.
[2024-06-01 00:39:12] [INFO ] Flow matrix only has 8765 transitions (discarded 872 similar events)
[2024-06-01 00:39:12] [INFO ] Invariant cache hit.
[2024-06-01 00:39:22] [INFO ] Implicit Places using invariants in 10747 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 215, 233, 249, 263, 275, 285, 293, 300, 304, 306, 319, 325, 327, 328, 329, 331, 332, 334, 340, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 491, 509, 525, 539, 551, 561, 569, 575, 582, 584, 586, 599, 605, 607, 608, 609, 610, 611, 612, 614, 616, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 763, 777, 789, 799, 807, 813, 817, 820, 822, 824, 837, 843, 845, 846, 847, 848, 849, 850, 852, 854, 857, 861, 867, 875, 885, 897, 911, 927, 944, 960, 961, 962, 963, 964, 965, 979, 991, 1001, 1009, 1016, 1020, 1022, 1024, 1026, 1028, 1041, 1048, 1050, 1051, 1052, 1053, 1054, 1055, 1057, 1059, 1061, 1063, 1067, 1073, 1081, 1091, 1103, 1117, 1132, 1146, 1147, 1148, 1149, 1150, 1151, 1163, 1173, 1181, 1187, 1192, 1194, 1196, 1198, 1200, 1202, 1215, 1221, 1223, 1224, 1225, 1226, 1227, 1228, 1230, 1232, 1234, 1236, 1238, 1242, 1248, 1256, 1266, 1278, 1291, 1303, 1304, 1305, 1306, 1307, 1308, 1318, 1326, 1332, 1336, 1338, 1340, 1342, 1344, 1346, 1348, 1361, 1367, 1369, 1370, 1371, 1372, 1373, 1374, 1376, 1378, 1380, 1382, 1384, 1386, 1390, 1396, 1404, 1414, 1425, 1435, 1436, 1437, 1438, 1439, 1440, 1448, 1454, 1458, 1460, 1462, 1464, 1466, 1468, 1470, 1472, 1485, 1491, 1493, 1494, 1495, 1496, 1497, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1512, 1516, 1522, 1530, 1539, 1548, 1550, 1551, 1552, 1553, 1559, 1563, 1565, 1569, 1571, 1573, 1575, 1577, 1579, 1581, 1594, 1600, 1602, 1603, 1604, 1605, 1606, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1627, 1633, 1640, 1646, 1647, 1648, 1649, 1650, 1651, 1655, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1686, 1692, 1694, 1695, 1696, 1697, 1698, 1699, 1701, 1703, 1705, 1707, 1709, 1711, 1713, 1715, 1717, 1721, 1726, 1730, 1731, 1732, 1733, 1734, 1735, 1737, 1739, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1768, 1774, 1776, 1777, 1778, 1779, 1780, 1781, 1783, 1785, 1787, 1789, 1791, 1793, 1795, 1797, 1799, 1801, 1804, 1807, 1808, 1809, 1810, 1811, 1812, 1814, 1816, 1818, 1820, 1822, 1824, 1826, 1828, 1830, 1832, 1845, 1851, 1853, 1854, 1855, 1856, 1857, 1858, 1860, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1884, 1885, 1886, 1887, 1888, 1890, 1892, 1894, 1896, 1898, 1900, 1902, 1904, 1906, 1908, 1921, 1923, 1926, 1928, 1929, 1930, 1931, 1932, 1933, 1935, 1937, 1939, 1941, 1943, 1945, 1947, 1949, 1951, 1953, 1955, 1957, 1958, 1959, 1960, 1961, 1962, 1964, 1966, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1995, 2001, 2003, 2004, 2005, 2006, 2007, 2008, 2010, 2012, 2014, 2016, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2032, 2033, 2034, 2035, 2036, 2037, 2039, 2041, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2070, 2076, 2078, 2079, 2080, 2081, 2082, 2083, 2085, 2087, 2089, 2091, 2093, 2095, 2098, 2100, 2102, 2104, 2106, 2109, 2110, 2111, 2112, 2113, 2114, 2116, 2118, 2120, 2122, 2124, 2126, 2128, 2130, 2132, 2134, 2147, 2153, 2155, 2156, 2157, 2158, 2159, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2176, 2178, 2180, 2184, 2189, 2190, 2192, 2193, 2194, 2198, 2200, 2202, 2204, 2206, 2209, 2211, 2213, 2215, 2217, 2231, 2237, 2239, 2240, 2241, 2242, 2243, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2260, 2262, 2266, 2272, 2279, 2280, 2281, 2282, 2283, 2284, 2290, 2294, 2296, 2298, 2300, 2302, 2304, 2306, 2308, 2310, 2323, 2329, 2331, 2332, 2333, 2334, 2335, 2336, 2338, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2356, 2362, 2370, 2379, 2380, 2381, 2382, 2383, 2384, 2392, 2398, 2402, 2404, 2406, 2408, 2410, 2412, 2414, 2416, 2429, 2435, 2437, 2438, 2440, 2441, 2442, 2444, 2447, 2449, 2451, 2453, 2455, 2457, 2461, 2467, 2475, 2485, 2496, 2497, 2498, 2499, 2500, 2501, 2511, 2519, 2525, 2529, 2531, 2533, 2535, 2537, 2539, 2541, 2555, 2561, 2563, 2564, 2565, 2566, 2567, 2568, 2570, 2572, 2574, 2576, 2578, 2580, 2584, 2590, 2598, 2608, 2620, 2633, 2634, 2635, 2636, 2638, 2650, 2660, 2668, 2674, 2678, 2680, 2682, 2684, 2686, 2689, 2703, 2709, 2711, 2712, 2713, 2714, 2715, 2716, 2718, 2720, 2722, 2724, 2726, 2730, 2736, 2744, 2754, 2766, 2780, 2795, 2796, 2797, 2798, 2799, 2800, 2814, 2826, 2836, 2844, 2850, 2854, 2856, 2858, 2860, 2862, 2875, 2882, 2884, 2885, 2886, 2887, 2888, 2889, 2891, 2893, 2895, 2898, 2902, 2908, 2916, 2926, 2938, 2952, 2968, 2985, 2986, 2987, 2988, 2989, 2990, 3006, 3020, 3032, 3042, 3050, 3056, 3060, 3062, 3064, 3066, 3079, 3085, 3087, 3088, 3089, 3090, 3091, 3092, 3094, 3096, 3098, 3103, 3109, 3117, 3127, 3139, 3153, 3169, 3187, 3206, 3207, 3208, 3209, 3210, 3211, 3229, 3245, 3259, 3271, 3281, 3289, 3295, 3299, 3302, 3304, 3317, 3323, 3325, 3326, 3327, 3328, 3329, 3330, 3332, 3334, 3338, 3345, 3353, 3363, 3375, 3389, 3405, 3423, 3443, 3464, 3465, 3466, 3467, 3468, 3469, 3489, 3507, 3523, 3537, 3549, 3559, 3567, 3573, 3578, 3580, 3593, 3595, 3598, 3600, 3601, 3603, 3604, 3605, 3607, 3612, 3618, 3627, 3637, 3649, 3663, 3679, 3697, 3717, 3739, 3762, 3763, 3764, 3765, 3766, 3767, 3789, 3809, 3827, 3843, 3857, 3869, 3879, 3887, 3894, 3898, 3912]
[2024-06-01 00:39:22] [INFO ] Actually due to overlaps returned [319, 599, 1041, 1215, 1361, 1485, 1686, 1768, 1845, 1921, 1995, 837, 1594, 2147, 2231, 2323, 2429, 2703, 2875, 3079, 3317, 3593, 3912, 2070, 2555, 4, 9, 10, 11, 12, 13, 190, 191, 192, 193, 194, 327, 328, 329, 331, 486, 487, 488, 489, 607, 608, 609, 610, 611, 742, 743, 744, 745, 746, 845, 846, 847, 848, 849, 960, 961, 962, 963, 964, 1050, 1051, 1052, 1053, 1054, 1146, 1147, 1148, 1149, 1150, 1223, 1224, 1225, 1226, 1227, 1303, 1304, 1305, 1306, 1307, 1369, 1370, 1371, 1372, 1373, 1435, 1436, 1437, 1438, 1439, 1493, 1494, 1495, 1496, 1497, 1548, 1550, 1551, 1552, 1602, 1603, 1604, 1605, 1606, 1646, 1647, 1648, 1649, 1650, 1694, 1695, 1696, 1697, 1698, 1730, 1731, 1732, 1733, 1734, 1776, 1777, 1778, 1779, 1780, 1807, 1808, 1809, 1810, 1811, 1853, 1854, 1855, 1856, 1857, 1883, 1884, 1885, 1886, 1887, 1923, 1928, 1929, 1930, 1931, 1932, 1957, 1958, 1959, 1960, 1961, 2003, 2004, 2005, 2006, 2007, 2032, 2033, 2034, 2035, 2036, 2078, 2079, 2080, 2081, 2082, 2109, 2110, 2111, 2112, 2113, 2155, 2156, 2157, 2158, 2159, 2189, 2190, 2192, 2193, 2239, 2240, 2241, 2242, 2243, 2279, 2280, 2281, 2282, 2283, 2331, 2332, 2333, 2334, 2335, 2379, 2380, 2381, 2382, 2383, 2437, 2438, 2440, 2441, 2496, 2497, 2498, 2499, 2500, 2563, 2564, 2565, 2566, 2567, 2633, 2634, 2635, 2636, 2711, 2712, 2713, 2714, 2715, 2795, 2796, 2797, 2798, 2799, 2884, 2885, 2886, 2887, 2888, 2985, 2986, 2987, 2988, 2989, 3087, 3088, 3089, 3090, 3091, 3206, 3207, 3208, 3209, 3210, 3325, 3326, 3327, 3328, 3329, 3464, 3465, 3466, 3467, 3468, 3595, 3600, 3601, 3603, 3604, 3762, 3763, 3764, 3765, 3766]
Discarding 271 places :
Implicit Place search using SMT only with invariants took 10769 ms to find 271 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3917/4188 places, 9637/9637 transitions.
Discarding 233 places :
Symmetric choice reduction at 0 with 233 rule applications. Total rules 233 place count 3684 transition count 9404
Iterating global reduction 0 with 233 rules applied. Total rules applied 466 place count 3684 transition count 9404
Discarding 232 places :
Symmetric choice reduction at 0 with 232 rule applications. Total rules 698 place count 3452 transition count 9172
Iterating global reduction 0 with 232 rules applied. Total rules applied 930 place count 3452 transition count 9172
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 933 place count 3452 transition count 9169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 936 place count 3449 transition count 9169
Applied a total of 936 rules in 1534 ms. Remains 3449 /3917 variables (removed 468) and now considering 9169/9637 (removed 468) transitions.
[2024-06-01 00:39:24] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
// Phase 1: matrix 8297 rows 3449 cols
[2024-06-01 00:39:24] [INFO ] Computed 666 invariants in 146 ms
[2024-06-01 00:39:32] [INFO ] Implicit Places using invariants in 7501 ms returned [6, 8, 12, 18, 27, 37, 49, 63, 79, 97, 117, 139, 162, 184, 204, 222, 238, 252, 264, 274, 282, 289, 293, 295, 312, 315, 317, 323, 330, 338, 348, 360, 374, 390, 408, 428, 449, 470, 488, 504, 518, 530, 540, 548, 554, 561, 563, 565, 575, 577, 579, 581, 586, 592, 600, 610, 622, 636, 652, 670, 689, 707, 723, 737, 749, 759, 767, 773, 777, 780, 782, 784, 792, 794, 796, 798, 801, 805, 811, 819, 829, 841, 855, 871, 888, 904, 918, 930, 940, 948, 955, 959, 961, 963, 965, 967, 976, 978, 980, 982, 984, 986, 990, 996, 1004, 1014, 1026, 1040, 1055, 1069, 1081, 1091, 1099, 1105, 1110, 1112, 1114, 1116, 1118, 1120, 1128, 1130, 1132, 1134, 1136, 1138, 1140, 1144, 1150, 1158, 1168, 1180, 1193, 1205, 1215, 1223, 1229, 1233, 1235, 1237, 1239, 1241, 1243, 1245, 1253, 1255, 1257, 1259, 1261, 1263, 1265, 1267, 1271, 1277, 1285, 1295, 1306, 1316, 1324, 1330, 1334, 1336, 1338, 1340, 1342, 1344, 1346, 1348, 1357, 1359, 1361, 1363, 1365, 1367, 1369, 1371, 1373, 1377, 1383, 1391, 1400, 1410, 1416, 1420, 1422, 1426, 1428, 1430, 1432, 1434, 1436, 1438, 1447, 1449, 1451, 1453, 1455, 1457, 1459, 1461, 1463, 1465, 1469, 1475, 1482, 1488, 1492, 1494, 1496, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1518, 1520, 1522, 1524, 1526, 1528, 1530, 1532, 1534, 1536, 1538, 1542, 1547, 1551, 1553, 1555, 1557, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1579, 1581, 1583, 1585, 1587, 1589, 1591, 1593, 1595, 1597, 1599, 1601, 1604, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1625, 1627, 1635, 1637, 1639, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1662, 1664, 1666, 1668, 1670, 1672, 1674, 1676, 1678, 1680, 1682, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1702, 1704, 1706, 1708, 1710, 1712, 1714, 1716, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1763, 1765, 1767, 1769, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1785, 1787, 1795, 1797, 1799, 1801, 1803, 1805, 1807, 1809, 1812, 1814, 1816, 1818, 1820, 1823, 1825, 1827, 1829, 1831, 1833, 1835, 1837, 1839, 1841, 1843, 1851, 1853, 1855, 1857, 1859, 1861, 1863, 1865, 1867, 1869, 1871, 1873, 1877, 1883, 1887, 1889, 1891, 1893, 1895, 1898, 1900, 1902, 1904, 1906, 1916, 1918, 1920, 1922, 1924, 1926, 1928, 1930, 1932, 1934, 1936, 1940, 1946, 1953, 1959, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1987, 1989, 1991, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2009, 2015, 2023, 2032, 2040, 2046, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2072, 2075, 2077, 2080, 2082, 2084, 2086, 2088, 2090, 2094, 2100, 2108, 2118, 2129, 2139, 2147, 2153, 2157, 2159, 2161, 2163, 2165, 2167, 2169, 2179, 2181, 2183, 2185, 2187, 2189, 2191, 2193, 2197, 2203, 2211, 2221, 2233, 2247, 2259, 2269, 2277, 2283, 2287, 2289, 2291, 2293, 2295, 2298, 2308, 2310, 2312, 2314, 2316, 2318, 2320, 2324, 2330, 2338, 2348, 2360, 2374, 2389, 2403, 2415, 2425, 2433, 2439, 2443, 2445, 2447, 2449, 2451, 2460, 2462, 2464, 2466, 2468, 2471, 2475, 2481, 2489, 2499, 2511, 2525, 2541, 2558, 2574, 2588, 2600, 2610, 2618, 2624, 2628, 2630, 2632, 2634, 2642, 2644, 2646, 2648, 2650, 2655, 2661, 2669, 2679, 2691, 2705, 2721, 2739, 2758, 2776, 2792, 2806, 2818, 2828, 2836, 2842, 2846, 2849, 2851, 2859, 2861, 2863, 2865, 2869, 2876, 2884, 2894, 2906, 2920, 2936, 2954, 2974, 2995, 3015, 3033, 3049, 3063, 3075, 3085, 3093, 3099, 3104, 3106, 3112, 3115, 3117, 3122, 3128, 3137, 3147, 3159, 3173, 3189, 3207, 3227, 3249, 3272, 3294, 3314, 3332, 3348, 3362, 3374, 3384, 3392, 3399, 3403]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 7521 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2849/4188 places, 9169/9637 transitions.
Applied a total of 0 rules in 500 ms. Remains 2849 /2849 variables (removed 0) and now considering 9169/9169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 20857 ms. Remains : 2849/4188 places, 9169/9637 transitions.
RANDOM walk for 40000 steps (1352 resets) in 1370 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (91 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (103 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (124 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 27738 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 3
Probabilistic random walk after 27738 steps, saw 11764 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-06-01 00:39:36] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
// Phase 1: matrix 8297 rows 2849 cols
[2024-06-01 00:39:36] [INFO ] Computed 66 invariants in 147 ms
[2024-06-01 00:39:36] [INFO ] State equation strengthened by 4958 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2731/2776 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2776 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/2781 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2781 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 38/2819 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2819 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/2845 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2845 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/2849 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2849 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 8297/11146 variables, 2849/2915 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11146 variables, 4958/7873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11146 variables, 0/7873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/11146 variables, 0/7873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11146/11146 variables, and 7873 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7572 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 2849/2849 constraints, ReadFeed: 4958/4958 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2731/2776 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:39:46] [INFO ] Deduced a trap composed of 241 places in 1959 ms of which 18 ms to minimize.
[2024-06-01 00:39:48] [INFO ] Deduced a trap composed of 137 places in 2049 ms of which 18 ms to minimize.
[2024-06-01 00:39:50] [INFO ] Deduced a trap composed of 121 places in 2044 ms of which 18 ms to minimize.
[2024-06-01 00:39:52] [INFO ] Deduced a trap composed of 110 places in 2048 ms of which 17 ms to minimize.
[2024-06-01 00:39:54] [INFO ] Deduced a trap composed of 169 places in 2025 ms of which 18 ms to minimize.
[2024-06-01 00:39:56] [INFO ] Deduced a trap composed of 139 places in 2021 ms of which 18 ms to minimize.
[2024-06-01 00:39:58] [INFO ] Deduced a trap composed of 131 places in 2032 ms of which 19 ms to minimize.
[2024-06-01 00:40:00] [INFO ] Deduced a trap composed of 139 places in 2041 ms of which 17 ms to minimize.
[2024-06-01 00:40:02] [INFO ] Deduced a trap composed of 1003 places in 2066 ms of which 17 ms to minimize.
[2024-06-01 00:40:04] [INFO ] Deduced a trap composed of 136 places in 1957 ms of which 19 ms to minimize.
[2024-06-01 00:40:06] [INFO ] Deduced a trap composed of 128 places in 2021 ms of which 18 ms to minimize.
[2024-06-01 00:40:08] [INFO ] Deduced a trap composed of 121 places in 1980 ms of which 18 ms to minimize.
[2024-06-01 00:40:10] [INFO ] Deduced a trap composed of 130 places in 1909 ms of which 16 ms to minimize.
[2024-06-01 00:40:13] [INFO ] Deduced a trap composed of 125 places in 2041 ms of which 18 ms to minimize.
[2024-06-01 00:40:15] [INFO ] Deduced a trap composed of 128 places in 1974 ms of which 17 ms to minimize.
[2024-06-01 00:40:17] [INFO ] Deduced a trap composed of 190 places in 1978 ms of which 18 ms to minimize.
[2024-06-01 00:40:19] [INFO ] Deduced a trap composed of 108 places in 1966 ms of which 17 ms to minimize.
[2024-06-01 00:40:21] [INFO ] Deduced a trap composed of 138 places in 2019 ms of which 17 ms to minimize.
[2024-06-01 00:40:23] [INFO ] Deduced a trap composed of 141 places in 2105 ms of which 18 ms to minimize.
[2024-06-01 00:40:25] [INFO ] Deduced a trap composed of 138 places in 2094 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2776 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:40:27] [INFO ] Deduced a trap composed of 126 places in 2044 ms of which 18 ms to minimize.
[2024-06-01 00:40:29] [INFO ] Deduced a trap composed of 126 places in 2011 ms of which 18 ms to minimize.
[2024-06-01 00:40:31] [INFO ] Deduced a trap composed of 121 places in 2034 ms of which 18 ms to minimize.
[2024-06-01 00:40:33] [INFO ] Deduced a trap composed of 130 places in 2005 ms of which 17 ms to minimize.
[2024-06-01 00:40:35] [INFO ] Deduced a trap composed of 125 places in 1987 ms of which 18 ms to minimize.
[2024-06-01 00:40:37] [INFO ] Deduced a trap composed of 117 places in 1995 ms of which 18 ms to minimize.
[2024-06-01 00:40:39] [INFO ] Deduced a trap composed of 1013 places in 1799 ms of which 19 ms to minimize.
[2024-06-01 00:40:41] [INFO ] Deduced a trap composed of 130 places in 2015 ms of which 18 ms to minimize.
[2024-06-01 00:40:43] [INFO ] Deduced a trap composed of 134 places in 2016 ms of which 18 ms to minimize.
[2024-06-01 00:40:45] [INFO ] Deduced a trap composed of 127 places in 1984 ms of which 17 ms to minimize.
[2024-06-01 00:40:47] [INFO ] Deduced a trap composed of 113 places in 2019 ms of which 18 ms to minimize.
[2024-06-01 00:40:49] [INFO ] Deduced a trap composed of 143 places in 2005 ms of which 17 ms to minimize.
[2024-06-01 00:40:51] [INFO ] Deduced a trap composed of 113 places in 2012 ms of which 17 ms to minimize.
[2024-06-01 00:40:54] [INFO ] Deduced a trap composed of 113 places in 2038 ms of which 18 ms to minimize.
[2024-06-01 00:40:56] [INFO ] Deduced a trap composed of 141 places in 2023 ms of which 18 ms to minimize.
[2024-06-01 00:40:58] [INFO ] Deduced a trap composed of 1017 places in 1877 ms of which 17 ms to minimize.
[2024-06-01 00:41:00] [INFO ] Deduced a trap composed of 1011 places in 1914 ms of which 17 ms to minimize.
[2024-06-01 00:41:02] [INFO ] Deduced a trap composed of 119 places in 2045 ms of which 18 ms to minimize.
[2024-06-01 00:41:04] [INFO ] Deduced a trap composed of 129 places in 1950 ms of which 18 ms to minimize.
[2024-06-01 00:41:06] [INFO ] Deduced a trap composed of 168 places in 1937 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2776 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:41:08] [INFO ] Deduced a trap composed of 152 places in 1982 ms of which 18 ms to minimize.
[2024-06-01 00:41:10] [INFO ] Deduced a trap composed of 140 places in 2007 ms of which 19 ms to minimize.
[2024-06-01 00:41:12] [INFO ] Deduced a trap composed of 122 places in 2025 ms of which 17 ms to minimize.
[2024-06-01 00:41:14] [INFO ] Deduced a trap composed of 123 places in 1984 ms of which 18 ms to minimize.
SMT process timed out in 98286ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 2849 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2849/2849 places, 9169/9169 transitions.
Applied a total of 0 rules in 514 ms. Remains 2849 /2849 variables (removed 0) and now considering 9169/9169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 2849/2849 places, 9169/9169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2849/2849 places, 9169/9169 transitions.
Applied a total of 0 rules in 505 ms. Remains 2849 /2849 variables (removed 0) and now considering 9169/9169 (removed 0) transitions.
[2024-06-01 00:41:15] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
[2024-06-01 00:41:15] [INFO ] Invariant cache hit.
[2024-06-01 00:41:19] [INFO ] Implicit Places using invariants in 4472 ms returned []
[2024-06-01 00:41:19] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
[2024-06-01 00:41:19] [INFO ] Invariant cache hit.
[2024-06-01 00:41:22] [INFO ] State equation strengthened by 4958 read => feed constraints.
[2024-06-01 00:41:52] [INFO ] Performed 521/2849 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:42:23] [INFO ] Performed 1110/2849 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:42:53] [INFO ] Performed 1359/2849 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-01 00:43:23] [INFO ] Performed 1575/2849 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-06-01 00:43:23] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-06-01 00:43:23] [INFO ] Implicit Places using invariants and state equation in 123767 ms returned []
Implicit Place search using SMT with State Equation took 128243 ms to find 0 implicit places.
[2024-06-01 00:43:24] [INFO ] Redundant transitions in 1106 ms returned []
Running 9075 sub problems to find dead transitions.
[2024-06-01 00:43:24] [INFO ] Flow matrix only has 8297 transitions (discarded 872 similar events)
[2024-06-01 00:43:24] [INFO ] Invariant cache hit.
[2024-06-01 00:43:24] [INFO ] State equation strengthened by 4958 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2847 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9075 unsolved
SMT process timed out in 78644ms, After SMT, problems are : Problem set: 0 solved, 9075 unsolved
Search for dead transitions found 0 dead transitions in 78748ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208647 ms. Remains : 2849/2849 places, 9169/9169 transitions.
[2024-06-01 00:44:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 00:44:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2849 places, 9169 transitions and 44788 arcs took 41 ms.
[2024-06-01 00:44:44] [INFO ] Flatten gal took : 510 ms
Total runtime 517878 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-S24C05-ReachabilityFireability-2024-00
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-05
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2023-10

BK_STOP 1717202684644

--------------------
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-S24C05-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/896/inv_0_
rfs formula name MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/896/inv_1_
rfs formula name MultiCrashLeafsetExtension-PT-S24C05-ReachabilityFireability-2023-10
rfs formula type EF
rfs formula formula --invariant=/tmp/896/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C05"
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-S24C05, 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-171654350900087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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