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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 238K 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-22-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717365285792

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-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:54:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:54:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:54:48] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2024-06-02 21:54:48] [INFO ] Transformed 307 places.
[2024-06-02 21:54:48] [INFO ] Transformed 740 transitions.
[2024-06-02 21:54:48] [INFO ] Found NUPN structural information;
[2024-06-02 21:54:48] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1157 resets) in 3574 ms. (11 steps per ms) remains 9/11 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (245 resets) in 608 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (239 resets) in 356 ms. (112 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (243 resets) in 1395 ms. (28 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (271 resets) in 243 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (242 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (230 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (288 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (248 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (256 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
// Phase 1: matrix 740 rows 307 cols
[2024-06-02 21:54:51] [INFO ] Computed 24 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 106/235 variables, 10/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 106/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 72/307 variables, 14/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 72/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 740/1047 variables, 307/638 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 638 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2169 ms.
Refiners :[Domain max(s): 307/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 106/235 variables, 10/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 106/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 21:54:54] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 21:54:54] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 72/307 variables, 14/261 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 72/333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 21:54:55] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-06-02 21:54:55] [INFO ] Deduced a trap composed of 83 places in 206 ms of which 3 ms to minimize.
[2024-06-02 21:54:55] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 2 ms to minimize.
[2024-06-02 21:54:55] [INFO ] Deduced a trap composed of 54 places in 335 ms of which 4 ms to minimize.
[2024-06-02 21:54:56] [INFO ] Deduced a trap composed of 44 places in 454 ms of which 5 ms to minimize.
[2024-06-02 21:54:56] [INFO ] Deduced a trap composed of 55 places in 466 ms of which 4 ms to minimize.
[2024-06-02 21:54:57] [INFO ] Deduced a trap composed of 32 places in 417 ms of which 5 ms to minimize.
[2024-06-02 21:54:57] [INFO ] Deduced a trap composed of 66 places in 327 ms of which 5 ms to minimize.
[2024-06-02 21:54:58] [INFO ] Deduced a trap composed of 46 places in 422 ms of which 5 ms to minimize.
[2024-06-02 21:54:58] [INFO ] Deduced a trap composed of 48 places in 416 ms of which 5 ms to minimize.
[2024-06-02 21:54:59] [INFO ] Deduced a trap composed of 74 places in 419 ms of which 4 ms to minimize.
SMT process timed out in 7852ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 129 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 305 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 305 transition count 735
Reduce places removed 4 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 301 transition count 727
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 27 place count 293 transition count 726
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 27 place count 293 transition count 723
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 33 place count 290 transition count 723
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 76 place count 247 transition count 675
Iterating global reduction 3 with 43 rules applied. Total rules applied 119 place count 247 transition count 675
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 123 place count 247 transition count 671
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 246 transition count 670
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 246 transition count 670
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 145 place count 236 transition count 660
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 235 transition count 670
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 162 place count 235 transition count 655
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 234 transition count 654
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 234 transition count 648
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 176 place count 228 transition count 648
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 180 place count 228 transition count 649
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 184 place count 224 transition count 649
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 193 place count 224 transition count 649
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 194 place count 224 transition count 648
Applied a total of 194 rules in 468 ms. Remains 224 /307 variables (removed 83) and now considering 648/740 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 224/307 places, 648/740 transitions.
RANDOM walk for 40000 steps (1339 resets) in 810 ms. (49 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (283 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (283 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (321 resets) in 153 ms. (259 steps per ms) remains 6/7 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (279 resets) in 212 ms. (187 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (275 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (312 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (295 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
// Phase 1: matrix 648 rows 224 cols
[2024-06-02 21:55:00] [INFO ] Computed 23 invariants in 6 ms
[2024-06-02 21:55:00] [INFO ] State equation strengthened by 103 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 69/163 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 52/215 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/217 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 644/861 variables, 217/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 103/343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/861 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 10/871 variables, 6/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/871 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/872 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/872 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/872 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 872/872 variables, and 350 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1589 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 224/224 constraints, ReadFeed: 103/103 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/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 69/163 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 52/215 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:55:02] [INFO ] Deduced a trap composed of 35 places in 342 ms of which 4 ms to minimize.
[2024-06-02 21:55:02] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 4 ms to minimize.
[2024-06-02 21:55:03] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 4 ms to minimize.
[2024-06-02 21:55:03] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 4 ms to minimize.
[2024-06-02 21:55:04] [INFO ] Deduced a trap composed of 25 places in 383 ms of which 5 ms to minimize.
[2024-06-02 21:55:04] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 3 ms to minimize.
[2024-06-02 21:55:04] [INFO ] Deduced a trap composed of 54 places in 361 ms of which 4 ms to minimize.
[2024-06-02 21:55:05] [INFO ] Deduced a trap composed of 48 places in 306 ms of which 3 ms to minimize.
[2024-06-02 21:55:05] [INFO ] Deduced a trap composed of 28 places in 333 ms of which 4 ms to minimize.
[2024-06-02 21:55:05] [INFO ] Deduced a trap composed of 46 places in 346 ms of which 3 ms to minimize.
[2024-06-02 21:55:06] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-06-02 21:55:06] [INFO ] Deduced a trap composed of 52 places in 269 ms of which 3 ms to minimize.
[2024-06-02 21:55:06] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 2 ms to minimize.
[2024-06-02 21:55:06] [INFO ] Deduced a trap composed of 48 places in 260 ms of which 2 ms to minimize.
[2024-06-02 21:55:07] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 2 ms to minimize.
[2024-06-02 21:55:07] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 2 ms to minimize.
[2024-06-02 21:55:07] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 2 ms to minimize.
[2024-06-02 21:55:07] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 2 ms to minimize.
[2024-06-02 21:55:07] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
[2024-06-02 21:55:08] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:55:08] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-06-02 21:55:08] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 7 ms to minimize.
[2024-06-02 21:55:08] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 2 ms to minimize.
[2024-06-02 21:55:09] [INFO ] Deduced a trap composed of 50 places in 319 ms of which 4 ms to minimize.
[2024-06-02 21:55:09] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 4 ms to minimize.
[2024-06-02 21:55:09] [INFO ] Deduced a trap composed of 28 places in 319 ms of which 4 ms to minimize.
[2024-06-02 21:55:10] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 4 ms to minimize.
[2024-06-02 21:55:10] [INFO ] Deduced a trap composed of 20 places in 322 ms of which 3 ms to minimize.
[2024-06-02 21:55:10] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 4 ms to minimize.
[2024-06-02 21:55:10] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:55:11] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:55:11] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/217 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 644/861 variables, 217/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/861 variables, 103/375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:55:12] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 3 ms to minimize.
[2024-06-02 21:55:13] [INFO ] Deduced a trap composed of 24 places in 459 ms of which 3 ms to minimize.
[2024-06-02 21:55:13] [INFO ] Deduced a trap composed of 72 places in 338 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/861 variables, 3/379 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/861 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 10/871 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/871 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:55:15] [INFO ] Deduced a trap composed of 57 places in 235 ms of which 1 ms to minimize.
[2024-06-02 21:55:15] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2024-06-02 21:55:15] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2024-06-02 21:55:16] [INFO ] Deduced a trap composed of 50 places in 268 ms of which 3 ms to minimize.
[2024-06-02 21:55:16] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/871 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:55:17] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-06-02 21:55:18] [INFO ] Deduced a trap composed of 60 places in 334 ms of which 3 ms to minimize.
[2024-06-02 21:55:18] [INFO ] Deduced a trap composed of 58 places in 369 ms of which 5 ms to minimize.
[2024-06-02 21:55:18] [INFO ] Deduced a trap composed of 53 places in 283 ms of which 3 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 4 ms to minimize.
[2024-06-02 21:55:19] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 3 ms to minimize.
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 48 places in 268 ms of which 3 ms to minimize.
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 29 places in 370 ms of which 4 ms to minimize.
[2024-06-02 21:55:20] [INFO ] Deduced a trap composed of 25 places in 361 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/871 variables, 9/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/871 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/872 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:55:22] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 2 ms to minimize.
[2024-06-02 21:55:22] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 4 ms to minimize.
[2024-06-02 21:55:23] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 3 ms to minimize.
[2024-06-02 21:55:23] [INFO ] Deduced a trap composed of 59 places in 290 ms of which 3 ms to minimize.
[2024-06-02 21:55:23] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/872 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 21:55:25] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 4 ms to minimize.
[2024-06-02 21:55:25] [INFO ] Deduced a trap composed of 28 places in 369 ms of which 4 ms to minimize.
[2024-06-02 21:55:25] [INFO ] Deduced a trap composed of 55 places in 295 ms of which 3 ms to minimize.
[2024-06-02 21:55:26] [INFO ] Deduced a trap composed of 41 places in 349 ms of which 4 ms to minimize.
[2024-06-02 21:55:26] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 4 ms to minimize.
[2024-06-02 21:55:27] [INFO ] Deduced a trap composed of 55 places in 353 ms of which 3 ms to minimize.
[2024-06-02 21:55:27] [INFO ] Deduced a trap composed of 53 places in 344 ms of which 4 ms to minimize.
[2024-06-02 21:55:27] [INFO ] Deduced a trap composed of 58 places in 231 ms of which 3 ms to minimize.
[2024-06-02 21:55:28] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/872 variables, 9/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/872 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/872 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 872/872 variables, and 419 constraints, problems are : Problem set: 0 solved, 6 unsolved in 28644 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 224/224 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 63/63 constraints]
After SMT, in 30424ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 10610 ms.
Support contains 62 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 648/648 transitions.
Graph (complete) has 1001 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 11 place count 221 transition count 636
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 15 rules applied. Total rules applied 26 place count 211 transition count 631
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 31 place count 206 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 31 place count 206 transition count 629
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 35 place count 204 transition count 629
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 49 place count 190 transition count 606
Iterating global reduction 3 with 14 rules applied. Total rules applied 63 place count 190 transition count 606
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 188 transition count 597
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 188 transition count 597
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 187 transition count 594
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 187 transition count 594
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 95 place count 174 transition count 581
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 171 transition count 577
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 171 transition count 577
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 105 place count 169 transition count 595
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 169 transition count 593
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 169 transition count 587
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 119 place count 163 transition count 587
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 125 place count 163 transition count 589
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 132 place count 157 transition count 588
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 133 place count 157 transition count 587
Applied a total of 133 rules in 160 ms. Remains 157 /224 variables (removed 67) and now considering 587/648 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 157/224 places, 587/648 transitions.
RANDOM walk for 40000 steps (2237 resets) in 826 ms. (48 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (466 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (462 resets) in 152 ms. (261 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (503 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 499529 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :1 out of 3
Probabilistic random walk after 499529 steps, saw 96877 distinct states, run finished after 3009 ms. (steps per millisecond=166 ) properties seen :1
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 21:55:44] [INFO ] Flow matrix only has 575 transitions (discarded 12 similar events)
// Phase 1: matrix 575 rows 157 cols
[2024-06-02 21:55:44] [INFO ] Computed 23 invariants in 4 ms
[2024-06-02 21:55:44] [INFO ] State equation strengthened by 185 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/153 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/155 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 575/730 variables, 155/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/730 variables, 185/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/730 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/732 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/732 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/732 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 732/732 variables, and 365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 157/157 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/153 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:55:45] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 2 ms to minimize.
[2024-06-02 21:55:46] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 2 ms to minimize.
[2024-06-02 21:55:46] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 2 ms to minimize.
[2024-06-02 21:55:46] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 2 ms to minimize.
[2024-06-02 21:55:46] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2024-06-02 21:55:46] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2024-06-02 21:55:47] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 2 ms to minimize.
[2024-06-02 21:55:47] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:55:47] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 2 ms to minimize.
[2024-06-02 21:55:47] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 2 ms to minimize.
[2024-06-02 21:55:48] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 2 ms to minimize.
[2024-06-02 21:55:48] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 2 ms to minimize.
[2024-06-02 21:55:48] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 2 ms to minimize.
[2024-06-02 21:55:48] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 2 ms to minimize.
[2024-06-02 21:55:48] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-06-02 21:55:49] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 2 ms to minimize.
[2024-06-02 21:55:49] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/155 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 575/730 variables, 155/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/730 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/730 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/732 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/732 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/732 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/732 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 732/732 variables, and 384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5434 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 157/157 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 6096ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 472 ms.
Support contains 56 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 587/587 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 157 transition count 586
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 156 transition count 586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 154 transition count 584
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 153 transition count 582
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 153 transition count 582
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 151 transition count 586
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 150 transition count 577
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 150 transition count 577
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 149 transition count 573
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 149 transition count 573
Applied a total of 16 rules in 70 ms. Remains 149 /157 variables (removed 8) and now considering 573/587 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 149/157 places, 573/587 transitions.
RANDOM walk for 40000 steps (2393 resets) in 471 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (505 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (509 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 481854 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 2
Probabilistic random walk after 481854 steps, saw 95999 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-06-02 21:55:54] [INFO ] Flow matrix only has 537 transitions (discarded 36 similar events)
// Phase 1: matrix 537 rows 149 cols
[2024-06-02 21:55:54] [INFO ] Computed 23 invariants in 9 ms
[2024-06-02 21:55:54] [INFO ] State equation strengthened by 193 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/101 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/145 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/147 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 537/684 variables, 147/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 193/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/686 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/686 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 149/149 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/101 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/145 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:55:55] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-06-02 21:55:55] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2024-06-02 21:55:55] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
[2024-06-02 21:55:55] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/147 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 537/684 variables, 147/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 193/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:55:56] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/686 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/686 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/686 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 686/686 variables, and 372 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2780 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 149/149 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 3205ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 322 ms.
Support contains 56 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 573/573 transitions.
Applied a total of 0 rules in 25 ms. Remains 149 /149 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 149/149 places, 573/573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 573/573 transitions.
Applied a total of 0 rules in 23 ms. Remains 149 /149 variables (removed 0) and now considering 573/573 (removed 0) transitions.
[2024-06-02 21:55:58] [INFO ] Flow matrix only has 537 transitions (discarded 36 similar events)
[2024-06-02 21:55:58] [INFO ] Invariant cache hit.
[2024-06-02 21:55:58] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-02 21:55:58] [INFO ] Flow matrix only has 537 transitions (discarded 36 similar events)
[2024-06-02 21:55:58] [INFO ] Invariant cache hit.
[2024-06-02 21:55:58] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-06-02 21:55:59] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2024-06-02 21:55:59] [INFO ] Redundant transitions in 58 ms returned []
Running 572 sub problems to find dead transitions.
[2024-06-02 21:55:59] [INFO ] Flow matrix only has 537 transitions (discarded 36 similar events)
[2024-06-02 21:55:59] [INFO ] Invariant cache hit.
[2024-06-02 21:55:59] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/148 variables, 9/23 constraints. Problems are: Problem set: 144 solved, 428 unsolved
[2024-06-02 21:56:09] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:56:09] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-06-02 21:56:09] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:56:10] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:56:10] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2024-06-02 21:56:10] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 2 ms to minimize.
[2024-06-02 21:56:10] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:56:10] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-06-02 21:56:10] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-06-02 21:56:11] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:56:12] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
Problem TDEAD290 is UNSAT
[2024-06-02 21:56:12] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-06-02 21:56:12] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 3 ms to minimize.
[2024-06-02 21:56:13] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
Problem TDEAD345 is UNSAT
[2024-06-02 21:56:13] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 2 ms to minimize.
Problem TDEAD489 is UNSAT
[2024-06-02 21:56:14] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 16/39 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/39 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 537/685 variables, 148/187 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/685 variables, 193/380 constraints. Problems are: Problem set: 147 solved, 425 unsolved
[2024-06-02 21:56:27] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/685 variables, 1/381 constraints. Problems are: Problem set: 147 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 685/686 variables, and 381 constraints, problems are : Problem set: 147 solved, 425 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 148/149 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 147 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 14/14 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 9/23 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 17/40 constraints. Problems are: Problem set: 147 solved, 425 unsolved
[2024-06-02 21:56:37] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/41 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/41 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 6 (OVERLAPS) 537/685 variables, 148/189 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/685 variables, 193/382 constraints. Problems are: Problem set: 147 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/685 variables, 424/806 constraints. Problems are: Problem set: 147 solved, 425 unsolved
[2024-06-02 21:56:53] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-06-02 21:56:53] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-06-02 21:56:54] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-06-02 21:56:54] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 3 ms to minimize.
[2024-06-02 21:56:54] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 3 ms to minimize.
[2024-06-02 21:56:55] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 3 ms to minimize.
[2024-06-02 21:56:55] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 2 ms to minimize.
[2024-06-02 21:57:01] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-02 21:57:01] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 685/686 variables, and 815 constraints, problems are : Problem set: 147 solved, 425 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 148/149 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 424/572 constraints, Known Traps: 27/27 constraints]
After SMT, in 62630ms problems are : Problem set: 147 solved, 425 unsolved
Search for dead transitions found 147 dead transitions in 62649ms
Found 147 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 147 transitions
Dead transitions reduction (with SMT) removed 147 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 149/149 places, 426/573 transitions.
Applied a total of 0 rules in 15 ms. Remains 149 /149 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-06-02 21:57:02] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63771 ms. Remains : 149/149 places, 426/573 transitions.
RANDOM walk for 40000 steps (2394 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (524 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (520 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 569870 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 2
Probabilistic random walk after 569870 steps, saw 116479 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
// Phase 1: matrix 426 rows 149 cols
[2024-06-02 21:57:05] [INFO ] Computed 23 invariants in 6 ms
[2024-06-02 21:57:05] [INFO ] State equation strengthened by 109 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/101 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/145 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/147 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 426/573 variables, 147/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 109/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/575 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/575 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 281 constraints, problems are : Problem set: 0 solved, 2 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 149/149 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/101 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/145 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:06] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 2 ms to minimize.
[2024-06-02 21:57:06] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 2 ms to minimize.
[2024-06-02 21:57:06] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-06-02 21:57:06] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
[2024-06-02 21:57:06] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 2 ms to minimize.
[2024-06-02 21:57:07] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 2 ms to minimize.
[2024-06-02 21:57:07] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:07] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2024-06-02 21:57:07] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/147 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:07] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:08] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:08] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 426/573 variables, 147/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 109/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:08] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/573 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/575 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:09] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/575 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/575 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/575 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 575/575 variables, and 297 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3895 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 149/149 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 4295ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 326 ms.
Support contains 56 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 426/426 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 149/149 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 426/426 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-06-02 21:57:10] [INFO ] Invariant cache hit.
[2024-06-02 21:57:10] [INFO ] Implicit Places using invariants in 166 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 148/149 places, 426/426 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 184 ms. Remains : 148/149 places, 426/426 transitions.
RANDOM walk for 40000 steps (2400 resets) in 483 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (507 resets) in 273 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (509 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 515828 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 2
Probabilistic random walk after 515828 steps, saw 104636 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
// Phase 1: matrix 426 rows 148 cols
[2024-06-02 21:57:13] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:57:13] [INFO ] State equation strengthened by 109 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/144 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/146 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 426/572 variables, 146/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 109/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/574 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/574 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 148/148 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:14] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:57:14] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:14] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-06-02 21:57:14] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/144 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:15] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 2 ms to minimize.
[2024-06-02 21:57:15] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:15] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:57:15] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/146 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 426/572 variables, 146/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 109/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/572 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/574 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/574 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/574 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/574 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 289 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2778 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 148/148 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 3456ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 362 ms.
Support contains 56 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 426/426 transitions.
Applied a total of 0 rules in 12 ms. Remains 148 /148 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 148/148 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 426/426 transitions.
Applied a total of 0 rules in 12 ms. Remains 148 /148 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-06-02 21:57:17] [INFO ] Invariant cache hit.
[2024-06-02 21:57:17] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-02 21:57:17] [INFO ] Invariant cache hit.
[2024-06-02 21:57:17] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-06-02 21:57:18] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2024-06-02 21:57:18] [INFO ] Redundant transitions in 14 ms returned []
Running 425 sub problems to find dead transitions.
[2024-06-02 21:57:18] [INFO ] Invariant cache hit.
[2024-06-02 21:57:18] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 21:57:25] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:57:25] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:57:25] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:57:25] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:57:25] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:57:26] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:57:26] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:57:27] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:57:27] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-06-02 21:57:27] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-06-02 21:57:28] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 3 ms to minimize.
[2024-06-02 21:57:28] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
[2024-06-02 21:57:29] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/573 variables, 147/182 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 109/291 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 292 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 148/148 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/573 variables, 147/182 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 109/291 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 424/715 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 21:58:04] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-06-02 21:58:04] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 2 ms to minimize.
[2024-06-02 21:58:05] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 2 ms to minimize.
[2024-06-02 21:58:05] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2024-06-02 21:58:05] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2024-06-02 21:58:11] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:58:13] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:58:14] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:58:15] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 2 ms to minimize.
[2024-06-02 21:58:15] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 3 ms to minimize.
[2024-06-02 21:58:16] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-06-02 21:58:17] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 12/727 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 727 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 147/148 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 424/425 constraints, Known Traps: 25/25 constraints]
After SMT, in 61243ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 61252ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62163 ms. Remains : 148/148 places, 426/426 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 680 edges and 148 vertex of which 146 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 146 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 146 transition count 420
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 146 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 145 transition count 423
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 145 transition count 423
Applied a total of 11 rules in 32 ms. Remains 145 /148 variables (removed 3) and now considering 423/426 (removed 3) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 423 rows 145 cols
[2024-06-02 21:58:19] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:58:19] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:58:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-02 21:58:19] [INFO ] [Nat]Absence check using 7 positive and 13 generalized place invariants in 5 ms returned sat
[2024-06-02 21:58:20] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 21:58:20] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:58:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
TRAPS : Iteration 1
[2024-06-02 21:58:20] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:58:20] [INFO ] After 1021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1224 ms.
[2024-06-02 21:58:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-06-02 21:58:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 148 places, 426 transitions and 2357 arcs took 14 ms.
[2024-06-02 21:58:21] [INFO ] Flatten gal took : 137 ms
Total runtime 213238 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-22-ReachabilityCardinality-2024-01
Could not compute solution for formula : MedleyA-PT-22-ReachabilityCardinality-2024-06

BK_STOP 1717365501777

--------------------
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
mcc2024
rfs formula name MedleyA-PT-22-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/1123/inv_0_
rfs formula name MedleyA-PT-22-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/1123/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

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