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.r289-tajo-171654445700318.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 PolyORBLF-PT-S06J04T04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M May 18 16:43 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 PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716870455278

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:27:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 04:27:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:27:37] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2024-05-28 04:27:37] [INFO ] Transformed 454 places.
[2024-05-28 04:27:37] [INFO ] Transformed 6994 transitions.
[2024-05-28 04:27:37] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 595 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
RANDOM walk for 40000 steps (216 resets) in 2591 ms. (15 steps per ms) remains 10/16 properties
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (79 resets) in 313 ms. (127 steps per ms) remains 9/10 properties
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (27 resets) in 451 ms. (88 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (93 resets) in 318 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (84 resets) in 341 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (99 resets) in 311 ms. (128 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (63 resets) in 274 ms. (145 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (80 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (76 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (90 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
[2024-05-28 04:27:39] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-05-28 04:27:39] [INFO ] Computed 50 invariants in 81 ms
[2024-05-28 04:27:39] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 115/304 variables, 17/19 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S06J04T04-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 146/450 variables, 28/47 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/47 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/452 variables, 2/49 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/49 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2042/2044 variables, and 501 constraints, problems are : Problem set: 8 solved, 1 unsolved in 2871 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 452/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 283/284 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/362 variables, 17/21 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/366 variables, 1/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 84/450 variables, 25/47 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-28 04:27:42] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 19 ms to minimize.
[2024-05-28 04:27:42] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-28 04:27:43] [INFO ] Deduced a trap composed of 237 places in 452 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 3/50 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/452 variables, 2/52 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/52 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2042/2044 variables, and 504 constraints, problems are : Problem set: 8 solved, 1 unsolved in 2928 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 452/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 6166ms problems are : Problem set: 8 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 270 place count 316 transition count 1482
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 278 place count 316 transition count 1474
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 286 place count 308 transition count 1474
Applied a total of 286 rules in 264 ms. Remains 308 /454 variables (removed 146) and now considering 1474/1614 (removed 140) transitions.
Running 1468 sub problems to find dead transitions.
[2024-05-28 04:27:45] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 308 cols
[2024-05-28 04:27:45] [INFO ] Computed 44 invariants in 72 ms
[2024-05-28 04:27:45] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 04:28:13] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 2 ms to minimize.
[2024-05-28 04:28:14] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 2 ms to minimize.
[2024-05-28 04:28:14] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2024-05-28 04:28:18] [INFO ] Deduced a trap composed of 86 places in 322 ms of which 3 ms to minimize.
[2024-05-28 04:28:18] [INFO ] Deduced a trap composed of 71 places in 273 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1758 variables, and 42 constraints, problems are : Problem set: 0 solved, 1468 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1468/1468 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1468 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 04:28:27] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 04:28:43] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1758 variables, and 44 constraints, problems are : Problem set: 0 solved, 1468 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1468 constraints, Known Traps: 7/7 constraints]
After SMT, in 59468ms problems are : Problem set: 0 solved, 1468 unsolved
Search for dead transitions found 0 dead transitions in 59491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59781 ms. Remains : 308/454 places, 1474/1614 transitions.
RANDOM walk for 40000 steps (450 resets) in 554 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (154 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199178 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199178 steps, saw 95742 distinct states, run finished after 3005 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-28 04:28:48] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 04:28:48] [INFO ] Invariant cache hit.
[2024-05-28 04:28:48] [INFO ] State equation strengthened by 112 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) 199/200 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:28:48] [INFO ] Deduced a trap composed of 60 places in 269 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 59/259 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:28:49] [INFO ] Deduced a trap composed of 23 places in 426 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 46/305 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:28:49] [INFO ] Deduced a trap composed of 37 places in 511 ms of which 2 ms to minimize.
[2024-05-28 04:28:50] [INFO ] Deduced a trap composed of 90 places in 513 ms of which 2 ms to minimize.
[2024-05-28 04:28:50] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 1 ms to minimize.
[2024-05-28 04:28:50] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/306 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1450/1756 variables, 306/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1756 variables, 112/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1756 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1758 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1758 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1758 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1758 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1758/1758 variables, and 470 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4369 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 308/308 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 199/200 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 59/259 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 46/305 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:28:53] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/306 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1450/1756 variables, 306/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1756 variables, 112/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1756 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1756 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1758 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1758 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1758 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1758 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1758/1758 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3199 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 308/308 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 7595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 289 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1474/1474 transitions.
Applied a total of 0 rules in 37 ms. Remains 308 /308 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 308/308 places, 1474/1474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1474/1474 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
[2024-05-28 04:28:56] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 04:28:56] [INFO ] Invariant cache hit.
[2024-05-28 04:28:57] [INFO ] Implicit Places using invariants in 810 ms returned [29, 202, 240, 280]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 827 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 304/308 places, 1474/1474 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 301 transition count 1471
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 301 transition count 1471
Applied a total of 6 rules in 48 ms. Remains 301 /304 variables (removed 3) and now considering 1471/1474 (removed 3) transitions.
[2024-05-28 04:28:57] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
// Phase 1: matrix 1447 rows 301 cols
[2024-05-28 04:28:57] [INFO ] Computed 40 invariants in 25 ms
[2024-05-28 04:28:58] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2024-05-28 04:28:58] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 04:28:58] [INFO ] Invariant cache hit.
[2024-05-28 04:28:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:29:03] [INFO ] Implicit Places using invariants and state equation in 5490 ms returned []
Implicit Place search using SMT with State Equation took 6714 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 301/308 places, 1471/1474 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7623 ms. Remains : 301/308 places, 1471/1474 transitions.
RANDOM walk for 40000 steps (464 resets) in 565 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (153 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 225375 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 225375 steps, saw 141299 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-28 04:29:07] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 04:29:07] [INFO ] Invariant cache hit.
[2024-05-28 04:29:07] [INFO ] State equation strengthened by 112 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) 220/221 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 29/250 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/299 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:29:07] [INFO ] Deduced a trap composed of 50 places in 309 ms of which 2 ms to minimize.
[2024-05-28 04:29:07] [INFO ] Deduced a trap composed of 50 places in 292 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1447/1746 variables, 299/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1746 variables, 112/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1746 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/1748 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1748 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1748 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1748 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2189 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 220/221 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/250 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/299 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1447/1746 variables, 299/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1746 variables, 112/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1746 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1746 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1748 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1748 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1748 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1748 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1916 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 4135ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 151 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 32 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 301/301 places, 1471/1471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1471/1471 transitions.
Applied a total of 0 rules in 44 ms. Remains 301 /301 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
[2024-05-28 04:29:11] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 04:29:11] [INFO ] Invariant cache hit.
[2024-05-28 04:29:12] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-28 04:29:12] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 04:29:12] [INFO ] Invariant cache hit.
[2024-05-28 04:29:12] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:29:17] [INFO ] Implicit Places using invariants and state equation in 5121 ms returned []
Implicit Place search using SMT with State Equation took 5665 ms to find 0 implicit places.
[2024-05-28 04:29:17] [INFO ] Redundant transitions in 105 ms returned []
Running 1465 sub problems to find dead transitions.
[2024-05-28 04:29:17] [INFO ] Flow matrix only has 1447 transitions (discarded 24 similar events)
[2024-05-28 04:29:17] [INFO ] Invariant cache hit.
[2024-05-28 04:29:17] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-05-28 04:29:45] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-28 04:29:45] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-28 04:29:48] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-28 04:29:49] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-05-28 04:29:55] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-05-28 04:29:56] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/1748 variables, and 35 constraints, problems are : Problem set: 0 solved, 1465 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1465/1465 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
[2024-05-28 04:30:11] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1465 unsolved
Problem TDEAD623 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1463 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/297 variables, 2/38 constraints. Problems are: Problem set: 220 solved, 1245 unsolved
[2024-05-28 04:30:29] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 2 ms to minimize.
[2024-05-28 04:30:29] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-05-28 04:30:30] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 2 ms to minimize.
[2024-05-28 04:30:31] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 1 ms to minimize.
[2024-05-28 04:30:31] [INFO ] Deduced a trap composed of 23 places in 340 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/1748 variables, and 43 constraints, problems are : Problem set: 220 solved, 1245 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1465 constraints, Known Traps: 12/12 constraints]
After SMT, in 80938ms problems are : Problem set: 220 solved, 1245 unsolved
Search for dead transitions found 220 dead transitions in 80953ms
Found 220 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 220 transitions
Dead transitions reduction (with SMT) removed 220 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 301/301 places, 1251/1471 transitions.
Applied a total of 0 rules in 29 ms. Remains 301 /301 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-28 04:30:38] [INFO ] Redundant transitions in 94 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 86915 ms. Remains : 301/301 places, 1251/1471 transitions.
RANDOM walk for 40000 steps (448 resets) in 625 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (161 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 258856 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 258856 steps, saw 155244 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-28 04:30:41] [INFO ] Flow matrix only has 1227 transitions (discarded 24 similar events)
// Phase 1: matrix 1227 rows 301 cols
[2024-05-28 04:30:41] [INFO ] Computed 40 invariants in 26 ms
[2024-05-28 04:30:41] [INFO ] State equation strengthened by 112 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) 170/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/236 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/299 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:30:42] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 2 ms to minimize.
[2024-05-28 04:30:42] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1227/1526 variables, 299/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 112/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/1528 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1528 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1528 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1528 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1528/1528 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 170/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/236 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/299 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:30:43] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1227/1526 variables, 299/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 112/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1526 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1526 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1528 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1528 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1528 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1528 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1528/1528 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2778 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 4571ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 190 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1251/1251 transitions.
Applied a total of 0 rules in 27 ms. Remains 301 /301 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 301/301 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 1251/1251 transitions.
Applied a total of 0 rules in 27 ms. Remains 301 /301 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-28 04:30:46] [INFO ] Flow matrix only has 1227 transitions (discarded 24 similar events)
[2024-05-28 04:30:46] [INFO ] Invariant cache hit.
[2024-05-28 04:30:47] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-05-28 04:30:47] [INFO ] Flow matrix only has 1227 transitions (discarded 24 similar events)
[2024-05-28 04:30:47] [INFO ] Invariant cache hit.
[2024-05-28 04:30:47] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:30:54] [INFO ] Implicit Places using invariants and state equation in 7077 ms returned []
Implicit Place search using SMT with State Equation took 7671 ms to find 0 implicit places.
[2024-05-28 04:30:54] [INFO ] Redundant transitions in 27 ms returned []
Running 1245 sub problems to find dead transitions.
[2024-05-28 04:30:54] [INFO ] Flow matrix only has 1227 transitions (discarded 24 similar events)
[2024-05-28 04:30:54] [INFO ] Invariant cache hit.
[2024-05-28 04:30:54] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
[2024-05-28 04:31:12] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 2 ms to minimize.
[2024-05-28 04:31:12] [INFO ] Deduced a trap composed of 35 places in 212 ms of which 2 ms to minimize.
[2024-05-28 04:31:13] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2024-05-28 04:31:13] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-28 04:31:17] [INFO ] Deduced a trap composed of 87 places in 230 ms of which 1 ms to minimize.
[2024-05-28 04:31:18] [INFO ] Deduced a trap composed of 87 places in 231 ms of which 3 ms to minimize.
[2024-05-28 04:31:18] [INFO ] Deduced a trap composed of 86 places in 259 ms of which 1 ms to minimize.
[2024-05-28 04:31:18] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 2 ms to minimize.
[2024-05-28 04:31:19] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
[2024-05-28 04:31:24] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/1528 variables, and 43 constraints, problems are : Problem set: 0 solved, 1245 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1245/1245 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 4 (OVERLAPS) 2/297 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 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 TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD992 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 TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 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 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 TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 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 TDEAD1135 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 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 TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 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 TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 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 TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1246 is UNSAT
At refinement iteration 6 (OVERLAPS) 4/301 variables, 5/50 constraints. Problems are: Problem set: 392 solved, 853 unsolved
[2024-05-28 04:32:01] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-28 04:32:01] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-05-28 04:32:01] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-05-28 04:32:01] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-28 04:32:02] [INFO ] Deduced a trap composed of 91 places in 419 ms of which 3 ms to minimize.
[2024-05-28 04:32:05] [INFO ] Deduced a trap composed of 121 places in 363 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 301/1528 variables, and 56 constraints, problems are : Problem set: 392 solved, 853 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/301 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1245 constraints, Known Traps: 16/16 constraints]
After SMT, in 72494ms problems are : Problem set: 392 solved, 853 unsolved
Search for dead transitions found 392 dead transitions in 72513ms
Found 392 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 392 transitions
Dead transitions reduction (with SMT) removed 392 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 301/301 places, 859/1251 transitions.
Applied a total of 0 rules in 21 ms. Remains 301 /301 variables (removed 0) and now considering 859/859 (removed 0) transitions.
[2024-05-28 04:32:06] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80301 ms. Remains : 301/301 places, 859/1251 transitions.
RANDOM walk for 40000 steps (463 resets) in 304 ms. (131 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (160 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 298738 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 298738 steps, saw 175311 distinct states, run finished after 3002 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-28 04:32:09] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
// Phase 1: matrix 835 rows 301 cols
[2024-05-28 04:32:10] [INFO ] Computed 40 invariants in 27 ms
[2024-05-28 04:32:10] [INFO ] State equation strengthened by 112 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) 170/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/236 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/299 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:10] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 835/1134 variables, 299/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1134 variables, 112/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1134 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/1136 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1136 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1136 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1136 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1136/1136 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1937 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 170/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/236 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/299 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:12] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-28 04:32:12] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-28 04:32:12] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 2 ms to minimize.
[2024-05-28 04:32:12] [INFO ] Deduced a trap composed of 145 places in 197 ms of which 2 ms to minimize.
[2024-05-28 04:32:12] [INFO ] Deduced a trap composed of 141 places in 209 ms of which 2 ms to minimize.
[2024-05-28 04:32:13] [INFO ] Deduced a trap composed of 129 places in 261 ms of which 3 ms to minimize.
[2024-05-28 04:32:13] [INFO ] Deduced a trap composed of 147 places in 245 ms of which 2 ms to minimize.
[2024-05-28 04:32:13] [INFO ] Deduced a trap composed of 133 places in 222 ms of which 2 ms to minimize.
[2024-05-28 04:32:13] [INFO ] Deduced a trap composed of 150 places in 258 ms of which 2 ms to minimize.
[2024-05-28 04:32:14] [INFO ] Deduced a trap composed of 130 places in 232 ms of which 3 ms to minimize.
[2024-05-28 04:32:14] [INFO ] Deduced a trap composed of 148 places in 229 ms of which 2 ms to minimize.
[2024-05-28 04:32:14] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 2 ms to minimize.
[2024-05-28 04:32:14] [INFO ] Deduced a trap composed of 138 places in 260 ms of which 3 ms to minimize.
[2024-05-28 04:32:15] [INFO ] Deduced a trap composed of 147 places in 247 ms of which 2 ms to minimize.
[2024-05-28 04:32:15] [INFO ] Deduced a trap composed of 133 places in 250 ms of which 2 ms to minimize.
[2024-05-28 04:32:15] [INFO ] Deduced a trap composed of 140 places in 236 ms of which 2 ms to minimize.
[2024-05-28 04:32:15] [INFO ] Deduced a trap composed of 148 places in 220 ms of which 2 ms to minimize.
[2024-05-28 04:32:16] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 2 ms to minimize.
[2024-05-28 04:32:16] [INFO ] Deduced a trap composed of 135 places in 245 ms of which 2 ms to minimize.
[2024-05-28 04:32:16] [INFO ] Deduced a trap composed of 154 places in 266 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:16] [INFO ] Deduced a trap composed of 127 places in 250 ms of which 2 ms to minimize.
[2024-05-28 04:32:17] [INFO ] Deduced a trap composed of 152 places in 220 ms of which 2 ms to minimize.
[2024-05-28 04:32:17] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 2 ms to minimize.
[2024-05-28 04:32:17] [INFO ] Deduced a trap composed of 145 places in 223 ms of which 2 ms to minimize.
[2024-05-28 04:32:17] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 2 ms to minimize.
[2024-05-28 04:32:18] [INFO ] Deduced a trap composed of 128 places in 207 ms of which 2 ms to minimize.
[2024-05-28 04:32:18] [INFO ] Deduced a trap composed of 128 places in 224 ms of which 2 ms to minimize.
[2024-05-28 04:32:18] [INFO ] Deduced a trap composed of 148 places in 214 ms of which 2 ms to minimize.
[2024-05-28 04:32:18] [INFO ] Deduced a trap composed of 150 places in 244 ms of which 2 ms to minimize.
[2024-05-28 04:32:19] [INFO ] Deduced a trap composed of 133 places in 234 ms of which 2 ms to minimize.
[2024-05-28 04:32:19] [INFO ] Deduced a trap composed of 142 places in 222 ms of which 2 ms to minimize.
[2024-05-28 04:32:19] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 2 ms to minimize.
[2024-05-28 04:32:19] [INFO ] Deduced a trap composed of 142 places in 246 ms of which 2 ms to minimize.
[2024-05-28 04:32:20] [INFO ] Deduced a trap composed of 142 places in 268 ms of which 2 ms to minimize.
[2024-05-28 04:32:20] [INFO ] Deduced a trap composed of 124 places in 246 ms of which 2 ms to minimize.
[2024-05-28 04:32:20] [INFO ] Deduced a trap composed of 136 places in 232 ms of which 2 ms to minimize.
[2024-05-28 04:32:20] [INFO ] Deduced a trap composed of 140 places in 227 ms of which 3 ms to minimize.
[2024-05-28 04:32:21] [INFO ] Deduced a trap composed of 145 places in 227 ms of which 3 ms to minimize.
[2024-05-28 04:32:21] [INFO ] Deduced a trap composed of 151 places in 210 ms of which 2 ms to minimize.
[2024-05-28 04:32:21] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:21] [INFO ] Deduced a trap composed of 124 places in 237 ms of which 2 ms to minimize.
[2024-05-28 04:32:22] [INFO ] Deduced a trap composed of 145 places in 239 ms of which 2 ms to minimize.
[2024-05-28 04:32:22] [INFO ] Deduced a trap composed of 153 places in 221 ms of which 2 ms to minimize.
[2024-05-28 04:32:22] [INFO ] Deduced a trap composed of 131 places in 222 ms of which 1 ms to minimize.
[2024-05-28 04:32:22] [INFO ] Deduced a trap composed of 144 places in 247 ms of which 2 ms to minimize.
[2024-05-28 04:32:23] [INFO ] Deduced a trap composed of 111 places in 232 ms of which 2 ms to minimize.
[2024-05-28 04:32:23] [INFO ] Deduced a trap composed of 161 places in 229 ms of which 2 ms to minimize.
[2024-05-28 04:32:23] [INFO ] Deduced a trap composed of 151 places in 227 ms of which 3 ms to minimize.
[2024-05-28 04:32:23] [INFO ] Deduced a trap composed of 134 places in 211 ms of which 2 ms to minimize.
[2024-05-28 04:32:23] [INFO ] Deduced a trap composed of 144 places in 246 ms of which 2 ms to minimize.
[2024-05-28 04:32:24] [INFO ] Deduced a trap composed of 134 places in 239 ms of which 2 ms to minimize.
[2024-05-28 04:32:24] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 2 ms to minimize.
[2024-05-28 04:32:24] [INFO ] Deduced a trap composed of 152 places in 258 ms of which 2 ms to minimize.
[2024-05-28 04:32:24] [INFO ] Deduced a trap composed of 129 places in 240 ms of which 2 ms to minimize.
[2024-05-28 04:32:25] [INFO ] Deduced a trap composed of 149 places in 200 ms of which 2 ms to minimize.
[2024-05-28 04:32:25] [INFO ] Deduced a trap composed of 142 places in 236 ms of which 2 ms to minimize.
[2024-05-28 04:32:25] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 2 ms to minimize.
[2024-05-28 04:32:25] [INFO ] Deduced a trap composed of 134 places in 207 ms of which 2 ms to minimize.
[2024-05-28 04:32:26] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 2 ms to minimize.
[2024-05-28 04:32:26] [INFO ] Deduced a trap composed of 121 places in 253 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:26] [INFO ] Deduced a trap composed of 122 places in 264 ms of which 2 ms to minimize.
[2024-05-28 04:32:27] [INFO ] Deduced a trap composed of 114 places in 252 ms of which 2 ms to minimize.
[2024-05-28 04:32:27] [INFO ] Deduced a trap composed of 150 places in 260 ms of which 2 ms to minimize.
[2024-05-28 04:32:27] [INFO ] Deduced a trap composed of 152 places in 272 ms of which 3 ms to minimize.
[2024-05-28 04:32:27] [INFO ] Deduced a trap composed of 139 places in 253 ms of which 3 ms to minimize.
[2024-05-28 04:32:28] [INFO ] Deduced a trap composed of 131 places in 273 ms of which 3 ms to minimize.
[2024-05-28 04:32:28] [INFO ] Deduced a trap composed of 119 places in 258 ms of which 2 ms to minimize.
[2024-05-28 04:32:28] [INFO ] Deduced a trap composed of 114 places in 248 ms of which 2 ms to minimize.
[2024-05-28 04:32:28] [INFO ] Deduced a trap composed of 148 places in 247 ms of which 1 ms to minimize.
[2024-05-28 04:32:29] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 2 ms to minimize.
[2024-05-28 04:32:29] [INFO ] Deduced a trap composed of 127 places in 232 ms of which 2 ms to minimize.
[2024-05-28 04:32:29] [INFO ] Deduced a trap composed of 145 places in 219 ms of which 2 ms to minimize.
[2024-05-28 04:32:29] [INFO ] Deduced a trap composed of 126 places in 220 ms of which 2 ms to minimize.
[2024-05-28 04:32:30] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 1 ms to minimize.
[2024-05-28 04:32:30] [INFO ] Deduced a trap composed of 128 places in 228 ms of which 2 ms to minimize.
[2024-05-28 04:32:30] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 2 ms to minimize.
[2024-05-28 04:32:30] [INFO ] Deduced a trap composed of 124 places in 238 ms of which 2 ms to minimize.
[2024-05-28 04:32:31] [INFO ] Deduced a trap composed of 96 places in 233 ms of which 2 ms to minimize.
[2024-05-28 04:32:31] [INFO ] Deduced a trap composed of 117 places in 230 ms of which 2 ms to minimize.
[2024-05-28 04:32:31] [INFO ] Deduced a trap composed of 108 places in 223 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:31] [INFO ] Deduced a trap composed of 132 places in 235 ms of which 2 ms to minimize.
[2024-05-28 04:32:32] [INFO ] Deduced a trap composed of 154 places in 214 ms of which 2 ms to minimize.
[2024-05-28 04:32:32] [INFO ] Deduced a trap composed of 148 places in 239 ms of which 2 ms to minimize.
[2024-05-28 04:32:32] [INFO ] Deduced a trap composed of 118 places in 258 ms of which 2 ms to minimize.
[2024-05-28 04:32:33] [INFO ] Deduced a trap composed of 133 places in 250 ms of which 2 ms to minimize.
[2024-05-28 04:32:33] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 2 ms to minimize.
[2024-05-28 04:32:33] [INFO ] Deduced a trap composed of 138 places in 277 ms of which 2 ms to minimize.
[2024-05-28 04:32:33] [INFO ] Deduced a trap composed of 135 places in 234 ms of which 2 ms to minimize.
[2024-05-28 04:32:34] [INFO ] Deduced a trap composed of 150 places in 256 ms of which 3 ms to minimize.
[2024-05-28 04:32:34] [INFO ] Deduced a trap composed of 154 places in 228 ms of which 2 ms to minimize.
[2024-05-28 04:32:34] [INFO ] Deduced a trap composed of 143 places in 238 ms of which 3 ms to minimize.
[2024-05-28 04:32:34] [INFO ] Deduced a trap composed of 143 places in 251 ms of which 4 ms to minimize.
[2024-05-28 04:32:35] [INFO ] Deduced a trap composed of 138 places in 219 ms of which 2 ms to minimize.
[2024-05-28 04:32:35] [INFO ] Deduced a trap composed of 129 places in 197 ms of which 2 ms to minimize.
[2024-05-28 04:32:35] [INFO ] Deduced a trap composed of 152 places in 240 ms of which 2 ms to minimize.
[2024-05-28 04:32:36] [INFO ] Deduced a trap composed of 154 places in 241 ms of which 2 ms to minimize.
[2024-05-28 04:32:36] [INFO ] Deduced a trap composed of 142 places in 217 ms of which 2 ms to minimize.
[2024-05-28 04:32:36] [INFO ] Deduced a trap composed of 111 places in 273 ms of which 2 ms to minimize.
[2024-05-28 04:32:36] [INFO ] Deduced a trap composed of 155 places in 241 ms of which 2 ms to minimize.
[2024-05-28 04:32:37] [INFO ] Deduced a trap composed of 114 places in 243 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:37] [INFO ] Deduced a trap composed of 152 places in 203 ms of which 2 ms to minimize.
[2024-05-28 04:32:37] [INFO ] Deduced a trap composed of 117 places in 205 ms of which 2 ms to minimize.
[2024-05-28 04:32:37] [INFO ] Deduced a trap composed of 144 places in 202 ms of which 2 ms to minimize.
[2024-05-28 04:32:38] [INFO ] Deduced a trap composed of 157 places in 264 ms of which 2 ms to minimize.
[2024-05-28 04:32:38] [INFO ] Deduced a trap composed of 154 places in 211 ms of which 2 ms to minimize.
[2024-05-28 04:32:38] [INFO ] Deduced a trap composed of 119 places in 201 ms of which 2 ms to minimize.
[2024-05-28 04:32:38] [INFO ] Deduced a trap composed of 131 places in 212 ms of which 2 ms to minimize.
[2024-05-28 04:32:39] [INFO ] Deduced a trap composed of 122 places in 256 ms of which 2 ms to minimize.
[2024-05-28 04:32:39] [INFO ] Deduced a trap composed of 145 places in 218 ms of which 2 ms to minimize.
[2024-05-28 04:32:39] [INFO ] Deduced a trap composed of 147 places in 212 ms of which 2 ms to minimize.
[2024-05-28 04:32:39] [INFO ] Deduced a trap composed of 119 places in 175 ms of which 2 ms to minimize.
[2024-05-28 04:32:39] [INFO ] Deduced a trap composed of 110 places in 179 ms of which 2 ms to minimize.
[2024-05-28 04:32:40] [INFO ] Deduced a trap composed of 161 places in 186 ms of which 2 ms to minimize.
[2024-05-28 04:32:40] [INFO ] Deduced a trap composed of 110 places in 188 ms of which 2 ms to minimize.
[2024-05-28 04:32:40] [INFO ] Deduced a trap composed of 136 places in 255 ms of which 2 ms to minimize.
[2024-05-28 04:32:40] [INFO ] Deduced a trap composed of 107 places in 176 ms of which 2 ms to minimize.
[2024-05-28 04:32:41] [INFO ] Deduced a trap composed of 125 places in 172 ms of which 1 ms to minimize.
[2024-05-28 04:32:41] [INFO ] Deduced a trap composed of 150 places in 219 ms of which 2 ms to minimize.
[2024-05-28 04:32:41] [INFO ] Deduced a trap composed of 97 places in 180 ms of which 2 ms to minimize.
[2024-05-28 04:32:41] [INFO ] Deduced a trap composed of 146 places in 189 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:41] [INFO ] Deduced a trap composed of 121 places in 186 ms of which 2 ms to minimize.
[2024-05-28 04:32:42] [INFO ] Deduced a trap composed of 140 places in 207 ms of which 2 ms to minimize.
[2024-05-28 04:32:42] [INFO ] Deduced a trap composed of 121 places in 208 ms of which 2 ms to minimize.
[2024-05-28 04:32:42] [INFO ] Deduced a trap composed of 111 places in 210 ms of which 2 ms to minimize.
[2024-05-28 04:32:42] [INFO ] Deduced a trap composed of 118 places in 246 ms of which 2 ms to minimize.
[2024-05-28 04:32:43] [INFO ] Deduced a trap composed of 122 places in 223 ms of which 2 ms to minimize.
[2024-05-28 04:32:43] [INFO ] Deduced a trap composed of 124 places in 228 ms of which 2 ms to minimize.
[2024-05-28 04:32:43] [INFO ] Deduced a trap composed of 106 places in 213 ms of which 2 ms to minimize.
[2024-05-28 04:32:43] [INFO ] Deduced a trap composed of 99 places in 210 ms of which 2 ms to minimize.
[2024-05-28 04:32:44] [INFO ] Deduced a trap composed of 107 places in 242 ms of which 2 ms to minimize.
[2024-05-28 04:32:44] [INFO ] Deduced a trap composed of 105 places in 215 ms of which 2 ms to minimize.
[2024-05-28 04:32:44] [INFO ] Deduced a trap composed of 148 places in 210 ms of which 1 ms to minimize.
[2024-05-28 04:32:44] [INFO ] Deduced a trap composed of 113 places in 222 ms of which 2 ms to minimize.
[2024-05-28 04:32:45] [INFO ] Deduced a trap composed of 118 places in 220 ms of which 2 ms to minimize.
[2024-05-28 04:32:45] [INFO ] Deduced a trap composed of 101 places in 207 ms of which 2 ms to minimize.
[2024-05-28 04:32:45] [INFO ] Deduced a trap composed of 110 places in 214 ms of which 2 ms to minimize.
[2024-05-28 04:32:45] [INFO ] Deduced a trap composed of 125 places in 211 ms of which 2 ms to minimize.
[2024-05-28 04:32:46] [INFO ] Deduced a trap composed of 105 places in 210 ms of which 2 ms to minimize.
[2024-05-28 04:32:46] [INFO ] Deduced a trap composed of 94 places in 266 ms of which 2 ms to minimize.
[2024-05-28 04:32:46] [INFO ] Deduced a trap composed of 121 places in 208 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:46] [INFO ] Deduced a trap composed of 139 places in 264 ms of which 2 ms to minimize.
[2024-05-28 04:32:47] [INFO ] Deduced a trap composed of 117 places in 241 ms of which 2 ms to minimize.
[2024-05-28 04:32:47] [INFO ] Deduced a trap composed of 116 places in 246 ms of which 3 ms to minimize.
[2024-05-28 04:32:47] [INFO ] Deduced a trap composed of 97 places in 209 ms of which 2 ms to minimize.
[2024-05-28 04:32:47] [INFO ] Deduced a trap composed of 104 places in 207 ms of which 2 ms to minimize.
[2024-05-28 04:32:48] [INFO ] Deduced a trap composed of 127 places in 270 ms of which 3 ms to minimize.
[2024-05-28 04:32:48] [INFO ] Deduced a trap composed of 107 places in 257 ms of which 2 ms to minimize.
[2024-05-28 04:32:48] [INFO ] Deduced a trap composed of 103 places in 233 ms of which 2 ms to minimize.
[2024-05-28 04:32:48] [INFO ] Deduced a trap composed of 111 places in 221 ms of which 2 ms to minimize.
[2024-05-28 04:32:49] [INFO ] Deduced a trap composed of 100 places in 213 ms of which 2 ms to minimize.
[2024-05-28 04:32:49] [INFO ] Deduced a trap composed of 104 places in 244 ms of which 3 ms to minimize.
[2024-05-28 04:32:49] [INFO ] Deduced a trap composed of 108 places in 263 ms of which 2 ms to minimize.
[2024-05-28 04:32:50] [INFO ] Deduced a trap composed of 113 places in 199 ms of which 2 ms to minimize.
[2024-05-28 04:32:50] [INFO ] Deduced a trap composed of 141 places in 190 ms of which 2 ms to minimize.
[2024-05-28 04:32:50] [INFO ] Deduced a trap composed of 107 places in 231 ms of which 2 ms to minimize.
[2024-05-28 04:32:51] [INFO ] Deduced a trap composed of 124 places in 209 ms of which 2 ms to minimize.
[2024-05-28 04:32:51] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 2 ms to minimize.
[2024-05-28 04:32:52] [INFO ] Deduced a trap composed of 144 places in 210 ms of which 2 ms to minimize.
[2024-05-28 04:32:52] [INFO ] Deduced a trap composed of 102 places in 230 ms of which 2 ms to minimize.
[2024-05-28 04:32:52] [INFO ] Deduced a trap composed of 140 places in 252 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:53] [INFO ] Deduced a trap composed of 132 places in 210 ms of which 2 ms to minimize.
[2024-05-28 04:32:53] [INFO ] Deduced a trap composed of 99 places in 236 ms of which 2 ms to minimize.
[2024-05-28 04:32:53] [INFO ] Deduced a trap composed of 111 places in 209 ms of which 2 ms to minimize.
[2024-05-28 04:32:53] [INFO ] Deduced a trap composed of 98 places in 270 ms of which 2 ms to minimize.
[2024-05-28 04:32:54] [INFO ] Deduced a trap composed of 115 places in 262 ms of which 2 ms to minimize.
[2024-05-28 04:32:54] [INFO ] Deduced a trap composed of 102 places in 242 ms of which 2 ms to minimize.
[2024-05-28 04:32:54] [INFO ] Deduced a trap composed of 132 places in 208 ms of which 2 ms to minimize.
[2024-05-28 04:32:54] [INFO ] Deduced a trap composed of 128 places in 186 ms of which 2 ms to minimize.
[2024-05-28 04:32:55] [INFO ] Deduced a trap composed of 103 places in 178 ms of which 1 ms to minimize.
[2024-05-28 04:32:55] [INFO ] Deduced a trap composed of 117 places in 212 ms of which 2 ms to minimize.
[2024-05-28 04:32:55] [INFO ] Deduced a trap composed of 101 places in 212 ms of which 2 ms to minimize.
[2024-05-28 04:32:56] [INFO ] Deduced a trap composed of 124 places in 212 ms of which 2 ms to minimize.
[2024-05-28 04:32:56] [INFO ] Deduced a trap composed of 121 places in 183 ms of which 2 ms to minimize.
[2024-05-28 04:32:56] [INFO ] Deduced a trap composed of 118 places in 185 ms of which 2 ms to minimize.
[2024-05-28 04:32:56] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 2 ms to minimize.
[2024-05-28 04:32:56] [INFO ] Deduced a trap composed of 120 places in 175 ms of which 1 ms to minimize.
[2024-05-28 04:32:57] [INFO ] Deduced a trap composed of 123 places in 179 ms of which 2 ms to minimize.
[2024-05-28 04:32:57] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 2 ms to minimize.
[2024-05-28 04:32:57] [INFO ] Deduced a trap composed of 100 places in 174 ms of which 2 ms to minimize.
[2024-05-28 04:32:58] [INFO ] Deduced a trap composed of 108 places in 180 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:58] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 2 ms to minimize.
[2024-05-28 04:32:58] [INFO ] Deduced a trap composed of 120 places in 177 ms of which 2 ms to minimize.
[2024-05-28 04:32:59] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 2 ms to minimize.
[2024-05-28 04:32:59] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 2 ms to minimize.
[2024-05-28 04:32:59] [INFO ] Deduced a trap composed of 113 places in 197 ms of which 2 ms to minimize.
[2024-05-28 04:32:59] [INFO ] Deduced a trap composed of 118 places in 186 ms of which 1 ms to minimize.
[2024-05-28 04:33:00] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 1 ms to minimize.
[2024-05-28 04:33:00] [INFO ] Deduced a trap composed of 119 places in 195 ms of which 2 ms to minimize.
[2024-05-28 04:33:00] [INFO ] Deduced a trap composed of 116 places in 196 ms of which 2 ms to minimize.
[2024-05-28 04:33:00] [INFO ] Deduced a trap composed of 144 places in 187 ms of which 2 ms to minimize.
[2024-05-28 04:33:01] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 2 ms to minimize.
[2024-05-28 04:33:01] [INFO ] Deduced a trap composed of 112 places in 191 ms of which 1 ms to minimize.
[2024-05-28 04:33:01] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 2 ms to minimize.
[2024-05-28 04:33:01] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 2 ms to minimize.
[2024-05-28 04:33:02] [INFO ] Deduced a trap composed of 119 places in 188 ms of which 2 ms to minimize.
[2024-05-28 04:33:02] [INFO ] Deduced a trap composed of 118 places in 205 ms of which 2 ms to minimize.
[2024-05-28 04:33:02] [INFO ] Deduced a trap composed of 117 places in 180 ms of which 2 ms to minimize.
[2024-05-28 04:33:02] [INFO ] Deduced a trap composed of 119 places in 195 ms of which 4 ms to minimize.
[2024-05-28 04:33:03] [INFO ] Deduced a trap composed of 121 places in 182 ms of which 2 ms to minimize.
[2024-05-28 04:33:03] [INFO ] Deduced a trap composed of 136 places in 188 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:33:04] [INFO ] Deduced a trap composed of 125 places in 255 ms of which 2 ms to minimize.
[2024-05-28 04:33:04] [INFO ] Deduced a trap composed of 100 places in 243 ms of which 2 ms to minimize.
[2024-05-28 04:33:04] [INFO ] Deduced a trap composed of 112 places in 233 ms of which 2 ms to minimize.
[2024-05-28 04:33:04] [INFO ] Deduced a trap composed of 145 places in 221 ms of which 3 ms to minimize.
[2024-05-28 04:33:05] [INFO ] Deduced a trap composed of 88 places in 226 ms of which 3 ms to minimize.
[2024-05-28 04:33:05] [INFO ] Deduced a trap composed of 112 places in 223 ms of which 2 ms to minimize.
[2024-05-28 04:33:05] [INFO ] Deduced a trap composed of 103 places in 229 ms of which 2 ms to minimize.
[2024-05-28 04:33:06] [INFO ] Deduced a trap composed of 105 places in 179 ms of which 2 ms to minimize.
[2024-05-28 04:33:06] [INFO ] Deduced a trap composed of 78 places in 270 ms of which 3 ms to minimize.
[2024-05-28 04:33:06] [INFO ] Deduced a trap composed of 145 places in 251 ms of which 3 ms to minimize.
[2024-05-28 04:33:06] [INFO ] Deduced a trap composed of 102 places in 210 ms of which 2 ms to minimize.
[2024-05-28 04:33:07] [INFO ] Deduced a trap composed of 115 places in 182 ms of which 1 ms to minimize.
[2024-05-28 04:33:07] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 2 ms to minimize.
[2024-05-28 04:33:08] [INFO ] Deduced a trap composed of 110 places in 239 ms of which 2 ms to minimize.
[2024-05-28 04:33:08] [INFO ] Deduced a trap composed of 111 places in 195 ms of which 1 ms to minimize.
[2024-05-28 04:33:08] [INFO ] Deduced a trap composed of 117 places in 201 ms of which 2 ms to minimize.
[2024-05-28 04:33:08] [INFO ] Deduced a trap composed of 116 places in 198 ms of which 2 ms to minimize.
[2024-05-28 04:33:09] [INFO ] Deduced a trap composed of 118 places in 214 ms of which 2 ms to minimize.
[2024-05-28 04:33:09] [INFO ] Deduced a trap composed of 117 places in 192 ms of which 2 ms to minimize.
[2024-05-28 04:33:09] [INFO ] Deduced a trap composed of 129 places in 185 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:33:10] [INFO ] Deduced a trap composed of 105 places in 251 ms of which 2 ms to minimize.
[2024-05-28 04:33:10] [INFO ] Deduced a trap composed of 98 places in 279 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/299 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/299 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 835/1134 variables, 299/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1134 variables, 112/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1134 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:33:12] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 2 ms to minimize.
[2024-05-28 04:33:12] [INFO ] Deduced a trap composed of 147 places in 219 ms of which 2 ms to minimize.
[2024-05-28 04:33:13] [INFO ] Deduced a trap composed of 134 places in 233 ms of which 2 ms to minimize.
[2024-05-28 04:33:13] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 2 ms to minimize.
[2024-05-28 04:33:13] [INFO ] Deduced a trap composed of 148 places in 244 ms of which 2 ms to minimize.
[2024-05-28 04:33:14] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1134 variables, 6/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:33:15] [INFO ] Deduced a trap composed of 154 places in 290 ms of which 2 ms to minimize.
[2024-05-28 04:33:15] [INFO ] Deduced a trap composed of 147 places in 285 ms of which 2 ms to minimize.
[2024-05-28 04:33:16] [INFO ] Deduced a trap composed of 148 places in 251 ms of which 2 ms to minimize.
[2024-05-28 04:33:16] [INFO ] Deduced a trap composed of 147 places in 217 ms of which 2 ms to minimize.
[2024-05-28 04:33:16] [INFO ] Deduced a trap composed of 147 places in 207 ms of which 3 ms to minimize.
[2024-05-28 04:33:17] [INFO ] Deduced a trap composed of 144 places in 279 ms of which 2 ms to minimize.
[2024-05-28 04:33:17] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 2 ms to minimize.
[2024-05-28 04:33:18] [INFO ] Deduced a trap composed of 145 places in 260 ms of which 2 ms to minimize.
[2024-05-28 04:33:18] [INFO ] Deduced a trap composed of 134 places in 219 ms of which 3 ms to minimize.
[2024-05-28 04:33:19] [INFO ] Deduced a trap composed of 146 places in 246 ms of which 3 ms to minimize.
[2024-05-28 04:33:20] [INFO ] Deduced a trap composed of 148 places in 215 ms of which 2 ms to minimize.
[2024-05-28 04:33:20] [INFO ] Deduced a trap composed of 141 places in 270 ms of which 3 ms to minimize.
[2024-05-28 04:33:20] [INFO ] Deduced a trap composed of 134 places in 181 ms of which 2 ms to minimize.
[2024-05-28 04:33:21] [INFO ] Deduced a trap composed of 138 places in 233 ms of which 2 ms to minimize.
[2024-05-28 04:33:21] [INFO ] Deduced a trap composed of 134 places in 231 ms of which 2 ms to minimize.
[2024-05-28 04:33:22] [INFO ] Deduced a trap composed of 136 places in 220 ms of which 2 ms to minimize.
[2024-05-28 04:33:22] [INFO ] Deduced a trap composed of 142 places in 249 ms of which 1 ms to minimize.
[2024-05-28 04:33:23] [INFO ] Deduced a trap composed of 141 places in 224 ms of which 2 ms to minimize.
[2024-05-28 04:33:23] [INFO ] Deduced a trap composed of 148 places in 268 ms of which 2 ms to minimize.
[2024-05-28 04:33:24] [INFO ] Deduced a trap composed of 141 places in 222 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1134 variables, 20/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:33:25] [INFO ] Deduced a trap composed of 153 places in 182 ms of which 2 ms to minimize.
[2024-05-28 04:33:25] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 2 ms to minimize.
[2024-05-28 04:33:25] [INFO ] Deduced a trap composed of 134 places in 186 ms of which 2 ms to minimize.
[2024-05-28 04:33:26] [INFO ] Deduced a trap composed of 133 places in 244 ms of which 2 ms to minimize.
[2024-05-28 04:33:27] [INFO ] Deduced a trap composed of 138 places in 235 ms of which 1 ms to minimize.
[2024-05-28 04:33:29] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 2 ms to minimize.
[2024-05-28 04:33:32] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 2 ms to minimize.
[2024-05-28 04:33:33] [INFO ] Deduced a trap composed of 151 places in 181 ms of which 2 ms to minimize.
[2024-05-28 04:33:33] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 2 ms to minimize.
[2024-05-28 04:33:35] [INFO ] Deduced a trap composed of 144 places in 194 ms of which 1 ms to minimize.
[2024-05-28 04:33:35] [INFO ] Deduced a trap composed of 133 places in 193 ms of which 1 ms to minimize.
[2024-05-28 04:33:35] [INFO ] Deduced a trap composed of 134 places in 188 ms of which 2 ms to minimize.
[2024-05-28 04:33:35] [INFO ] Deduced a trap composed of 148 places in 166 ms of which 2 ms to minimize.
[2024-05-28 04:33:36] [INFO ] Deduced a trap composed of 135 places in 190 ms of which 2 ms to minimize.
[2024-05-28 04:33:36] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 2 ms to minimize.
[2024-05-28 04:33:38] [INFO ] Deduced a trap composed of 139 places in 252 ms of which 3 ms to minimize.
[2024-05-28 04:33:38] [INFO ] Deduced a trap composed of 159 places in 235 ms of which 2 ms to minimize.
[2024-05-28 04:33:38] [INFO ] Deduced a trap composed of 139 places in 193 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1134 variables, 18/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1134 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/1136 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1136 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1136 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1136 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1136/1136 variables, and 721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87374 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/301 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 267/267 constraints]
After SMT, in 89356ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 859/859 transitions.
Applied a total of 0 rules in 16 ms. Remains 301 /301 variables (removed 0) and now considering 859/859 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 301/301 places, 859/859 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 859/859 transitions.
Applied a total of 0 rules in 16 ms. Remains 301 /301 variables (removed 0) and now considering 859/859 (removed 0) transitions.
[2024-05-28 04:33:39] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
[2024-05-28 04:33:39] [INFO ] Invariant cache hit.
[2024-05-28 04:33:39] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-28 04:33:39] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
[2024-05-28 04:33:39] [INFO ] Invariant cache hit.
[2024-05-28 04:33:40] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:33:47] [INFO ] Implicit Places using invariants and state equation in 7124 ms returned []
Implicit Place search using SMT with State Equation took 7601 ms to find 0 implicit places.
[2024-05-28 04:33:47] [INFO ] Redundant transitions in 24 ms returned []
Running 853 sub problems to find dead transitions.
[2024-05-28 04:33:47] [INFO ] Flow matrix only has 835 transitions (discarded 24 similar events)
[2024-05-28 04:33:47] [INFO ] Invariant cache hit.
[2024-05-28 04:33:47] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 853 unsolved
[2024-05-28 04:33:53] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-05-28 04:33:53] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2024-05-28 04:33:56] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 1 ms to minimize.
[2024-05-28 04:33:57] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 853 unsolved
[2024-05-28 04:33:59] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 5 (OVERLAPS) 2/297 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 853 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 853 unsolved
SMT process timed out in 32445ms, After SMT, problems are : Problem set: 0 solved, 853 unsolved
Search for dead transitions found 0 dead transitions in 32461ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40111 ms. Remains : 301/301 places, 859/859 transitions.
[2024-05-28 04:34:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-28 04:34:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 301 places, 859 transitions and 5297 arcs took 16 ms.
[2024-05-28 04:34:19] [INFO ] Flatten gal took : 129 ms
Total runtime 403263 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J04T04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 301
TRANSITIONS: 859
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.025s, Sys 0.000s]


SAVING FILE /home/mcc/execution/420/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1652
MODEL NAME: /home/mcc/execution/420/model
301 places, 859 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 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="PolyORBLF-PT-S06J04T04"
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 PolyORBLF-PT-S06J04T04, 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 r289-tajo-171654445700318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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