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-171620398100390.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-q8m002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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:23 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-q8m002-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2023-01
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2023-11
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716296410349

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:00:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 13:00:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:00:12] [INFO ] Load time of PNML (sax parser for PT used): 907 ms
[2024-05-21 13:00:12] [INFO ] Transformed 754 places.
[2024-05-21 13:00:13] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:00:13] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1183 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 74 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40002 steps (782 resets) in 3066 ms. (13 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (242 resets) in 381 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (220 resets) in 239 ms. (166 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (243 resets) in 429 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (228 resets) in 301 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (229 resets) in 468 ms. (85 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (260 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (211 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (208 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (209 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 75560 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 9
Probabilistic random walk after 75560 steps, saw 43636 distinct states, run finished after 3005 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-21 13:00:18] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 13:00:18] [INFO ] Computed 10 invariants in 36 ms
[2024-05-21 13:00:18] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem BugTracking-PT-q8m002-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m002-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m002-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 112/133 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3558/3691 variables, 133/139 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3691 variables, 144/283 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3691 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 317/4008 variables, 146/429 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4008 variables, 3/432 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4008 variables, 159/591 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4008 variables, 0/591 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/4009 variables, 1/592 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4009 variables, 1/593 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 3 solved, 6 unsolved in 2310 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 81/95 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 13:00:21] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 14 ms to minimize.
[2024-05-21 13:00:21] [INFO ] Deduced a trap composed of 17 places in 384 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 13:00:22] [INFO ] Deduced a trap composed of 18 places in 464 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2962/3057 variables, 95/102 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3057 variables, 134/236 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3057 variables, 0/236 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 923/3980 variables, 167/403 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3980 variables, 2/405 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3980 variables, 162/567 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3980 variables, 5/572 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 13:00:24] [INFO ] Deduced a trap composed of 24 places in 408 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3980 variables, 1/573 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3980 variables, 0/573 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 6/3986 variables, 3/576 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3986 variables, 3/579 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 13:00:25] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3986/4009 variables, and 580 constraints, problems are : Problem set: 3 solved, 6 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 265/280 constraints, ReadFeed: 296/303 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 7553ms problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 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 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 278 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 278 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 276 transition count 3877
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 276 transition count 3873
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 272 transition count 3873
Applied a total of 15 rules in 435 ms. Remains 272 /280 variables (removed 8) and now considering 3873/3904 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 272/280 places, 3873/3904 transitions.
RANDOM walk for 40001 steps (836 resets) in 620 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (424 resets) in 362 ms. (110 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (257 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (271 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (305 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (280 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (267 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 79289 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 6
Probabilistic random walk after 79289 steps, saw 44269 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-21 13:00:29] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
// Phase 1: matrix 3701 rows 272 cols
[2024-05-21 13:00:29] [INFO ] Computed 9 invariants in 16 ms
[2024-05-21 13:00:29] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2363/2452 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2452 variables, 99/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2452 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1485/3937 variables, 147/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3937 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3937 variables, 184/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3937 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/3938 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3938 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3938 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 35/3973 variables, 35/563 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3973 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3973 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/3973 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3973/3973 variables, and 564 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2259 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 272/272 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 13:00:32] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 1 ms to minimize.
[2024-05-21 13:00:32] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 1 ms to minimize.
[2024-05-21 13:00:32] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2024-05-21 13:00:33] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2363/2452 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2452 variables, 99/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2452 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1485/3937 variables, 147/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3937 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3937 variables, 184/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3937 variables, 5/535 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 13:00:35] [INFO ] Deduced a trap composed of 30 places in 697 ms of which 2 ms to minimize.
[2024-05-21 13:00:36] [INFO ] Deduced a trap composed of 21 places in 674 ms of which 3 ms to minimize.
[2024-05-21 13:00:36] [INFO ] Deduced a trap composed of 16 places in 397 ms of which 3 ms to minimize.
[2024-05-21 13:00:37] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 2 ms to minimize.
[2024-05-21 13:00:37] [INFO ] Deduced a trap composed of 59 places in 495 ms of which 3 ms to minimize.
[2024-05-21 13:00:38] [INFO ] Deduced a trap composed of 8 places in 370 ms of which 1 ms to minimize.
[2024-05-21 13:00:38] [INFO ] Deduced a trap composed of 10 places in 400 ms of which 1 ms to minimize.
[2024-05-21 13:00:39] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3937 variables, 8/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3937 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/3938 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3938 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 13:00:41] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3938 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3938 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 35/3973 variables, 35/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3973 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3973 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 13:00:43] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3973 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3973 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/3973 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3973/3973 variables, and 584 constraints, problems are : Problem set: 0 solved, 6 unsolved in 13187 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 272/272 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 14/14 constraints]
After SMT, in 15508ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 31672 ms.
Support contains 14 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 3873/3873 transitions.
Applied a total of 0 rules in 67 ms. Remains 272 /272 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 272/272 places, 3873/3873 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 3873/3873 transitions.
Applied a total of 0 rules in 56 ms. Remains 272 /272 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
[2024-05-21 13:01:17] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 13:01:17] [INFO ] Invariant cache hit.
[2024-05-21 13:01:17] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-21 13:01:17] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 13:01:17] [INFO ] Invariant cache hit.
[2024-05-21 13:01:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 13:01:19] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2216 ms to find 0 implicit places.
[2024-05-21 13:01:19] [INFO ] Redundant transitions in 386 ms returned []
Running 3871 sub problems to find dead transitions.
[2024-05-21 13:01:19] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 13:01:19] [INFO ] Invariant cache hit.
[2024-05-21 13:01:19] [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, 3871 unsolved
[2024-05-21 13:02:24] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
Problem TDEAD782 is UNSAT
[2024-05-21 13:02:24] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3973 variables, and 10 constraints, problems are : Problem set: 10 solved, 3861 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/272 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3871/2668 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 10 solved, 3861 unsolved
Problem TDEAD3799 is UNSAT
Problem TDEAD3805 is UNSAT
Problem TDEAD3811 is UNSAT
Problem TDEAD3817 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 2/10 constraints. Problems are: Problem set: 14 solved, 3857 unsolved
[2024-05-21 13:02:52] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
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 TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 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
Problem TDEAD2690 is UNSAT
[2024-05-21 13:02:52] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
Problem TDEAD2691 is UNSAT
[2024-05-21 13:02:52] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
Problem TDEAD2695 is UNSAT
[2024-05-21 13:02:52] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
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 TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2716 is UNSAT
Problem TDEAD2717 is UNSAT
[2024-05-21 13:02:53] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/3973 variables, and 15 constraints, problems are : Problem set: 58 solved, 3813 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/272 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2668 constraints, Known Traps: 7/7 constraints]
After SMT, in 102694ms problems are : Problem set: 58 solved, 3813 unsolved
Search for dead transitions found 58 dead transitions in 102740ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 272/272 places, 3815/3873 transitions.
Reduce places removed 12 places and 525 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 260 transition count 3290
Reduce places removed 10 places and 280 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 250 transition count 3010
Reduce places removed 12 places and 338 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 34 place count 238 transition count 2672
Reduce places removed 7 places and 185 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 41 place count 231 transition count 2487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 230 transition count 2467
Deduced a syphon composed of 5 places in 5 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 230 transition count 2467
Deduced a syphon composed of 5 places in 4 ms
Applied a total of 43 rules in 139 ms. Remains 230 /272 variables (removed 42) and now considering 2467/3815 (removed 1348) transitions.
[2024-05-21 13:03:02] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 230 cols
[2024-05-21 13:03:02] [INFO ] Computed 14 invariants in 22 ms
[2024-05-21 13:03:03] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-21 13:03:03] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-05-21 13:03:03] [INFO ] Invariant cache hit.
[2024-05-21 13:03:03] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 13:03:04] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/272 places, 2467/3873 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 107201 ms. Remains : 230/272 places, 2467/3873 transitions.
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (882 resets) in 493 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (247 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (295 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (291 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 113789 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 3
Probabilistic random walk after 113789 steps, saw 63532 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-21 13:03:07] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 225 cols
[2024-05-21 13:03:07] [INFO ] Computed 9 invariants in 18 ms
[2024-05-21 13:03:07] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1809/1894 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1894 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1894 variables, 155/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1894 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/1903 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1903 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1903 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 457/2360 variables, 109/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2360 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2360 variables, 17/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2360 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 184/2544 variables, 25/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2544 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2544 variables, 28/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2544 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 37/2581 variables, 25/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2581 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2581 variables, 9/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2581 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/2581 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2581/2581 variables, and 445 constraints, problems are : Problem set: 0 solved, 3 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 225/225 constraints, ReadFeed: 211/211 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1809/1894 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1894 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1894 variables, 155/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1894 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/1903 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1903 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1903 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 457/2360 variables, 109/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2360 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2360 variables, 17/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2360 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:03:09] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 1 ms to minimize.
[2024-05-21 13:03:09] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2024-05-21 13:03:09] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 2 ms to minimize.
[2024-05-21 13:03:10] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2024-05-21 13:03:10] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2360 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:03:10] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2360 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2360 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 184/2544 variables, 25/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2544 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2544 variables, 28/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2544 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 37/2581 variables, 25/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2581 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2581 variables, 9/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:03:11] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 2 ms to minimize.
[2024-05-21 13:03:11] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 2 ms to minimize.
[2024-05-21 13:03:12] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2581 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2581 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2581 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2581/2581 variables, and 457 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3919 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 225/225 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 4888ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 666 ms.
Support contains 3 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 2467/2467 transitions.
Graph (complete) has 3082 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 224 transition count 2465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 222 transition count 2465
Applied a total of 5 rules in 83 ms. Remains 222 /225 variables (removed 3) and now considering 2465/2467 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 222/225 places, 2465/2467 transitions.
RANDOM walk for 40000 steps (8 resets) in 428 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 151940 steps, run timeout after 3006 ms. (steps per millisecond=50 ) properties seen :0 out of 3
Probabilistic random walk after 151940 steps, saw 65488 distinct states, run finished after 3007 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-21 13:03:16] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
// Phase 1: matrix 2354 rows 222 cols
[2024-05-21 13:03:16] [INFO ] Computed 8 invariants in 9 ms
[2024-05-21 13:03:16] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1808/1893 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1893 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1893 variables, 155/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1893 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/1899 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1899 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1899 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 460/2359 variables, 109/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2359 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2359 variables, 17/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2359 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 194/2553 variables, 25/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2553 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2553 variables, 37/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2553 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 23/2576 variables, 23/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2576 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2576 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/2576 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2576/2576 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 222/222 constraints, ReadFeed: 211/211 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1808/1893 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1893 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1893 variables, 155/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1893 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/1899 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1899 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1899 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 460/2359 variables, 109/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2359 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2359 variables, 17/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2359 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:03:18] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 1 ms to minimize.
[2024-05-21 13:03:18] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 1 ms to minimize.
[2024-05-21 13:03:19] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 1 ms to minimize.
[2024-05-21 13:03:19] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 2 ms to minimize.
[2024-05-21 13:03:19] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2359 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:03:19] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2359 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2359 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 194/2553 variables, 25/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2553 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2553 variables, 37/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2553 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 23/2576 variables, 23/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2576 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:03:20] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 2 ms to minimize.
[2024-05-21 13:03:21] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2576 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2576 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/2576 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2576/2576 variables, and 452 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4087 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 222/222 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 4909ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 633 ms.
Support contains 3 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 2465/2465 transitions.
Applied a total of 0 rules in 54 ms. Remains 222 /222 variables (removed 0) and now considering 2465/2465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 222/222 places, 2465/2465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 2465/2465 transitions.
Applied a total of 0 rules in 43 ms. Remains 222 /222 variables (removed 0) and now considering 2465/2465 (removed 0) transitions.
[2024-05-21 13:03:22] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-05-21 13:03:22] [INFO ] Invariant cache hit.
[2024-05-21 13:03:22] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-21 13:03:22] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-05-21 13:03:22] [INFO ] Invariant cache hit.
[2024-05-21 13:03:23] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 13:03:23] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
[2024-05-21 13:03:24] [INFO ] Redundant transitions in 121 ms returned []
Running 2464 sub problems to find dead transitions.
[2024-05-21 13:03:24] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-05-21 13:03:24] [INFO ] Invariant cache hit.
[2024-05-21 13:03:24] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2464 unsolved
[2024-05-21 13:03:57] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
[2024-05-21 13:03:57] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1341 is UNSAT
[2024-05-21 13:03:58] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
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 TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 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 TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 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 TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 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 TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 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
Problem TDEAD1690 is UNSAT
[2024-05-21 13:03:59] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
[2024-05-21 13:04:00] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
Problem TDEAD1940 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
[2024-05-21 13:04:00] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
[2024-05-21 13:04:00] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
Problem TDEAD2056 is UNSAT
[2024-05-21 13:04:01] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 8/16 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
At refinement iteration 3 (OVERLAPS) 2354/2576 variables, 222/238 constraints. Problems are: Problem set: 674 solved, 1790 unsolved
SMT process timed out in 51181ms, After SMT, problems are : Problem set: 674 solved, 1790 unsolved
Search for dead transitions found 674 dead transitions in 51209ms
Found 674 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 674 transitions
Dead transitions reduction (with SMT) removed 674 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/222 places, 1791/2465 transitions.
Graph (complete) has 2343 edges and 222 vertex of which 209 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 365 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 194 transition count 1426
Reduce places removed 13 places and 204 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 181 transition count 1222
Reduce places removed 10 places and 105 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 39 place count 171 transition count 1117
Reduce places removed 6 places and 33 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 45 place count 165 transition count 1084
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 47 place count 163 transition count 1038
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 48 place count 162 transition count 1022
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 49 place count 161 transition count 1015
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 69 place count 141 transition count 864
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 32 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 91 place count 139 transition count 832
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 100 place count 130 transition count 778
Iterating global reduction 7 with 9 rules applied. Total rules applied 109 place count 130 transition count 778
Applied a total of 109 rules in 42 ms. Remains 130 /222 variables (removed 92) and now considering 778/1791 (removed 1013) transitions.
[2024-05-21 13:04:15] [INFO ] Flow matrix only has 690 transitions (discarded 88 similar events)
// Phase 1: matrix 690 rows 130 cols
[2024-05-21 13:04:15] [INFO ] Computed 6 invariants in 6 ms
[2024-05-21 13:04:15] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 13:04:15] [INFO ] Flow matrix only has 690 transitions (discarded 88 similar events)
[2024-05-21 13:04:15] [INFO ] Invariant cache hit.
[2024-05-21 13:04:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-21 13:04:15] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 130/222 places, 778/2465 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 53590 ms. Remains : 130/222 places, 778/2465 transitions.
RANDOM walk for 40000 steps (26 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (15 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 292312 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 3
Probabilistic random walk after 292312 steps, saw 160325 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-21 13:04:19] [INFO ] Flow matrix only has 690 transitions (discarded 88 similar events)
[2024-05-21 13:04:19] [INFO ] Invariant cache hit.
[2024-05-21 13:04:19] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 474/506 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 59/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/512 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 166/678 variables, 63/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/678 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/678 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 123/801 variables, 16/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/801 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/801 variables, 28/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/801 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/802 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/802 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/802 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 18/820 variables, 18/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/820 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/820 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/820 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 232 constraints, problems are : Problem set: 0 solved, 3 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 130/130 constraints, ReadFeed: 96/96 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 474/506 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 59/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/512 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 166/678 variables, 63/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/678 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/678 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:04:19] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-05-21 13:04:19] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/678 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/678 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 123/801 variables, 16/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/801 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/801 variables, 28/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/801 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/802 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/802 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/802 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 18/820 variables, 18/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/820 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 13:04:19] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/820 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/820 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/820 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 238 constraints, problems are : Problem set: 0 solved, 3 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 130/130 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1062ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 746 ms.
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 778/778 transitions.
Applied a total of 0 rules in 12 ms. Remains 130 /130 variables (removed 0) and now considering 778/778 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 130/130 places, 778/778 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 778/778 transitions.
Applied a total of 0 rules in 9 ms. Remains 130 /130 variables (removed 0) and now considering 778/778 (removed 0) transitions.
[2024-05-21 13:04:20] [INFO ] Flow matrix only has 690 transitions (discarded 88 similar events)
[2024-05-21 13:04:20] [INFO ] Invariant cache hit.
[2024-05-21 13:04:21] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 13:04:21] [INFO ] Flow matrix only has 690 transitions (discarded 88 similar events)
[2024-05-21 13:04:21] [INFO ] Invariant cache hit.
[2024-05-21 13:04:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-21 13:04:21] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2024-05-21 13:04:21] [INFO ] Redundant transitions in 6 ms returned []
Running 777 sub problems to find dead transitions.
[2024-05-21 13:04:21] [INFO ] Flow matrix only has 690 transitions (discarded 88 similar events)
[2024-05-21 13:04:21] [INFO ] Invariant cache hit.
[2024-05-21 13:04:21] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (OVERLAPS) 690/820 variables, 130/136 constraints. Problems are: Problem set: 0 solved, 777 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 96/232 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 5 (OVERLAPS) 0/820 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 777 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 232 constraints, problems are : Problem set: 0 solved, 777 unsolved in 18172 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 130/130 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 777/777 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 777 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (OVERLAPS) 690/820 variables, 130/136 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 96/232 constraints. Problems are: Problem set: 0 solved, 777 unsolved
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 TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 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 TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 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 TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD645 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 777/1009 constraints. Problems are: Problem set: 112 solved, 665 unsolved
[2024-05-21 13:04:52] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
[2024-05-21 13:04:56] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-21 13:04:57] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-05-21 13:05:01] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 4/1013 constraints. Problems are: Problem set: 167 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/820 variables, and 1013 constraints, problems are : Problem set: 167 solved, 610 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 130/130 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 777/777 constraints, Known Traps: 4/4 constraints]
After SMT, in 49634ms problems are : Problem set: 167 solved, 610 unsolved
Search for dead transitions found 167 dead transitions in 49644ms
Found 167 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 167 transitions
Dead transitions reduction (with SMT) removed 167 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/130 places, 611/778 transitions.
Graph (complete) has 876 edges and 130 vertex of which 127 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 168 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 113 transition count 443
Reduce places removed 4 places and 39 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 19 place count 109 transition count 404
Reduce places removed 3 places and 26 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 106 transition count 378
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 104 transition count 362
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 25 place count 103 transition count 357
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 29 place count 99 transition count 318
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 33 place count 99 transition count 318
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 33 rules in 18 ms. Remains 99 /130 variables (removed 31) and now considering 318/611 (removed 293) transitions.
[2024-05-21 13:05:11] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
// Phase 1: matrix 297 rows 99 cols
[2024-05-21 13:05:11] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 13:05:11] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 13:05:11] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2024-05-21 13:05:11] [INFO ] Invariant cache hit.
[2024-05-21 13:05:11] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 13:05:11] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/130 places, 318/778 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50690 ms. Remains : 99/130 places, 318/778 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2023-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (16 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (12 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1098170 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :0 out of 1
Probabilistic random walk after 1098170 steps, saw 679746 distinct states, run finished after 3002 ms. (steps per millisecond=365 ) properties seen :0
[2024-05-21 13:05:14] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
// Phase 1: matrix 297 rows 97 cols
[2024-05-21 13:05:14] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 13:05:14] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/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) 50/58 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/63 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 107/170 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 72/242 variables, 33/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/246 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem BugTracking-PT-q8m002-ReachabilityCardinality-2023-11 is UNSAT
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2023-11 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 336/394 variables, and 108 constraints, problems are : Problem set: 1 solved, 0 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/7 constraints, State Equation: 70/97 constraints, ReadFeed: 34/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 302985 ms.
ITS solved all properties within timeout

BK_STOP 1716296714931

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

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

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