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.r579-smll-171734921400150.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 MedleyA-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 184K Jun 2 16:33 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 MedleyA-PT-19-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-19-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717362773543

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:12:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:12:56] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2024-06-02 21:12:56] [INFO ] Transformed 272 places.
[2024-06-02 21:12:56] [INFO ] Transformed 586 transitions.
[2024-06-02 21:12:56] [INFO ] Found NUPN structural information;
[2024-06-02 21:12:56] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 609 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3 places in 16 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (17 resets) in 3169 ms. (12 steps per ms) remains 12/14 properties
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (11 resets) in 523 ms. (76 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (12 resets) in 367 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (20 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (13 resets) in 862 ms. (46 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (18 resets) in 442 ms. (90 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (38 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (16 resets) in 223 ms. (178 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (17 resets) in 238 ms. (167 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (21 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (15 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (25 resets) in 292 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
// Phase 1: matrix 583 rows 269 cols
[2024-06-02 21:12:59] [INFO ] Computed 24 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 59/209 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 59/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 60/269 variables, 14/233 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 60/293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 583/852 variables, 269/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/852 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 562 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1991 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 59/209 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 59/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 21:13:02] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 26 ms to minimize.
[2024-06-02 21:13:02] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 5 ms to minimize.
[2024-06-02 21:13:02] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 3 ms to minimize.
[2024-06-02 21:13:02] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
[2024-06-02 21:13:03] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:13:03] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 2 ms to minimize.
[2024-06-02 21:13:03] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:13:03] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
Problem MedleyA-PT-19-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 8/227 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-02 21:13:03] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 60/269 variables, 14/242 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 60/302 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-06-02 21:13:04] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 2 ms to minimize.
[2024-06-02 21:13:04] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:13:04] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 3 ms to minimize.
[2024-06-02 21:13:04] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:13:04] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 2 ms to minimize.
[2024-06-02 21:13:04] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 2 ms to minimize.
[2024-06-02 21:13:05] [INFO ] Deduced a trap composed of 56 places in 335 ms of which 4 ms to minimize.
[2024-06-02 21:13:05] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 3 ms to minimize.
Problem MedleyA-PT-19-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-02 21:13:05] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:13:05] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 2 ms to minimize.
[2024-06-02 21:13:06] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 2 ms to minimize.
[2024-06-02 21:13:06] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 4 ms to minimize.
[2024-06-02 21:13:06] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 4 ms to minimize.
SMT process timed out in 7437ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 139 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 583/583 transitions.
Graph (complete) has 909 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 268 transition count 576
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 16 rules applied. Total rules applied 24 place count 261 transition count 567
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 33 place count 253 transition count 566
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 33 place count 253 transition count 561
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 43 place count 248 transition count 561
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 63 place count 228 transition count 538
Iterating global reduction 3 with 20 rules applied. Total rules applied 83 place count 228 transition count 538
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 99 place count 220 transition count 530
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 107 place count 216 transition count 564
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 119 place count 216 transition count 552
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 135 place count 216 transition count 536
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 216 transition count 533
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 141 place count 213 transition count 533
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 147 place count 213 transition count 533
Applied a total of 147 rules in 335 ms. Remains 213 /269 variables (removed 56) and now considering 533/583 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 213/269 places, 533/583 transitions.
RANDOM walk for 40000 steps (19 resets) in 816 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (13 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (19 resets) in 282 ms. (141 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (14 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (10 resets) in 209 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (32 resets) in 233 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (11 resets) in 274 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (17 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (21 resets) in 305 ms. (130 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (22 resets) in 224 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (14 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 296939 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :1 out of 10
Probabilistic random walk after 296939 steps, saw 61001 distinct states, run finished after 3006 ms. (steps per millisecond=98 ) properties seen :1
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 533 rows 213 cols
[2024-06-02 21:13:11] [INFO ] Computed 23 invariants in 6 ms
[2024-06-02 21:13:11] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 55/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 45/210 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 531/741 variables, 210/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 78/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 5/746 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/746 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/746 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 314 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 213/213 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 55/165 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:13] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:13:13] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 45/210 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:13] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 4 ms to minimize.
[2024-06-02 21:13:14] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 4 ms to minimize.
[2024-06-02 21:13:14] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 2 ms to minimize.
[2024-06-02 21:13:14] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:13:14] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-06-02 21:13:14] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
[2024-06-02 21:13:14] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:13:14] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:13:14] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:15] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:15] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 7 ms to minimize.
[2024-06-02 21:13:15] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:13:15] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:13:15] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:13:15] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 531/741 variables, 210/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/741 variables, 78/328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/741 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:16] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/741 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:17] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/741 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:17] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/741 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/741 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 5/746 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/746 variables, 7/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:19] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/746 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:20] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 3 ms to minimize.
[2024-06-02 21:13:20] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 3 ms to minimize.
[2024-06-02 21:13:21] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2024-06-02 21:13:21] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 4 ms to minimize.
[2024-06-02 21:13:21] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/746 variables, 5/349 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:22] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/746 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:24] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 3 ms to minimize.
[2024-06-02 21:13:24] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 4 ms to minimize.
[2024-06-02 21:13:24] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 3 ms to minimize.
[2024-06-02 21:13:25] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 4 ms to minimize.
[2024-06-02 21:13:25] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 3 ms to minimize.
[2024-06-02 21:13:25] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/746 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:26] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-06-02 21:13:27] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 5 ms to minimize.
[2024-06-02 21:13:27] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/746 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:28] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2024-06-02 21:13:28] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/746 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:29] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/746 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/746 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:31] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-02 21:13:31] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:13:31] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 4 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/746 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:32] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-06-02 21:13:32] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/746 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/746 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:34] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 3 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/746 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:35] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 3 ms to minimize.
[2024-06-02 21:13:36] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 3 ms to minimize.
[2024-06-02 21:13:36] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 3 ms to minimize.
[2024-06-02 21:13:36] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 3 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/746 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/746 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:39] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
At refinement iteration 32 (OVERLAPS) 0/746 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/746 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 21:13:40] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 2 ms to minimize.
At refinement iteration 34 (OVERLAPS) 0/746 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/746 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 0/746 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 746/746 variables, and 374 constraints, problems are : Problem set: 0 solved, 9 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 213/213 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 51/51 constraints]
After SMT, in 31699ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 11276 ms.
Support contains 91 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 533/533 transitions.
Graph (complete) has 780 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 211 transition count 526
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 206 transition count 523
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 203 transition count 523
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 203 transition count 521
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 201 transition count 521
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 30 place count 192 transition count 509
Iterating global reduction 3 with 9 rules applied. Total rules applied 39 place count 192 transition count 509
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 67 place count 178 transition count 495
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 177 transition count 508
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 84 place count 177 transition count 493
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 177 transition count 487
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 96 place count 171 transition count 487
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 171 transition count 484
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 102 place count 168 transition count 484
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 168 transition count 484
Applied a total of 103 rules in 105 ms. Remains 168 /213 variables (removed 45) and now considering 484/533 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 168/213 places, 484/533 transitions.
RANDOM walk for 40000 steps (19 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (16 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (24 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (11 resets) in 201 ms. (198 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (10 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (15 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (21 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 444885 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 6
Probabilistic random walk after 444885 steps, saw 90158 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
// Phase 1: matrix 484 rows 168 cols
[2024-06-02 21:13:57] [INFO ] Computed 23 invariants in 6 ms
[2024-06-02 21:13:57] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 40/131 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 36/167 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 484/651 variables, 167/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 117/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/652 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/652 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/652 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 308 constraints, problems are : Problem set: 0 solved, 6 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 168/168 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 40/131 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 36/167 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:13:58] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:13:58] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-06-02 21:13:59] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 2 ms to minimize.
[2024-06-02 21:14:00] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:14:00] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:14:00] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 484/651 variables, 167/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/651 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/652 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/652 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:14:02] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/652 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/652 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/652 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 327 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4699 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 168/168 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 5487ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3528 ms.
Support contains 80 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 484/484 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 168 transition count 483
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 167 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 166 transition count 482
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 165 transition count 481
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 165 transition count 481
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 161 transition count 477
Applied a total of 14 rules in 41 ms. Remains 161 /168 variables (removed 7) and now considering 477/484 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 161/168 places, 477/484 transitions.
RANDOM walk for 40000 steps (21 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (10 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (27 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (22 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (25 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (15 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 448131 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 5
Probabilistic random walk after 448131 steps, saw 88638 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
// Phase 1: matrix 477 rows 161 cols
[2024-06-02 21:14:10] [INFO ] Computed 23 invariants in 10 ms
[2024-06-02 21:14:10] [INFO ] State equation strengthened by 141 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 42/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/160 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 477/637 variables, 160/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 141/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/638 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/638 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 638/638 variables, and 325 constraints, problems are : Problem set: 0 solved, 5 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 161/161 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 42/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 38/160 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 21:14:11] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:14:11] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 3 ms to minimize.
[2024-06-02 21:14:11] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 2 ms to minimize.
[2024-06-02 21:14:11] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:14:12] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:14:12] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2024-06-02 21:14:12] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 2 ms to minimize.
[2024-06-02 21:14:12] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 3 ms to minimize.
[2024-06-02 21:14:13] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 3 ms to minimize.
[2024-06-02 21:14:13] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
[2024-06-02 21:14:13] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 3 ms to minimize.
[2024-06-02 21:14:13] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 477/637 variables, 160/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 141/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 21:14:14] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/638 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/638 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 21:14:15] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/638 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 21:14:16] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 3 ms to minimize.
[2024-06-02 21:14:16] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/638 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 21:14:17] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/638 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/638 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 638/638 variables, and 347 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6965 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 161/161 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 17/17 constraints]
After SMT, in 7788ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3668 ms.
Support contains 67 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 477/477 transitions.
Graph (complete) has 662 edges and 161 vertex of which 159 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 159 transition count 473
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 157 transition count 470
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 154 transition count 470
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 149 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 148 transition count 467
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 148 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 147 transition count 466
Applied a total of 25 rules in 40 ms. Remains 147 /161 variables (removed 14) and now considering 466/477 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 147/161 places, 466/477 transitions.
RANDOM walk for 40000 steps (26 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (11 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (15 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (15 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (34 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 492406 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 4
Probabilistic random walk after 492406 steps, saw 99312 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2024-06-02 21:14:25] [INFO ] Flow matrix only has 454 transitions (discarded 12 similar events)
// Phase 1: matrix 454 rows 147 cols
[2024-06-02 21:14:25] [INFO ] Computed 23 invariants in 5 ms
[2024-06-02 21:14:25] [INFO ] State equation strengthened by 143 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 40/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/146 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 454/600 variables, 146/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 143/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/601 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/601 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 313 constraints, problems are : Problem set: 0 solved, 4 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 40/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/146 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:14:25] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-06-02 21:14:26] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 2 ms to minimize.
[2024-06-02 21:14:26] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
[2024-06-02 21:14:26] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:14:26] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
[2024-06-02 21:14:26] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 2 ms to minimize.
[2024-06-02 21:14:27] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 3 ms to minimize.
[2024-06-02 21:14:27] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-06-02 21:14:27] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 2 ms to minimize.
[2024-06-02 21:14:27] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 2 ms to minimize.
[2024-06-02 21:14:27] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:14:28] [INFO ] Deduced a trap composed of 36 places in 238 ms of which 3 ms to minimize.
[2024-06-02 21:14:28] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 2 ms to minimize.
[2024-06-02 21:14:28] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:14:28] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 2 ms to minimize.
[2024-06-02 21:14:28] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 454/600 variables, 146/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 143/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:14:29] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:14:29] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-06-02 21:14:29] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/601 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:14:30] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/601 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/601 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 337 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5925 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 20/20 constraints]
After SMT, in 6435ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2024 ms.
Support contains 67 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 466/466 transitions.
Applied a total of 0 rules in 9 ms. Remains 147 /147 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 147/147 places, 466/466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 466/466 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 466/466 (removed 0) transitions.
[2024-06-02 21:14:33] [INFO ] Flow matrix only has 454 transitions (discarded 12 similar events)
[2024-06-02 21:14:33] [INFO ] Invariant cache hit.
[2024-06-02 21:14:33] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 21:14:33] [INFO ] Flow matrix only has 454 transitions (discarded 12 similar events)
[2024-06-02 21:14:33] [INFO ] Invariant cache hit.
[2024-06-02 21:14:33] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-06-02 21:14:34] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-06-02 21:14:34] [INFO ] Redundant transitions in 119 ms returned []
Running 464 sub problems to find dead transitions.
[2024-06-02 21:14:34] [INFO ] Flow matrix only has 454 transitions (discarded 12 similar events)
[2024-06-02 21:14:34] [INFO ] Invariant cache hit.
[2024-06-02 21:14:34] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/147 variables, 9/23 constraints. Problems are: Problem set: 124 solved, 340 unsolved
[2024-06-02 21:14:41] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-06-02 21:14:41] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 3 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-06-02 21:14:42] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:14:43] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-06-02 21:14:43] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:14:43] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-06-02 21:14:43] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:14:43] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:14:43] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:14:44] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:14:44] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:14:44] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:14:44] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-06-02 21:14:44] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:14:45] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 20/43 constraints. Problems are: Problem set: 124 solved, 340 unsolved
[2024-06-02 21:14:48] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:14:48] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:14:48] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:14:48] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:14:49] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
Problem TDEAD306 is UNSAT
[2024-06-02 21:14:50] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 6/49 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/49 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 6 (OVERLAPS) 454/601 variables, 147/196 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 143/339 constraints. Problems are: Problem set: 125 solved, 339 unsolved
[2024-06-02 21:15:03] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 1/340 constraints. Problems are: Problem set: 125 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/601 variables, and 340 constraints, problems are : Problem set: 125 solved, 339 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 125 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 14/14 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/14 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 2/147 variables, 9/23 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 27/50 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/50 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 5 (OVERLAPS) 454/601 variables, 147/197 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 143/340 constraints. Problems are: Problem set: 125 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 339/679 constraints. Problems are: Problem set: 125 solved, 339 unsolved
[2024-06-02 21:15:18] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:15:18] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-06-02 21:15:19] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-06-02 21:15:23] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:15:23] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:15:26] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:15:27] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-06-02 21:15:27] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 8/687 constraints. Problems are: Problem set: 125 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 687 constraints, problems are : Problem set: 125 solved, 339 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 339/464 constraints, Known Traps: 35/35 constraints]
After SMT, in 61948ms problems are : Problem set: 125 solved, 339 unsolved
Search for dead transitions found 125 dead transitions in 61962ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 147/147 places, 341/466 transitions.
Applied a total of 0 rules in 11 ms. Remains 147 /147 variables (removed 0) and now considering 341/341 (removed 0) transitions.
[2024-06-02 21:15:36] [INFO ] Redundant transitions in 69 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62781 ms. Remains : 147/147 places, 341/466 transitions.
RANDOM walk for 40000 steps (13 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (14 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (17 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (25 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (21 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 504894 steps, run timeout after 3004 ms. (steps per millisecond=168 ) properties seen :0 out of 4
Probabilistic random walk after 504894 steps, saw 101771 distinct states, run finished after 3004 ms. (steps per millisecond=168 ) properties seen :0
// Phase 1: matrix 341 rows 147 cols
[2024-06-02 21:15:39] [INFO ] Computed 23 invariants in 3 ms
[2024-06-02 21:15:39] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 40/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/146 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 341/487 variables, 146/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 73/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/488 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/488 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 243 constraints, problems are : Problem set: 0 solved, 4 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 40/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:15:40] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 39/146 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:15:40] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:15:40] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-06-02 21:15:40] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:15:40] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:15:41] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 3 ms to minimize.
[2024-06-02 21:15:41] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:15:41] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 341/487 variables, 146/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 73/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:15:41] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:15:41] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/488 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:15:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/488 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 21:15:42] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:15:42] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/488 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/488 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 260 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2970 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 3362ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 2102 ms.
Support contains 10 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 341/341 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 147 transition count 331
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 137 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 137 transition count 329
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 135 transition count 329
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 39 place count 120 transition count 312
Iterating global reduction 2 with 15 rules applied. Total rules applied 54 place count 120 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 54 place count 120 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 119 transition count 311
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 97 place count 97 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 97 transition count 290
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 109 place count 92 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 143 place count 92 transition count 292
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 92 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 91 transition count 291
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 154 place count 91 transition count 395
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 192 place count 82 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 82 transition count 365
Applied a total of 193 rules in 57 ms. Remains 82 /147 variables (removed 65) and now considering 365/341 (removed -24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 82/147 places, 365/341 transitions.
RANDOM walk for 40000 steps (3244 resets) in 1185 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (392 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (521 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1071800 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :1 out of 2
Probabilistic random walk after 1071800 steps, saw 191175 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :1
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 21:15:48] [INFO ] Flow matrix only has 361 transitions (discarded 4 similar events)
// Phase 1: matrix 361 rows 82 cols
[2024-06-02 21:15:48] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 21:15:48] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/71 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/81 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 361/442 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 138/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/443 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/443 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 240 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 82/82 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/71 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:15:48] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/81 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:15:49] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
Problem MedleyA-PT-19-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 81/443 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/82 constraints, ReadFeed: 0/138 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 437ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 173038 ms.
ITS solved all properties within timeout

BK_STOP 1717362949241

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-19"
export BK_EXAMINATION="ReachabilityCardinality"
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 MedleyA-PT-19, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921400150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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