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.r472-tajo-171620399500447.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 ltsminxred
Input is BugTracking-PT-q8m256, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2023-05
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2023-10
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-12
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-13
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2024-14
FORMULA_NAME BugTracking-PT-q8m256-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717224828030

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:53:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:53:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:53:51] [INFO ] Load time of PNML (sax parser for PT used): 1332 ms
[2024-06-01 06:53:51] [INFO ] Transformed 754 places.
[2024-06-01 06:53:51] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:53:51] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1691 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 116 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2124 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 99344 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 4
Probabilistic random walk after 99344 steps, saw 47659 distinct states, run finished after 3008 ms. (steps per millisecond=33 ) properties seen :0
[2024-06-01 06:53:55] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-06-01 06:53:56] [INFO ] Computed 10 invariants in 70 ms
[2024-06-01 06:53:56] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:53:57] [INFO ] Deduced a trap composed of 16 places in 571 ms of which 34 ms to minimize.
[2024-06-01 06:53:58] [INFO ] Deduced a trap composed of 11 places in 594 ms of which 1 ms to minimize.
[2024-06-01 06:53:58] [INFO ] Deduced a trap composed of 19 places in 336 ms of which 1 ms to minimize.
[2024-06-01 06:53:58] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2024-06-01 06:53:59] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 1 ms to minimize.
Problem BugTracking-PT-q8m256-ReachabilityFireability-2023-05 is UNSAT
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2023-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m256-ReachabilityFireability-2023-15 is UNSAT
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2023-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3005/3129 variables, 124/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3129 variables, 222/357 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3129 variables, 0/357 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 801/3930 variables, 112/469 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3930 variables, 67/536 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3930 variables, 0/536 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/3937 variables, 2/538 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3937 variables, 0/538 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 72/4009 variables, 44/582 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4009 variables, 2/584 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4009 variables, 14/598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4009 variables, 0/598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4009 variables, 0/598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 598 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4596 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 109/122 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3002/3124 variables, 122/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3124 variables, 222/356 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3124 variables, 2/358 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3124 variables, 0/358 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 806/3930 variables, 114/472 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3930 variables, 67/539 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3930 variables, 0/539 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/3937 variables, 2/541 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3937 variables, 1/542 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3937 variables, 0/542 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 72/4009 variables, 44/586 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4009 variables, 2/588 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4009 variables, 14/602 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:54:04] [INFO ] Deduced a trap composed of 65 places in 381 ms of which 2 ms to minimize.
[2024-06-01 06:54:04] [INFO ] Deduced a trap composed of 49 places in 305 ms of which 2 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 49 places in 383 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4009 variables, 3/605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4009 variables, 0/605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/4009 variables, 0/605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4009/4009 variables, and 605 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4836 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 9801ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 358 ms.
Support contains 13 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 270 transition count 3872
Applied a total of 17 rules in 351 ms. Remains 270 /280 variables (removed 10) and now considering 3872/3904 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 270/280 places, 3872/3904 transitions.
RANDOM walk for 40054 steps (13 resets) in 273 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 94698 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 2
Probabilistic random walk after 94698 steps, saw 62858 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 06:54:09] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-06-01 06:54:09] [INFO ] Computed 8 invariants in 45 ms
[2024-06-01 06:54:09] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 1 ms to minimize.
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2940/3048 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3048 variables, 170/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3048 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 849/3897 variables, 111/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3897 variables, 106/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3897 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/3900 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3900 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3900 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 70/3970 variables, 50/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3970 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3970 variables, 7/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3970 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/3970 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 563 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1961 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2940/3048 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3048 variables, 170/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:54:13] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 1 ms to minimize.
[2024-06-01 06:54:13] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3048 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3048 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 849/3897 variables, 111/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3897 variables, 106/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 69 places in 344 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3897 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3897 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3900 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3900 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3900 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 70/3970 variables, 50/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3970 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3970 variables, 7/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 59 places in 346 ms of which 2 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3970 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3970/3970 variables, and 569 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4473 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 8/8 constraints]
After SMT, in 6598ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 274 ms.
Support contains 13 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 99 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 93 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-06-01 06:54:16] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-06-01 06:54:16] [INFO ] Invariant cache hit.
[2024-06-01 06:54:17] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-06-01 06:54:17] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-06-01 06:54:17] [INFO ] Invariant cache hit.
[2024-06-01 06:54:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:54:20] [INFO ] Implicit Places using invariants and state equation in 3083 ms returned []
Implicit Place search using SMT with State Equation took 3577 ms to find 0 implicit places.
[2024-06-01 06:54:20] [INFO ] Redundant transitions in 414 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-06-01 06:54:20] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-06-01 06:54:20] [INFO ] Invariant cache hit.
[2024-06-01 06:54:20] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3970 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2689 is UNSAT
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
Problem TDEAD2690 is UNSAT
Problem TDEAD2691 is UNSAT
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2705 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2707 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2717 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2768 is UNSAT
Problem TDEAD2769 is UNSAT
Problem TDEAD2770 is UNSAT
Problem TDEAD2771 is UNSAT
Problem TDEAD2772 is UNSAT
Problem TDEAD2773 is UNSAT
Problem TDEAD2774 is UNSAT
Problem TDEAD2775 is UNSAT
Problem TDEAD2776 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2779 is UNSAT
Problem TDEAD2780 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2791 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2793 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD2806 is UNSAT
Problem TDEAD2807 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2809 is UNSAT
Problem TDEAD2810 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2812 is UNSAT
Problem TDEAD2813 is UNSAT
Problem TDEAD2814 is UNSAT
Problem TDEAD2815 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2817 is UNSAT
Problem TDEAD2818 is UNSAT
Problem TDEAD2822 is UNSAT
Problem TDEAD2823 is UNSAT
Problem TDEAD2824 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2826 is UNSAT
Problem TDEAD2827 is UNSAT
Problem TDEAD2828 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2830 is UNSAT
Problem TDEAD2831 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2833 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3017 is UNSAT
Problem TDEAD3018 is UNSAT
Problem TDEAD3019 is UNSAT
Problem TDEAD3020 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3025 is UNSAT
Problem TDEAD3026 is UNSAT
Problem TDEAD3027 is UNSAT
Problem TDEAD3028 is UNSAT
Problem TDEAD3029 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3041 is UNSAT
Problem TDEAD3042 is UNSAT
Problem TDEAD3043 is UNSAT
Problem TDEAD3044 is UNSAT
Problem TDEAD3045 is UNSAT
Problem TDEAD3046 is UNSAT
Problem TDEAD3047 is UNSAT
Problem TDEAD3048 is UNSAT
Problem TDEAD3049 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3053 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3058 is UNSAT
Problem TDEAD3059 is UNSAT
Problem TDEAD3060 is UNSAT
Problem TDEAD3061 is UNSAT
Problem TDEAD3062 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3066 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3074 is UNSAT
Problem TDEAD3075 is UNSAT
Problem TDEAD3076 is UNSAT
Problem TDEAD3077 is UNSAT
Problem TDEAD3078 is UNSAT
Problem TDEAD3079 is UNSAT
Problem TDEAD3080 is UNSAT
Problem TDEAD3081 is UNSAT
Problem TDEAD3082 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3086 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3091 is UNSAT
Problem TDEAD3092 is UNSAT
Problem TDEAD3093 is UNSAT
Problem TDEAD3094 is UNSAT
Problem TDEAD3095 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3107 is UNSAT
Problem TDEAD3108 is UNSAT
Problem TDEAD3109 is UNSAT
Problem TDEAD3110 is UNSAT
Problem TDEAD3111 is UNSAT
Problem TDEAD3112 is UNSAT
Problem TDEAD3113 is UNSAT
Problem TDEAD3114 is UNSAT
Problem TDEAD3115 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3119 is UNSAT
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3124 is UNSAT
Problem TDEAD3125 is UNSAT
Problem TDEAD3126 is UNSAT
Problem TDEAD3127 is UNSAT
Problem TDEAD3128 is UNSAT
Problem TDEAD3129 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3131 is UNSAT
Problem TDEAD3132 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3137 is UNSAT
Problem TDEAD3138 is UNSAT
Problem TDEAD3139 is UNSAT
Problem TDEAD3140 is UNSAT
Problem TDEAD3141 is UNSAT
Problem TDEAD3142 is UNSAT
Problem TDEAD3143 is UNSAT
Problem TDEAD3144 is UNSAT
Problem TDEAD3145 is UNSAT
Problem TDEAD3146 is UNSAT
Problem TDEAD3147 is UNSAT
Problem TDEAD3148 is UNSAT
Problem TDEAD3149 is UNSAT
Problem TDEAD3150 is UNSAT
Problem TDEAD3151 is UNSAT
Problem TDEAD3152 is UNSAT
Problem TDEAD3153 is UNSAT
Problem TDEAD3154 is UNSAT
Problem TDEAD3155 is UNSAT
Problem TDEAD3156 is UNSAT
Problem TDEAD3157 is UNSAT
Problem TDEAD3158 is UNSAT
Problem TDEAD3159 is UNSAT
Problem TDEAD3160 is UNSAT
Problem TDEAD3161 is UNSAT
Problem TDEAD3162 is UNSAT
Problem TDEAD3163 is UNSAT
Problem TDEAD3164 is UNSAT
Problem TDEAD3165 is UNSAT
Problem TDEAD3166 is UNSAT
Problem TDEAD3167 is UNSAT
Problem TDEAD3168 is UNSAT
Problem TDEAD3169 is UNSAT
Problem TDEAD3170 is UNSAT
Problem TDEAD3171 is UNSAT
Problem TDEAD3172 is UNSAT
Problem TDEAD3173 is UNSAT
Problem TDEAD3174 is UNSAT
Problem TDEAD3175 is UNSAT
Problem TDEAD3176 is UNSAT
Problem TDEAD3177 is UNSAT
Problem TDEAD3178 is UNSAT
Problem TDEAD3179 is UNSAT
Problem TDEAD3180 is UNSAT
Problem TDEAD3181 is UNSAT
Problem TDEAD3182 is UNSAT
Problem TDEAD3183 is UNSAT
Problem TDEAD3184 is UNSAT
Problem TDEAD3185 is UNSAT
Problem TDEAD3186 is UNSAT
Problem TDEAD3187 is UNSAT
Problem TDEAD3188 is UNSAT
Problem TDEAD3189 is UNSAT
Problem TDEAD3190 is UNSAT
Problem TDEAD3191 is UNSAT
Problem TDEAD3192 is UNSAT
Problem TDEAD3193 is UNSAT
Problem TDEAD3194 is UNSAT
Problem TDEAD3195 is UNSAT
Problem TDEAD3196 is UNSAT
Problem TDEAD3197 is UNSAT
Problem TDEAD3198 is UNSAT
Problem TDEAD3199 is UNSAT
Problem TDEAD3200 is UNSAT
Problem TDEAD3201 is UNSAT
Problem TDEAD3202 is UNSAT
Problem TDEAD3203 is UNSAT
Problem TDEAD3204 is UNSAT
Problem TDEAD3205 is UNSAT
Problem TDEAD3206 is UNSAT
Problem TDEAD3207 is UNSAT
Problem TDEAD3208 is UNSAT
Problem TDEAD3209 is UNSAT
Problem TDEAD3210 is UNSAT
Problem TDEAD3211 is UNSAT
Problem TDEAD3212 is UNSAT
Problem TDEAD3213 is UNSAT
Problem TDEAD3214 is UNSAT
Problem TDEAD3215 is UNSAT
Problem TDEAD3216 is UNSAT
Problem TDEAD3217 is UNSAT
Problem TDEAD3218 is UNSAT
Problem TDEAD3219 is UNSAT
Problem TDEAD3220 is UNSAT
Problem TDEAD3221 is UNSAT
Problem TDEAD3222 is UNSAT
Problem TDEAD3223 is UNSAT
Problem TDEAD3224 is UNSAT
Problem TDEAD3225 is UNSAT
Problem TDEAD3226 is UNSAT
Problem TDEAD3227 is UNSAT
Problem TDEAD3228 is UNSAT
Problem TDEAD3229 is UNSAT
Problem TDEAD3230 is UNSAT
Problem TDEAD3231 is UNSAT
Problem TDEAD3232 is UNSAT
Problem TDEAD3233 is UNSAT
Problem TDEAD3234 is UNSAT
Problem TDEAD3235 is UNSAT
Problem TDEAD3236 is UNSAT
Problem TDEAD3237 is UNSAT
Problem TDEAD3238 is UNSAT
Problem TDEAD3239 is UNSAT
Problem TDEAD3240 is UNSAT
Problem TDEAD3241 is UNSAT
Problem TDEAD3242 is UNSAT
Problem TDEAD3243 is UNSAT
Problem TDEAD3244 is UNSAT
Problem TDEAD3245 is UNSAT
Problem TDEAD3246 is UNSAT
Problem TDEAD3247 is UNSAT
Problem TDEAD3248 is UNSAT
Problem TDEAD3249 is UNSAT
Problem TDEAD3250 is UNSAT
Problem TDEAD3251 is UNSAT
Problem TDEAD3252 is UNSAT
Problem TDEAD3253 is UNSAT
Problem TDEAD3254 is UNSAT
Problem TDEAD3255 is UNSAT
Problem TDEAD3256 is UNSAT
Problem TDEAD3257 is UNSAT
Problem TDEAD3258 is UNSAT
Problem TDEAD3259 is UNSAT
Problem TDEAD3260 is UNSAT
Problem TDEAD3261 is UNSAT
Problem TDEAD3262 is UNSAT
Problem TDEAD3263 is UNSAT
Problem TDEAD3264 is UNSAT
Problem TDEAD3265 is UNSAT
Problem TDEAD3266 is UNSAT
Problem TDEAD3267 is UNSAT
Problem TDEAD3268 is UNSAT
Problem TDEAD3269 is UNSAT
Problem TDEAD3270 is UNSAT
Problem TDEAD3271 is UNSAT
Problem TDEAD3272 is UNSAT
Problem TDEAD3273 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3275 is UNSAT
Problem TDEAD3276 is UNSAT
Problem TDEAD3277 is UNSAT
Problem TDEAD3278 is UNSAT
Problem TDEAD3279 is UNSAT
Problem TDEAD3280 is UNSAT
Problem TDEAD3281 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/3970 variables, and 15 constraints, problems are : Problem set: 460 solved, 3410 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 7/7 constraints]
After SMT, in 102790ms problems are : Problem set: 460 solved, 3410 unsolved
Search for dead transitions found 460 dead transitions in 102864ms
Found 460 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 460 transitions
Dead transitions reduction (with SMT) removed 460 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 270/270 places, 3412/3872 transitions.
Reduce places removed 14 places and 385 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 256 transition count 3027
Reduce places removed 10 places and 196 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 246 transition count 2831
Reduce places removed 11 places and 327 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 35 place count 235 transition count 2504
Reduce places removed 7 places and 189 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 42 place count 228 transition count 2315
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 42 rules in 57 ms. Remains 228 /270 variables (removed 42) and now considering 2315/3412 (removed 1097) transitions.
[2024-06-01 06:56:03] [INFO ] Flow matrix only has 2195 transitions (discarded 120 similar events)
// Phase 1: matrix 2195 rows 228 cols
[2024-06-01 06:56:03] [INFO ] Computed 10 invariants in 28 ms
[2024-06-01 06:56:04] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 06:56:04] [INFO ] Flow matrix only has 2195 transitions (discarded 120 similar events)
[2024-06-01 06:56:04] [INFO ] Invariant cache hit.
[2024-06-01 06:56:04] [INFO ] State equation strengthened by 207 read => feed constraints.
[2024-06-01 06:56:06] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 228/270 places, 2315/3872 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 109317 ms. Remains : 228/270 places, 2315/3872 transitions.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40304 steps (13 resets) in 161 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 190549 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 190549 steps, saw 125028 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-06-01 06:56:09] [INFO ] Flow matrix only has 2195 transitions (discarded 120 similar events)
// Phase 1: matrix 2195 rows 226 cols
[2024-06-01 06:56:09] [INFO ] Computed 8 invariants in 25 ms
[2024-06-01 06:56:09] [INFO ] State equation strengthened by 207 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1070/1136 variables, 66/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1136 variables, 103/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1136 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1089/2225 variables, 80/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2225 variables, 80/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2225 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2226 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2226 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2226 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/2418 variables, 77/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2418 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2418 variables, 24/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2418 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/2421 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2421 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2421 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2421/2421 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, ReadFeed: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1070/1136 variables, 66/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1136 variables, 103/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1136 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1089/2225 variables, 80/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2225 variables, 80/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:56:10] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2225 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2225 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/2226 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2226 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2226 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 192/2418 variables, 77/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2418 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2418 variables, 24/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2418 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2418 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2418 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/2421 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2421 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2421 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2421/2421 variables, and 445 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, ReadFeed: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2925ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 9 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 2315/2315 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 2314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 2314
Applied a total of 2 rules in 86 ms. Remains 225 /226 variables (removed 1) and now considering 2314/2315 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 225/226 places, 2314/2315 transitions.
RANDOM walk for 40492 steps (8 resets) in 81 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189806 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189806 steps, saw 99810 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
[2024-06-01 06:56:15] [INFO ] Flow matrix only has 2194 transitions (discarded 120 similar events)
// Phase 1: matrix 2194 rows 225 cols
[2024-06-01 06:56:15] [INFO ] Computed 8 invariants in 11 ms
[2024-06-01 06:56:15] [INFO ] State equation strengthened by 207 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1070/1136 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1136 variables, 103/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1136 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1089/2225 variables, 80/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2225 variables, 80/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2225 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/2226 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2226 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2226 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/2418 variables, 77/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2418 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2418 variables, 24/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2418 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2419 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2419 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2419 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2419/2419 variables, and 440 constraints, problems are : Problem set: 0 solved, 1 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, ReadFeed: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1070/1136 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1136 variables, 103/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1136 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1089/2225 variables, 80/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2225 variables, 80/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2225 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2226 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2226 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2226 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/2418 variables, 77/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2418 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2418 variables, 24/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2418 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2418 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2418 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/2419 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2419 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2419 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2419/2419 variables, and 444 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1787 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, ReadFeed: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2562ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 125 ms.
Support contains 9 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 2314/2314 transitions.
Applied a total of 0 rules in 36 ms. Remains 225 /225 variables (removed 0) and now considering 2314/2314 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 225/225 places, 2314/2314 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 2314/2314 transitions.
Applied a total of 0 rules in 34 ms. Remains 225 /225 variables (removed 0) and now considering 2314/2314 (removed 0) transitions.
[2024-06-01 06:56:18] [INFO ] Flow matrix only has 2194 transitions (discarded 120 similar events)
[2024-06-01 06:56:18] [INFO ] Invariant cache hit.
[2024-06-01 06:56:18] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-06-01 06:56:18] [INFO ] Flow matrix only has 2194 transitions (discarded 120 similar events)
[2024-06-01 06:56:18] [INFO ] Invariant cache hit.
[2024-06-01 06:56:18] [INFO ] State equation strengthened by 207 read => feed constraints.
[2024-06-01 06:56:19] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 1839 ms to find 0 implicit places.
[2024-06-01 06:56:19] [INFO ] Redundant transitions in 61 ms returned []
Running 2313 sub problems to find dead transitions.
[2024-06-01 06:56:20] [INFO ] Flow matrix only has 2194 transitions (discarded 120 similar events)
[2024-06-01 06:56:20] [INFO ] Invariant cache hit.
[2024-06-01 06:56:20] [INFO ] State equation strengthened by 207 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2313 unsolved
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 5 ms to minimize.
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 TDEAD902 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 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 TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 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 TDEAD942 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 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 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
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 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 TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1745 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
Problem TDEAD1803 is UNSAT
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 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
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 13/21 constraints. Problems are: Problem set: 449 solved, 1864 unsolved
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 Real declared 225/2419 variables, and 21 constraints, problems are : Problem set: 449 solved, 1864 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/225 constraints, ReadFeed: 0/207 constraints, PredecessorRefiner: 2313/2313 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 449 solved, 1864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 7/7 constraints. Problems are: Problem set: 449 solved, 1864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 11/18 constraints. Problems are: Problem set: 449 solved, 1864 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/18 constraints. Problems are: Problem set: 449 solved, 1864 unsolved
At refinement iteration 3 (OVERLAPS) 11/225 variables, 1/19 constraints. Problems are: Problem set: 449 solved, 1864 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 2/21 constraints. Problems are: Problem set: 449 solved, 1864 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/21 constraints. Problems are: Problem set: 449 solved, 1864 unsolved
At refinement iteration 6 (OVERLAPS) 2194/2419 variables, 225/246 constraints. Problems are: Problem set: 449 solved, 1864 unsolved
SMT process timed out in 78443ms, After SMT, problems are : Problem set: 449 solved, 1864 unsolved
Search for dead transitions found 449 dead transitions in 78480ms
Found 449 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 449 transitions
Dead transitions reduction (with SMT) removed 449 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 225/225 places, 1865/2314 transitions.
Graph (complete) has 2423 edges and 225 vertex of which 214 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 0 output transitions
Reduce places removed 21 places and 504 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 193 transition count 1361
Reduce places removed 16 places and 208 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 38 place count 177 transition count 1153
Reduce places removed 11 places and 121 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 49 place count 166 transition count 1032
Reduce places removed 8 places and 56 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 57 place count 158 transition count 976
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 59 place count 156 transition count 930
Reduce places removed 1 places and 15 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 60 place count 155 transition count 915
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 61 place count 154 transition count 906
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 82 place count 133 transition count 764
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 1 places and 30 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 104 place count 132 transition count 734
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 114 place count 122 transition count 654
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 7 with 10 rules applied. Total rules applied 124 place count 122 transition count 654
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 124 rules in 70 ms. Remains 122 /225 variables (removed 103) and now considering 654/1865 (removed 1211) transitions.
[2024-06-01 06:57:38] [INFO ] Flow matrix only has 569 transitions (discarded 85 similar events)
// Phase 1: matrix 569 rows 122 cols
[2024-06-01 06:57:38] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 06:57:38] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 06:57:38] [INFO ] Flow matrix only has 569 transitions (discarded 85 similar events)
[2024-06-01 06:57:38] [INFO ] Invariant cache hit.
[2024-06-01 06:57:38] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-06-01 06:57:39] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 122/225 places, 654/2314 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81072 ms. Remains : 122/225 places, 654/2314 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2023-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 229377 ms.
ITS solved all properties within timeout

BK_STOP 1717225059282

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m256"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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