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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 175K 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-17-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-17-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717360084955

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:28:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:28:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:28:08] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-06-02 20:28:08] [INFO ] Transformed 248 places.
[2024-06-02 20:28:08] [INFO ] Transformed 591 transitions.
[2024-06-02 20:28:08] [INFO ] Found NUPN structural information;
[2024-06-02 20:28:08] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 506 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
RANDOM walk for 40000 steps (1376 resets) in 2682 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (30 resets) in 132 ms. (30 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (27 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 100 ms. (39 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (27 resets) in 112 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 333 ms. (11 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (31 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 409418 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :9 out of 16
Probabilistic random walk after 409418 steps, saw 75254 distinct states, run finished after 3011 ms. (steps per millisecond=135 ) properties seen :9
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 589 rows 248 cols
[2024-06-02 20:28:12] [INFO ] Computed 7 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MedleyA-PT-17-ReachabilityFireability-2024-12 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 175/248 variables, 7/80 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 175/255 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 589/837 variables, 248/503 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/837 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/837 variables, and 503 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1458 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem MedleyA-PT-17-ReachabilityFireability-2024-00 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-17-ReachabilityFireability-2024-07 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-17-ReachabilityFireability-2024-14 is UNSAT
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 179/248 variables, 7/76 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 179/255 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-06-02 20:28:15] [INFO ] Deduced a trap composed of 19 places in 420 ms of which 71 ms to minimize.
[2024-06-02 20:28:15] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 4 ms to minimize.
[2024-06-02 20:28:15] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 4 ms to minimize.
[2024-06-02 20:28:16] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 5 ms to minimize.
[2024-06-02 20:28:16] [INFO ] Deduced a trap composed of 58 places in 347 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 5/260 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-06-02 20:28:16] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 4 ms to minimize.
[2024-06-02 20:28:17] [INFO ] Deduced a trap composed of 34 places in 339 ms of which 15 ms to minimize.
[2024-06-02 20:28:17] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 5 ms to minimize.
[2024-06-02 20:28:18] [INFO ] Deduced a trap composed of 29 places in 395 ms of which 4 ms to minimize.
[2024-06-02 20:28:18] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 3 ms to minimize.
[2024-06-02 20:28:18] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 3 ms to minimize.
[2024-06-02 20:28:18] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2024-06-02 20:28:18] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:28:18] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 9/269 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-06-02 20:28:19] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:28:19] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 2/271 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/271 constraints. Problems are: Problem set: 4 solved, 3 unsolved
SMT process timed out in 6790ms, After SMT, problems are : Problem set: 4 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 161 edges and 248 vertex of which 3 / 248 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 246 transition count 563
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 34 rules applied. Total rules applied 58 place count 223 transition count 552
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 67 place count 214 transition count 552
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 67 place count 214 transition count 536
Deduced a syphon composed of 16 places in 7 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 99 place count 198 transition count 536
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 145 place count 152 transition count 455
Iterating global reduction 3 with 46 rules applied. Total rules applied 191 place count 152 transition count 455
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 223 place count 152 transition count 423
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 223 place count 152 transition count 420
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 229 place count 149 transition count 420
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 147 transition count 416
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 147 transition count 416
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 251 place count 138 transition count 407
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 257 place count 135 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 267 place count 135 transition count 408
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 271 place count 131 transition count 404
Iterating global reduction 4 with 4 rules applied. Total rules applied 275 place count 131 transition count 404
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 281 place count 128 transition count 409
Free-agglomeration rule applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 302 place count 128 transition count 388
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 331 place count 107 transition count 380
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 332 place count 107 transition count 379
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 335 place count 107 transition count 397
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 342 place count 104 transition count 393
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 343 place count 104 transition count 393
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 344 place count 103 transition count 392
Applied a total of 344 rules in 418 ms. Remains 103 /248 variables (removed 145) and now considering 392/589 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 103/248 places, 392/589 transitions.
RANDOM walk for 40000 steps (3329 resets) in 339 ms. (117 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (624 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (630 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (627 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 799427 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :1 out of 3
Probabilistic random walk after 799427 steps, saw 140068 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 20:28:23] [INFO ] Flow matrix only has 362 transitions (discarded 30 similar events)
// Phase 1: matrix 362 rows 103 cols
[2024-06-02 20:28:23] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:28:23] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/103 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 362/465 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 22/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/465 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 103/103 constraints, ReadFeed: 22/22 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/103 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:28:23] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 362/465 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 22/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:28:26] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:28:26] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/465 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 137 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7829 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 103/103 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 8174ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 6931 ms.
Support contains 34 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 392/392 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 103 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 391
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
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 100 transition count 401
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 100 transition count 399
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 100 transition count 395
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 21 place count 96 transition count 390
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 25 place count 96 transition count 386
Applied a total of 25 rules in 69 ms. Remains 96 /103 variables (removed 7) and now considering 386/392 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 96/103 places, 386/392 transitions.
RANDOM walk for 40000 steps (3624 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (549 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (735 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 811806 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :1 out of 2
Probabilistic random walk after 811806 steps, saw 139433 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :1
FORMULA MedleyA-PT-17-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 20:28:41] [INFO ] Flow matrix only has 349 transitions (discarded 37 similar events)
// Phase 1: matrix 349 rows 96 cols
[2024-06-02 20:28:41] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:28:41] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 349/445 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 29/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/445 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:28:42] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 1 ms to minimize.
[2024-06-02 20:28:42] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 349/445 variables, 96/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 29/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/445 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1269ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 32 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 386/386 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 95 transition count 388
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 4 place count 95 transition count 386
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 95 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 94 transition count 400
Applied a total of 6 rules in 49 ms. Remains 94 /96 variables (removed 2) and now considering 400/386 (removed -14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 94/96 places, 400/386 transitions.
RANDOM walk for 40000 steps (3623 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (726 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1193260 steps, run timeout after 3001 ms. (steps per millisecond=397 ) properties seen :0 out of 1
Probabilistic random walk after 1193260 steps, saw 220870 distinct states, run finished after 3002 ms. (steps per millisecond=397 ) properties seen :0
[2024-06-02 20:28:46] [INFO ] Flow matrix only has 361 transitions (discarded 39 similar events)
// Phase 1: matrix 361 rows 94 cols
[2024-06-02 20:28:46] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 20:28:46] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 361/455 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 29/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/455 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 3 ms to minimize.
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2024-06-02 20:28:46] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:28:47] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 361/455 variables, 94/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 29/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:28:50] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/455 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4435 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 4749ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 448 ms.
Support contains 32 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 400/400 transitions.
Applied a total of 0 rules in 16 ms. Remains 94 /94 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 94/94 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 400/400 transitions.
Applied a total of 0 rules in 14 ms. Remains 94 /94 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-06-02 20:28:51] [INFO ] Flow matrix only has 361 transitions (discarded 39 similar events)
[2024-06-02 20:28:51] [INFO ] Invariant cache hit.
[2024-06-02 20:28:51] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 20:28:51] [INFO ] Flow matrix only has 361 transitions (discarded 39 similar events)
[2024-06-02 20:28:51] [INFO ] Invariant cache hit.
[2024-06-02 20:28:51] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 20:28:51] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-06-02 20:28:51] [INFO ] Redundant transitions in 42 ms returned []
Running 394 sub problems to find dead transitions.
[2024-06-02 20:28:51] [INFO ] Flow matrix only has 361 transitions (discarded 39 similar events)
[2024-06-02 20:28:51] [INFO ] Invariant cache hit.
[2024-06-02 20:28:51] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 5/94 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-06-02 20:28:57] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-06-02 20:28:57] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2024-06-02 20:28:57] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-06-02 20:28:57] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:28:57] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:28:57] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:28:57] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 2 ms to minimize.
[2024-06-02 20:28:58] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 3 ms to minimize.
[2024-06-02 20:28:58] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 10 ms to minimize.
[2024-06-02 20:28:58] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:28:58] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 3 ms to minimize.
[2024-06-02 20:28:59] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 2 ms to minimize.
[2024-06-02 20:28:59] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:28:59] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 4 ms to minimize.
[2024-06-02 20:28:59] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:28:59] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 2 ms to minimize.
[2024-06-02 20:28:59] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:29:00] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:29:00] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2024-06-02 20:29:00] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 2 ms to minimize.
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 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 TDEAD383 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/27 constraints. Problems are: Problem set: 32 solved, 362 unsolved
[2024-06-02 20:29:02] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 2 ms to minimize.
[2024-06-02 20:29:02] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 2 ms to minimize.
[2024-06-02 20:29:03] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 2 ms to minimize.
[2024-06-02 20:29:03] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 2 ms to minimize.
[2024-06-02 20:29:03] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 2 ms to minimize.
[2024-06-02 20:29:03] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:29:04] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 7/34 constraints. Problems are: Problem set: 32 solved, 362 unsolved
[2024-06-02 20:29:06] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/35 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/35 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 361/455 variables, 94/129 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 29/158 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/158 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 10 (OVERLAPS) 0/455 variables, 0/158 constraints. Problems are: Problem set: 32 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 158 constraints, problems are : Problem set: 32 solved, 362 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 32 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 5/6 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 3 (OVERLAPS) 5/94 variables, 6/12 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 23/35 constraints. Problems are: Problem set: 32 solved, 362 unsolved
[2024-06-02 20:29:25] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/36 constraints. Problems are: Problem set: 32 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/36 constraints. Problems are: Problem set: 32 solved, 362 unsolved
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 7 (OVERLAPS) 361/455 variables, 94/130 constraints. Problems are: Problem set: 82 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 29/159 constraints. Problems are: Problem set: 82 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 312/471 constraints. Problems are: Problem set: 82 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 471 constraints, problems are : Problem set: 82 solved, 312 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 312/394 constraints, Known Traps: 29/29 constraints]
After SMT, in 61219ms problems are : Problem set: 82 solved, 312 unsolved
Search for dead transitions found 82 dead transitions in 61235ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 94/94 places, 318/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2024-06-02 20:29:53] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61801 ms. Remains : 94/94 places, 318/400 transitions.
RANDOM walk for 40000 steps (3621 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (732 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1669253 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :0 out of 1
Probabilistic random walk after 1669253 steps, saw 299262 distinct states, run finished after 3002 ms. (steps per millisecond=556 ) properties seen :0
[2024-06-02 20:29:56] [INFO ] Flow matrix only has 279 transitions (discarded 39 similar events)
// Phase 1: matrix 279 rows 94 cols
[2024-06-02 20:29:56] [INFO ] Computed 7 invariants in 15 ms
[2024-06-02 20:29:56] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 279/373 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 29/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/373 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:29:56] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 3 ms to minimize.
[2024-06-02 20:29:56] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:29:56] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-06-02 20:29:56] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-06-02 20:29:56] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 279/373 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 29/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:29:58] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:29:58] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2474ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 32 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 318/318 transitions.
Applied a total of 0 rules in 10 ms. Remains 94 /94 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 94/94 places, 318/318 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 318/318 transitions.
Applied a total of 0 rules in 10 ms. Remains 94 /94 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2024-06-02 20:29:58] [INFO ] Flow matrix only has 279 transitions (discarded 39 similar events)
[2024-06-02 20:29:58] [INFO ] Invariant cache hit.
[2024-06-02 20:29:58] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 20:29:58] [INFO ] Flow matrix only has 279 transitions (discarded 39 similar events)
[2024-06-02 20:29:58] [INFO ] Invariant cache hit.
[2024-06-02 20:29:58] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 20:29:59] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2024-06-02 20:29:59] [INFO ] Redundant transitions in 5 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-02 20:29:59] [INFO ] Flow matrix only has 279 transitions (discarded 39 similar events)
[2024-06-02 20:29:59] [INFO ] Invariant cache hit.
[2024-06-02 20:29:59] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 5/94 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:30:02] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2024-06-02 20:30:03] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-06-02 20:30:04] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:30:04] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2024-06-02 20:30:04] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:30:04] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:30:04] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:30:04] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 2 ms to minimize.
[2024-06-02 20:30:05] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:30:05] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 3 ms to minimize.
[2024-06-02 20:30:05] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2024-06-02 20:30:05] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 2 ms to minimize.
[2024-06-02 20:30:05] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 2 ms to minimize.
[2024-06-02 20:30:05] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:30:07] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:30:07] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:30:07] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:30:08] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 2 ms to minimize.
[2024-06-02 20:30:08] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:30:08] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:30:08] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:30:08] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2024-06-02 20:30:09] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-02 20:30:09] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:30:10] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 1 ms to minimize.
[2024-06-02 20:30:10] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:30:12] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:30:15] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 279/373 variables, 94/135 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 29/164 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 12 (OVERLAPS) 0/373 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 164 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 5/94 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:30:32] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 20:30:33] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 279/373 variables, 94/137 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 29/166 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 312/478 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 478 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 36/36 constraints]
After SMT, in 60538ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60556ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60994 ms. Remains : 94/94 places, 318/318 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 73 edges and 94 vertex of which 9 / 94 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 87 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 87 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 86 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 1 with 23 rules applied. Total rules applied 31 place count 86 transition count 237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 86 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 85 transition count 236
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 84 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 84 transition count 235
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 38 place count 84 transition count 232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 83 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 83 transition count 230
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 82 transition count 229
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 82 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 82 transition count 228
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 82 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 81 transition count 227
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 51 place count 81 transition count 227
Applied a total of 51 rules in 44 ms. Remains 81 /94 variables (removed 13) and now considering 227/318 (removed 91) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 81 cols
[2024-06-02 20:30:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:30:59] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:30:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 20:31:00] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 20:31:00] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:31:00] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 2 ms to minimize.
[2024-06-02 20:31:01] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-06-02 20:31:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 450 ms
TRAPS : Iteration 1
[2024-06-02 20:31:01] [INFO ] After 1375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:31:01] [INFO ] After 1805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1911 ms.
[2024-06-02 20:31:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-02 20:31:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 318 transitions and 1659 arcs took 9 ms.
[2024-06-02 20:31:02] [INFO ] Flatten gal took : 130 ms
Total runtime 174547 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-17-ReachabilityFireability-2024-11

BK_STOP 1717360262441

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name MedleyA-PT-17-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/895/inv_0_
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-17"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;