About the Execution of GreatSPN+red for BugTracking-PT-q8m004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16073.327 | 310786.00 | 425823.00 | 195.10 | FFFFTTTFTTTFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398100399.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BugTracking-PT-q8m004, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100399
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q8m004-ReachabilityFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2023-04
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-13
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m004-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716297123255
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:12:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 13:12:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:12:06] [INFO ] Load time of PNML (sax parser for PT used): 1037 ms
[2024-05-21 13:12:06] [INFO ] Transformed 754 places.
[2024-05-21 13:12:06] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:12:06] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1322 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 107 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (457 resets) in 2711 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (87 resets) in 347 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (92 resets) in 258 ms. (154 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (144 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (114 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (146 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 91074 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 6
Probabilistic random walk after 91074 steps, saw 51849 distinct states, run finished after 3007 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-21 13:12:11] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 13:12:11] [INFO ] Computed 10 invariants in 62 ms
[2024-05-21 13:12:11] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 108/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3001/3126 variables, 125/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3126 variables, 222/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3126 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 824/3950 variables, 110/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3950 variables, 74/537 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3950 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/3953 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3953 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 55/4008 variables, 44/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4008 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4008 variables, 7/591 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4008 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/4009 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4009 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2886 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 108/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 13:12:14] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 17 ms to minimize.
Problem BugTracking-PT-q8m004-ReachabilityFireability-2024-00 is UNSAT
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m004-ReachabilityFireability-2023-04 is UNSAT
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2023-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-21 13:12:14] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2024-05-21 13:12:15] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 1 ms to minimize.
[2024-05-21 13:12:15] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
Problem BugTracking-PT-q8m004-ReachabilityFireability-2023-14 is UNSAT
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2023-14 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-21 13:12:15] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/11 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 13:12:15] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/12 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3001/3126 variables, 125/137 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3126 variables, 222/359 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3126 variables, 2/361 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 13:12:16] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3126 variables, 1/362 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3126 variables, 0/362 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 824/3950 variables, 110/472 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3950 variables, 74/546 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3950 variables, 0/546 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/3953 variables, 1/547 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3953 variables, 0/547 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 55/4008 variables, 44/591 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4008 variables, 2/593 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4008 variables, 7/600 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4008 variables, 0/600 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/4009 variables, 1/601 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4009 variables, 1/602 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4009 variables, 0/602 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4009/4009 variables, and 602 constraints, problems are : Problem set: 3 solved, 3 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 8217ms problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 270 transition count 3872
Applied a total of 17 rules in 476 ms. Remains 270 /280 variables (removed 10) and now considering 3872/3904 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 270/280 places, 3872/3904 transitions.
RANDOM walk for 40000 steps (555 resets) in 1028 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (177 resets) in 325 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (133 resets) in 284 ms. (140 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (176 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 94285 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 3
Probabilistic random walk after 94285 steps, saw 62478 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-05-21 13:12:23] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-05-21 13:12:23] [INFO ] Computed 8 invariants in 40 ms
[2024-05-21 13:12:23] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2938/3045 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3045 variables, 169/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3045 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 743/3788 variables, 111/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3788 variables, 85/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3788 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/3789 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3789 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3789 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 169/3958 variables, 39/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3958 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3958 variables, 29/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3958 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 12/3970 variables, 12/560 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3970 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/3970 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 561 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2938/3045 variables, 107/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3045 variables, 169/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:12:26] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/3045 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3045 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 743/3788 variables, 111/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3788 variables, 85/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3788 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:12:27] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3788 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3788 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/3789 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3789 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3789 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 169/3958 variables, 39/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3958 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3958 variables, 29/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3958 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/3970 variables, 12/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3970 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3970 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/3970 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3970/3970 variables, and 565 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 8177ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3094 ms.
Support contains 11 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 80 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 91 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-05-21 13:12:34] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 13:12:34] [INFO ] Invariant cache hit.
[2024-05-21 13:12:35] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-21 13:12:35] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 13:12:35] [INFO ] Invariant cache hit.
[2024-05-21 13:12:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 13:12:37] [INFO ] Implicit Places using invariants and state equation in 2344 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
[2024-05-21 13:12:38] [INFO ] Redundant transitions in 405 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-05-21 13:12:38] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 13:12:38] [INFO ] Invariant cache hit.
[2024-05-21 13:12:38] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3970 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2024-05-21 13:14:18] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2024-05-21 13:14:18] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 1 ms to minimize.
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
[2024-05-21 13:14:18] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 0 ms to minimize.
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
[2024-05-21 13:14:18] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2689 is UNSAT
[2024-05-21 13:14:19] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 1 ms to minimize.
Problem TDEAD2690 is UNSAT
Problem TDEAD2691 is UNSAT
[2024-05-21 13:14:19] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
[2024-05-21 13:14:19] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2707 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2717 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2768 is UNSAT
Problem TDEAD2769 is UNSAT
Problem TDEAD2770 is UNSAT
Problem TDEAD2771 is UNSAT
Problem TDEAD2772 is UNSAT
Problem TDEAD2773 is UNSAT
Problem TDEAD2774 is UNSAT
Problem TDEAD2775 is UNSAT
Problem TDEAD2776 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2779 is UNSAT
Problem TDEAD2780 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2791 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2793 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD2806 is UNSAT
Problem TDEAD2807 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2809 is UNSAT
Problem TDEAD2810 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2812 is UNSAT
Problem TDEAD2813 is UNSAT
Problem TDEAD2814 is UNSAT
Problem TDEAD2815 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2817 is UNSAT
Problem TDEAD2818 is UNSAT
Problem TDEAD2822 is UNSAT
Problem TDEAD2823 is UNSAT
Problem TDEAD2824 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2826 is UNSAT
Problem TDEAD2827 is UNSAT
Problem TDEAD2828 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2830 is UNSAT
Problem TDEAD2831 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3017 is UNSAT
Problem TDEAD3018 is UNSAT
Problem TDEAD3019 is UNSAT
Problem TDEAD3020 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3025 is UNSAT
Problem TDEAD3026 is UNSAT
Problem TDEAD3027 is UNSAT
Problem TDEAD3028 is UNSAT
Problem TDEAD3029 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3041 is UNSAT
Problem TDEAD3042 is UNSAT
Problem TDEAD3043 is UNSAT
Problem TDEAD3044 is UNSAT
Problem TDEAD3045 is UNSAT
Problem TDEAD3046 is UNSAT
Problem TDEAD3047 is UNSAT
Problem TDEAD3048 is UNSAT
Problem TDEAD3049 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3053 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3058 is UNSAT
Problem TDEAD3059 is UNSAT
Problem TDEAD3060 is UNSAT
Problem TDEAD3061 is UNSAT
Problem TDEAD3062 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3066 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3074 is UNSAT
Problem TDEAD3075 is UNSAT
Problem TDEAD3076 is UNSAT
Problem TDEAD3077 is UNSAT
Problem TDEAD3078 is UNSAT
Problem TDEAD3079 is UNSAT
Problem TDEAD3080 is UNSAT
Problem TDEAD3081 is UNSAT
Problem TDEAD3082 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3086 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3091 is UNSAT
Problem TDEAD3092 is UNSAT
Problem TDEAD3093 is UNSAT
Problem TDEAD3094 is UNSAT
Problem TDEAD3095 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3107 is UNSAT
Problem TDEAD3108 is UNSAT
Problem TDEAD3109 is UNSAT
Problem TDEAD3110 is UNSAT
Problem TDEAD3111 is UNSAT
Problem TDEAD3112 is UNSAT
Problem TDEAD3113 is UNSAT
Problem TDEAD3114 is UNSAT
Problem TDEAD3115 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3119 is UNSAT
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3124 is UNSAT
Problem TDEAD3125 is UNSAT
Problem TDEAD3126 is UNSAT
Problem TDEAD3127 is UNSAT
Problem TDEAD3128 is UNSAT
Problem TDEAD3129 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3131 is UNSAT
Problem TDEAD3132 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3137 is UNSAT
Problem TDEAD3138 is UNSAT
Problem TDEAD3139 is UNSAT
Problem TDEAD3140 is UNSAT
Problem TDEAD3141 is UNSAT
Problem TDEAD3142 is UNSAT
Problem TDEAD3143 is UNSAT
Problem TDEAD3144 is UNSAT
Problem TDEAD3145 is UNSAT
Problem TDEAD3146 is UNSAT
Problem TDEAD3147 is UNSAT
Problem TDEAD3148 is UNSAT
Problem TDEAD3149 is UNSAT
Problem TDEAD3150 is UNSAT
Problem TDEAD3151 is UNSAT
Problem TDEAD3152 is UNSAT
Problem TDEAD3153 is UNSAT
Problem TDEAD3154 is UNSAT
Problem TDEAD3155 is UNSAT
Problem TDEAD3156 is UNSAT
Problem TDEAD3157 is UNSAT
Problem TDEAD3158 is UNSAT
Problem TDEAD3159 is UNSAT
Problem TDEAD3160 is UNSAT
Problem TDEAD3161 is UNSAT
Problem TDEAD3162 is UNSAT
Problem TDEAD3163 is UNSAT
Problem TDEAD3164 is UNSAT
Problem TDEAD3165 is UNSAT
Problem TDEAD3166 is UNSAT
Problem TDEAD3167 is UNSAT
Problem TDEAD3168 is UNSAT
Problem TDEAD3169 is UNSAT
Problem TDEAD3170 is UNSAT
Problem TDEAD3171 is UNSAT
Problem TDEAD3172 is UNSAT
Problem TDEAD3173 is UNSAT
Problem TDEAD3174 is UNSAT
Problem TDEAD3175 is UNSAT
Problem TDEAD3176 is UNSAT
Problem TDEAD3177 is UNSAT
Problem TDEAD3178 is UNSAT
Problem TDEAD3179 is UNSAT
Problem TDEAD3180 is UNSAT
Problem TDEAD3181 is UNSAT
Problem TDEAD3182 is UNSAT
Problem TDEAD3183 is UNSAT
Problem TDEAD3184 is UNSAT
Problem TDEAD3185 is UNSAT
Problem TDEAD3186 is UNSAT
Problem TDEAD3187 is UNSAT
Problem TDEAD3188 is UNSAT
Problem TDEAD3189 is UNSAT
Problem TDEAD3190 is UNSAT
Problem TDEAD3191 is UNSAT
Problem TDEAD3192 is UNSAT
Problem TDEAD3193 is UNSAT
Problem TDEAD3194 is UNSAT
Problem TDEAD3195 is UNSAT
Problem TDEAD3196 is UNSAT
Problem TDEAD3197 is UNSAT
Problem TDEAD3198 is UNSAT
Problem TDEAD3199 is UNSAT
Problem TDEAD3200 is UNSAT
Problem TDEAD3201 is UNSAT
Problem TDEAD3202 is UNSAT
Problem TDEAD3203 is UNSAT
Problem TDEAD3204 is UNSAT
Problem TDEAD3205 is UNSAT
Problem TDEAD3206 is UNSAT
Problem TDEAD3207 is UNSAT
Problem TDEAD3208 is UNSAT
Problem TDEAD3209 is UNSAT
Problem TDEAD3210 is UNSAT
Problem TDEAD3211 is UNSAT
Problem TDEAD3212 is UNSAT
Problem TDEAD3213 is UNSAT
Problem TDEAD3214 is UNSAT
Problem TDEAD3215 is UNSAT
Problem TDEAD3216 is UNSAT
Problem TDEAD3217 is UNSAT
Problem TDEAD3218 is UNSAT
Problem TDEAD3219 is UNSAT
Problem TDEAD3220 is UNSAT
Problem TDEAD3221 is UNSAT
Problem TDEAD3222 is UNSAT
Problem TDEAD3223 is UNSAT
Problem TDEAD3224 is UNSAT
Problem TDEAD3225 is UNSAT
Problem TDEAD3226 is UNSAT
Problem TDEAD3227 is UNSAT
Problem TDEAD3228 is UNSAT
Problem TDEAD3229 is UNSAT
Problem TDEAD3230 is UNSAT
Problem TDEAD3231 is UNSAT
Problem TDEAD3232 is UNSAT
Problem TDEAD3233 is UNSAT
Problem TDEAD3234 is UNSAT
Problem TDEAD3235 is UNSAT
Problem TDEAD3236 is UNSAT
Problem TDEAD3237 is UNSAT
Problem TDEAD3238 is UNSAT
Problem TDEAD3239 is UNSAT
Problem TDEAD3240 is UNSAT
Problem TDEAD3241 is UNSAT
Problem TDEAD3242 is UNSAT
Problem TDEAD3243 is UNSAT
Problem TDEAD3244 is UNSAT
Problem TDEAD3245 is UNSAT
Problem TDEAD3246 is UNSAT
Problem TDEAD3247 is UNSAT
Problem TDEAD3248 is UNSAT
Problem TDEAD3249 is UNSAT
Problem TDEAD3250 is UNSAT
Problem TDEAD3251 is UNSAT
Problem TDEAD3252 is UNSAT
Problem TDEAD3253 is UNSAT
Problem TDEAD3254 is UNSAT
Problem TDEAD3255 is UNSAT
Problem TDEAD3256 is UNSAT
Problem TDEAD3257 is UNSAT
Problem TDEAD3258 is UNSAT
Problem TDEAD3259 is UNSAT
Problem TDEAD3260 is UNSAT
Problem TDEAD3261 is UNSAT
Problem TDEAD3262 is UNSAT
Problem TDEAD3263 is UNSAT
Problem TDEAD3264 is UNSAT
Problem TDEAD3265 is UNSAT
Problem TDEAD3266 is UNSAT
Problem TDEAD3267 is UNSAT
Problem TDEAD3268 is UNSAT
Problem TDEAD3269 is UNSAT
Problem TDEAD3270 is UNSAT
Problem TDEAD3271 is UNSAT
Problem TDEAD3272 is UNSAT
Problem TDEAD3273 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3275 is UNSAT
Problem TDEAD3276 is UNSAT
Problem TDEAD3277 is UNSAT
Problem TDEAD3278 is UNSAT
Problem TDEAD3279 is UNSAT
Problem TDEAD3280 is UNSAT
Problem TDEAD3281 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/3970 variables, and 15 constraints, problems are : Problem set: 460 solved, 3410 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 7/7 constraints]
After SMT, in 106416ms problems are : Problem set: 460 solved, 3410 unsolved
Search for dead transitions found 460 dead transitions in 106506ms
Found 460 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 460 transitions
Dead transitions reduction (with SMT) removed 460 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 270/270 places, 3412/3872 transitions.
Reduce places removed 13 places and 385 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 257 transition count 3027
Reduce places removed 9 places and 196 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 248 transition count 2831
Reduce places removed 12 places and 327 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 34 place count 236 transition count 2504
Reduce places removed 8 places and 189 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 42 place count 228 transition count 2315
Deduced a syphon composed of 2 places in 14 ms
Applied a total of 42 rules in 190 ms. Remains 228 /270 variables (removed 42) and now considering 2315/3412 (removed 1097) transitions.
[2024-05-21 13:14:25] [INFO ] Flow matrix only has 2195 transitions (discarded 120 similar events)
// Phase 1: matrix 2195 rows 228 cols
[2024-05-21 13:14:25] [INFO ] Computed 10 invariants in 12 ms
[2024-05-21 13:14:25] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-21 13:14:25] [INFO ] Flow matrix only has 2195 transitions (discarded 120 similar events)
[2024-05-21 13:14:25] [INFO ] Invariant cache hit.
[2024-05-21 13:14:25] [INFO ] State equation strengthened by 207 read => feed constraints.
[2024-05-21 13:14:27] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 228/270 places, 2315/3872 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 112377 ms. Remains : 228/270 places, 2315/3872 transitions.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 40002 steps (636 resets) in 693 ms. (57 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (179 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (112 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (161 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 62308 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 3
Probabilistic random walk after 62308 steps, saw 41912 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-21 13:14:30] [INFO ] Flow matrix only has 2195 transitions (discarded 120 similar events)
// Phase 1: matrix 2195 rows 226 cols
[2024-05-21 13:14:30] [INFO ] Computed 8 invariants in 16 ms
[2024-05-21 13:14:30] [INFO ] State equation strengthened by 207 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 820/878 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/878 variables, 65/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/878 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 735/1613 variables, 58/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1613 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1613 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 768/2381 variables, 70/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2381 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2381 variables, 82/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2381 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/2382 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2382 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2382 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 39/2421 variables, 39/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2421 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2421 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2421 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2421/2421 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, ReadFeed: 207/207 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 820/878 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/878 variables, 65/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/878 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 735/1613 variables, 58/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1613 variables, 60/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1613 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1613 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 768/2381 variables, 70/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2381 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2381 variables, 82/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2381 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:14:34] [INFO ] Deduced a trap composed of 56 places in 209 ms of which 4 ms to minimize.
[2024-05-21 13:14:34] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2381 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2381 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/2382 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2382 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2382 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 39/2421 variables, 39/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2421 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:14:36] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 1 ms to minimize.
[2024-05-21 13:14:36] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2024-05-21 13:14:37] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2421 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2421 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/2421 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2421/2421 variables, and 449 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5866 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, ReadFeed: 207/207 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 7380ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2011 ms.
Support contains 8 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 2315/2315 transitions.
Applied a total of 0 rules in 26 ms. Remains 226 /226 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 226/226 places, 2315/2315 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 2315/2315 transitions.
Applied a total of 0 rules in 25 ms. Remains 226 /226 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
[2024-05-21 13:14:40] [INFO ] Flow matrix only has 2195 transitions (discarded 120 similar events)
[2024-05-21 13:14:40] [INFO ] Invariant cache hit.
[2024-05-21 13:14:40] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 13:14:40] [INFO ] Flow matrix only has 2195 transitions (discarded 120 similar events)
[2024-05-21 13:14:40] [INFO ] Invariant cache hit.
[2024-05-21 13:14:40] [INFO ] State equation strengthened by 207 read => feed constraints.
[2024-05-21 13:14:41] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2024-05-21 13:14:41] [INFO ] Redundant transitions in 58 ms returned []
Running 2313 sub problems to find dead transitions.
[2024-05-21 13:14:41] [INFO ] Flow matrix only has 2195 transitions (discarded 120 similar events)
[2024-05-21 13:14:41] [INFO ] Invariant cache hit.
[2024-05-21 13:14:41] [INFO ] State equation strengthened by 207 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2313 unsolved
[2024-05-21 13:15:19] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
[2024-05-21 13:15:20] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 15 ms to minimize.
[2024-05-21 13:15:22] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
[2024-05-21 13:15:22] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
[2024-05-21 13:15:23] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
Problem TDEAD2145 is UNSAT
[2024-05-21 13:15:23] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
[2024-05-21 13:15:23] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
[2024-05-21 13:15:23] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2177 is UNSAT
[2024-05-21 13:15:23] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
Problem TDEAD2178 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
[2024-05-21 13:15:23] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2064 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2068 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2078 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
Problem TDEAD2093 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2095 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 10/18 constraints. Problems are: Problem set: 439 solved, 1874 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 226/2421 variables, and 18 constraints, problems are : Problem set: 439 solved, 1874 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/226 constraints, ReadFeed: 0/207 constraints, PredecessorRefiner: 2313/2313 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 439 solved, 1874 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 7/7 constraints. Problems are: Problem set: 439 solved, 1874 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 10/17 constraints. Problems are: Problem set: 439 solved, 1874 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/17 constraints. Problems are: Problem set: 439 solved, 1874 unsolved
At refinement iteration 3 (OVERLAPS) 11/226 variables, 1/18 constraints. Problems are: Problem set: 439 solved, 1874 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/18 constraints. Problems are: Problem set: 439 solved, 1874 unsolved
At refinement iteration 5 (OVERLAPS) 2195/2421 variables, 226/244 constraints. Problems are: Problem set: 439 solved, 1874 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2421 variables, 207/451 constraints. Problems are: Problem set: 439 solved, 1874 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2421/2421 variables, and 2325 constraints, problems are : Problem set: 439 solved, 1874 unsolved in 32322 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, ReadFeed: 207/207 constraints, PredecessorRefiner: 1874/2313 constraints, Known Traps: 10/10 constraints]
After SMT, in 80545ms problems are : Problem set: 439 solved, 1874 unsolved
Search for dead transitions found 439 dead transitions in 80569ms
Found 439 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 439 transitions
Dead transitions reduction (with SMT) removed 439 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/226 places, 1876/2315 transitions.
Graph (complete) has 2441 edges and 226 vertex of which 215 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Reduce places removed 19 places and 504 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 196 transition count 1372
Reduce places removed 15 places and 208 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 35 place count 181 transition count 1164
Reduce places removed 11 places and 121 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 46 place count 170 transition count 1043
Reduce places removed 8 places and 56 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 54 place count 162 transition count 987
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 160 transition count 941
Reduce places removed 1 places and 15 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 57 place count 159 transition count 926
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 58 place count 158 transition count 917
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 76 place count 140 transition count 811
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 2 places and 30 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 96 place count 138 transition count 781
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 106 place count 128 transition count 691
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 7 with 10 rules applied. Total rules applied 116 place count 128 transition count 691
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 116 rules in 44 ms. Remains 128 /226 variables (removed 98) and now considering 691/1876 (removed 1185) transitions.
[2024-05-21 13:16:02] [INFO ] Flow matrix only has 599 transitions (discarded 92 similar events)
// Phase 1: matrix 599 rows 128 cols
[2024-05-21 13:16:02] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 13:16:02] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 13:16:02] [INFO ] Flow matrix only has 599 transitions (discarded 92 similar events)
[2024-05-21 13:16:02] [INFO ] Invariant cache hit.
[2024-05-21 13:16:02] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 13:16:02] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 128/226 places, 691/2315 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82778 ms. Remains : 128/226 places, 691/2315 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (614 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (115 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 599753 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 1
Probabilistic random walk after 599753 steps, saw 391001 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :0
[2024-05-21 13:16:06] [INFO ] Flow matrix only has 599 transitions (discarded 92 similar events)
// Phase 1: matrix 599 rows 125 cols
[2024-05-21 13:16:06] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 13:16:06] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/137 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 315/452 variables, 31/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 232/684 variables, 53/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 36/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/685 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/685 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/685 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 39/724 variables, 32/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/724 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/724 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/724 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/724 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 724/724 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 79/79 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/137 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 315/452 variables, 31/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 232/684 variables, 53/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 36/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/684 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/685 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/685 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/685 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 39/724 variables, 32/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/724 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/724 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 13:16:07] [INFO ] Deduced a trap composed of 5 places in 476 ms of which 30 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/724 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/724 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/724 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 724/724 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1274ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 691/691 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 682
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 682
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 681
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 123 transition count 681
Applied a total of 4 rules in 38 ms. Remains 123 /125 variables (removed 2) and now considering 681/691 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 123/125 places, 681/691 transitions.
RANDOM walk for 40002 steps (14 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 635729 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 635729 steps, saw 380151 distinct states, run finished after 3002 ms. (steps per millisecond=211 ) properties seen :0
[2024-05-21 13:16:10] [INFO ] Flow matrix only has 591 transitions (discarded 90 similar events)
// Phase 1: matrix 591 rows 123 cols
[2024-05-21 13:16:10] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 13:16:10] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/137 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 310/447 variables, 31/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 235/682 variables, 52/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/683 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/683 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/683 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/714 variables, 31/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/714 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/714 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/714 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 79/79 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/137 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 310/447 variables, 31/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 235/682 variables, 52/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/682 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/683 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/683 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/683 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/714 variables, 31/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/714 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/714 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/714 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 714/714 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 641ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 681/681 transitions.
Applied a total of 0 rules in 19 ms. Remains 123 /123 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 123/123 places, 681/681 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 681/681 transitions.
Applied a total of 0 rules in 20 ms. Remains 123 /123 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-21 13:16:11] [INFO ] Flow matrix only has 591 transitions (discarded 90 similar events)
[2024-05-21 13:16:11] [INFO ] Invariant cache hit.
[2024-05-21 13:16:11] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 13:16:11] [INFO ] Flow matrix only has 591 transitions (discarded 90 similar events)
[2024-05-21 13:16:11] [INFO ] Invariant cache hit.
[2024-05-21 13:16:11] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 13:16:11] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-21 13:16:12] [INFO ] Redundant transitions in 3 ms returned []
Running 680 sub problems to find dead transitions.
[2024-05-21 13:16:12] [INFO ] Flow matrix only has 591 transitions (discarded 90 similar events)
[2024-05-21 13:16:12] [INFO ] Invariant cache hit.
[2024-05-21 13:16:12] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 680 unsolved
[2024-05-21 13:16:15] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 13:16:16] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
[2024-05-21 13:16:16] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 15 ms to minimize.
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 3/10 constraints. Problems are: Problem set: 12 solved, 668 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 668 unsolved
At refinement iteration 3 (OVERLAPS) 591/714 variables, 123/133 constraints. Problems are: Problem set: 12 solved, 668 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 79/212 constraints. Problems are: Problem set: 12 solved, 668 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 714/714 variables, and 212 constraints, problems are : Problem set: 12 solved, 668 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 12 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 3/10 constraints. Problems are: Problem set: 12 solved, 668 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 668 unsolved
At refinement iteration 3 (OVERLAPS) 591/714 variables, 123/133 constraints. Problems are: Problem set: 12 solved, 668 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 79/212 constraints. Problems are: Problem set: 12 solved, 668 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD606 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/714 variables, 668/880 constraints. Problems are: Problem set: 107 solved, 573 unsolved
[2024-05-21 13:16:58] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 1/881 constraints. Problems are: Problem set: 157 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 714/714 variables, and 881 constraints, problems are : Problem set: 157 solved, 523 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 668/680 constraints, Known Traps: 4/4 constraints]
After SMT, in 61349ms problems are : Problem set: 157 solved, 523 unsolved
Search for dead transitions found 157 dead transitions in 61357ms
Found 157 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 157 transitions
Dead transitions reduction (with SMT) removed 157 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/123 places, 524/681 transitions.
Graph (complete) has 780 edges and 123 vertex of which 120 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 139 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 106 transition count 385
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 105 transition count 376
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 104 transition count 368
Reduce places removed 0 places and 5 transitions.
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 22 place count 99 transition count 318
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 99 transition count 318
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 27 rules in 23 ms. Remains 99 /123 variables (removed 24) and now considering 318/524 (removed 206) transitions.
[2024-05-21 13:17:13] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
// Phase 1: matrix 297 rows 99 cols
[2024-05-21 13:17:13] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 13:17:13] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 13:17:13] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2024-05-21 13:17:13] [INFO ] Invariant cache hit.
[2024-05-21 13:17:13] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 13:17:13] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/123 places, 318/681 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62619 ms. Remains : 99/123 places, 318/681 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 308737 ms.
ITS solved all properties within timeout
BK_STOP 1716297434041
--------------------
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
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="BugTracking-PT-q8m004"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BugTracking-PT-q8m004, 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 r047-tajo-171620398100399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 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 '
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 ;