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.r516-tajo-171654447200493.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717261270592

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:01:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 17:01:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:01:12] [INFO ] Load time of PNML (sax parser for PT used): 668 ms
[2024-06-01 17:01:12] [INFO ] Transformed 664 places.
[2024-06-01 17:01:12] [INFO ] Transformed 12050 transitions.
[2024-06-01 17:01:13] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 926 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 10, 0, 1, 0, 0, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 10, 0, 1, 0, 0, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 17:01:13] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-06-01 17:01:13] [INFO ] Computed 92 invariants in 98 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 10, 0, 1, 0, 0, 0, 0, 0, 0, 1] Max Struct:[75, 151, 302, 75, 1, 35, +inf, 4, 19, 138, 34, 75, 1, 1, 100, 1]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (559 resets) in 216 ms. (46 steps per ms)
FORMULA PolyORBNT-PT-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130010 steps (1284 resets) in 481 ms. (269 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 1, 10, 0, 1, 1, 1, 1, 0, 1] Max Struct:[75, 151, 302, 75, 35, +inf, 4, 19, 138, 34, 75, 1, 100]
[2024-06-01 17:01:14] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:01:14] [INFO ] Invariant cache hit.
[2024-06-01 17:01:14] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:01:14] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 34 ms returned unsat
[2024-06-01 17:01:14] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-06-01 17:01:14] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 22 ms returned sat
[2024-06-01 17:01:15] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2024-06-01 17:01:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:01:15] [INFO ] [Nat]Absence check using 63 positive place invariants in 22 ms returned sat
[2024-06-01 17:01:15] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 49 ms returned sat
[2024-06-01 17:01:16] [INFO ] [Nat]Absence check using state equation in 984 ms returned sat
[2024-06-01 17:01:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:01:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 171 ms returned sat
[2024-06-01 17:01:17] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 435 ms.
[2024-06-01 17:01:18] [INFO ] Added : 10 causal constraints over 2 iterations in 1728 ms. Result :unknown
[2024-06-01 17:01:18] [INFO ] [Real]Absence check using 63 positive place invariants in 19 ms returned sat
[2024-06-01 17:01:18] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 26 ms returned sat
[2024-06-01 17:01:19] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2024-06-01 17:01:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:01:19] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-06-01 17:01:19] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 37 ms returned sat
[2024-06-01 17:01:21] [INFO ] [Nat]Absence check using state equation in 1485 ms returned unknown
[2024-06-01 17:01:21] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:01:21] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 5 ms returned unsat
[2024-06-01 17:01:21] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:01:21] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 18 ms returned unsat
[2024-06-01 17:01:21] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:01:21] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 25 ms returned sat
[2024-06-01 17:01:22] [INFO ] [Real]Absence check using state equation in 483 ms returned unsat
[2024-06-01 17:01:22] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:01:22] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 28 ms returned sat
[2024-06-01 17:01:23] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2024-06-01 17:01:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:01:23] [INFO ] [Nat]Absence check using 63 positive place invariants in 19 ms returned sat
[2024-06-01 17:01:23] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 25 ms returned sat
[2024-06-01 17:01:24] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2024-06-01 17:01:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2024-06-01 17:01:24] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 194 ms.
[2024-06-01 17:01:25] [INFO ] Added : 24 causal constraints over 5 iterations in 941 ms. Result :sat
Minimization took 648 ms.
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 17 ms returned unsat
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 21 ms returned unsat
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 22 ms returned unsat
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive place invariants in 20 ms returned sat
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 25 ms returned unsat
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-06-01 17:01:26] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 22 ms returned sat
[2024-06-01 17:01:27] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2024-06-01 17:01:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:01:27] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2024-06-01 17:01:27] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2024-06-01 17:01:28] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2024-06-01 17:01:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 244 ms returned sat
[2024-06-01 17:01:28] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 257 ms.
[2024-06-01 17:01:29] [INFO ] Added : 20 causal constraints over 4 iterations in 921 ms. Result :sat
Minimization took 883 ms.
[2024-06-01 17:01:30] [INFO ] [Real]Absence check using 63 positive place invariants in 19 ms returned sat
[2024-06-01 17:01:30] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 1, 10, 0, 1, 1, 1, 1, 0, 1] Max Struct:[1, 151, 302, 1, 1, 10, 4, 1, 1, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[151, 302, 4, 1]
Support contains 4 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 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 46 rules applied. Total rules applied 46 place count 654 transition count 1904
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 82 place count 618 transition count 1869
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 152 place count 583 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 582 transition count 1868
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 580 transition count 1866
Applied a total of 158 rules in 365 ms. Remains 580 /664 variables (removed 84) and now considering 1866/1940 (removed 74) transitions.
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:01:31] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-06-01 17:01:31] [INFO ] Computed 82 invariants in 51 ms
[2024-06-01 17:01:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20086 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-06-01 17:02:09] [INFO ] Deduced a trap composed of 87 places in 311 ms of which 8 ms to minimize.
[2024-06-01 17:02:16] [INFO ] Deduced a trap composed of 283 places in 585 ms of which 6 ms to minimize.
[2024-06-01 17:02:17] [INFO ] Deduced a trap composed of 265 places in 483 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 56686ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 56731ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57124 ms. Remains : 580/664 places, 1866/1940 transitions.
[2024-06-01 17:02:27] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:02:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[30, 60, 4, 1]
RANDOM walk for 1000000 steps (72526 resets) in 12362 ms. (80 steps per ms)
FORMULA PolyORBNT-PT-S10J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (26458 resets) in 6245 ms. (480 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1] Max Struct:[30, 60, 4]
[2024-06-01 17:02:46] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:02:46] [INFO ] Invariant cache hit.
[2024-06-01 17:02:46] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:02:46] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 8 ms returned unsat
[2024-06-01 17:02:46] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2024-06-01 17:02:46] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2024-06-01 17:02:47] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2024-06-01 17:02:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:02:47] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:02:47] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 18 ms returned sat
[2024-06-01 17:02:48] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2024-06-01 17:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:02:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 135 ms returned sat
[2024-06-01 17:02:48] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 471 transitions) in 203 ms.
[2024-06-01 17:02:49] [INFO ] Added : 10 causal constraints over 3 iterations in 816 ms. Result :sat
Minimization took 7010 ms.
[2024-06-01 17:02:56] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2024-06-01 17:02:56] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1] Max Struct:[2, 60, 1]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[60]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 68 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 580/580 places, 1866/1866 transitions.
[2024-06-01 17:02:56] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:02:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[60]
RANDOM walk for 1000000 steps (72531 resets) in 10978 ms. (91 steps per ms)
BEST_FIRST walk for 1000001 steps (8903 resets) in 1877 ms. (532 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[60]
[2024-06-01 17:03:09] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:03:09] [INFO ] Invariant cache hit.
[2024-06-01 17:03:09] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2024-06-01 17:03:09] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 20 ms returned sat
[2024-06-01 17:03:09] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2024-06-01 17:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:03:10] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2024-06-01 17:03:10] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 14 ms returned sat
[2024-06-01 17:03:10] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-06-01 17:03:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:03:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
[2024-06-01 17:03:10] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 471 transitions) in 184 ms.
[2024-06-01 17:03:11] [INFO ] Added : 10 causal constraints over 3 iterations in 806 ms. Result :sat
Minimization took 6580 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[60]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 90 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 62 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-06-01 17:03:18] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:03:18] [INFO ] Invariant cache hit.
[2024-06-01 17:03:19] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-06-01 17:03:19] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:03:19] [INFO ] Invariant cache hit.
[2024-06-01 17:03:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:03:27] [INFO ] Implicit Places using invariants and state equation in 8235 ms returned []
Implicit Place search using SMT with State Equation took 9180 ms to find 0 implicit places.
[2024-06-01 17:03:27] [INFO ] Redundant transitions in 151 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:03:27] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:03:27] [INFO ] Invariant cache hit.
[2024-06-01 17:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-06-01 17:04:21] [INFO ] Deduced a trap composed of 18 places in 433 ms of which 7 ms to minimize.
[2024-06-01 17:04:27] [INFO ] Deduced a trap composed of 95 places in 418 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 81685ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 81707ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91121 ms. Remains : 580/580 places, 1866/1866 transitions.
RANDOM walk for 40000 steps (2903 resets) in 1655 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (346 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (353 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 191565 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 191565 steps, saw 32345 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :0
[2024-06-01 17:04:53] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:04:53] [INFO ] Invariant cache hit.
[2024-06-01 17:04:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 1 solved, 1 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 1/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 664 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2054ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 54 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:04:55] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:04:55] [INFO ] Invariant cache hit.
[2024-06-01 17:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-06-01 17:05:34] [INFO ] Deduced a trap composed of 18 places in 394 ms of which 2 ms to minimize.
[2024-06-01 17:05:40] [INFO ] Deduced a trap composed of 95 places in 527 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 56985ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 57024ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57103 ms. Remains : 580/580 places, 1866/1866 transitions.
RANDOM walk for 40000 steps (2947 resets) in 669 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (341 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 239972 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 239972 steps, saw 39821 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-06-01 17:05:55] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:05:55] [INFO ] Invariant cache hit.
[2024-06-01 17:05:55] [INFO ] State equation strengthened by 1 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) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 664 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2010ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 59 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 53 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-06-01 17:05:57] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:05:57] [INFO ] Invariant cache hit.
[2024-06-01 17:05:58] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-06-01 17:05:58] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:05:58] [INFO ] Invariant cache hit.
[2024-06-01 17:05:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:06:06] [INFO ] Implicit Places using invariants and state equation in 8050 ms returned []
Implicit Place search using SMT with State Equation took 8954 ms to find 0 implicit places.
[2024-06-01 17:06:07] [INFO ] Redundant transitions in 159 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:06:07] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:06:07] [INFO ] Invariant cache hit.
[2024-06-01 17:06:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 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
At refinement iteration 3 (OVERLAPS) 10/580 variables, 10/82 constraints. Problems are: Problem set: 135 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/2437 variables, and 82 constraints, problems are : Problem set: 135 solved, 1720 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 135 solved, 1720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 135 solved, 1720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 135 solved, 1720 unsolved
[2024-06-01 17:06:56] [INFO ] Deduced a trap composed of 18 places in 343 ms of which 2 ms to minimize.
[2024-06-01 17:07:11] [INFO ] Deduced a trap composed of 13 places in 327 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 135 solved, 1720 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 135 solved, 1720 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 865/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 77894ms problems are : Problem set: 135 solved, 1720 unsolved
Search for dead transitions found 135 dead transitions in 77919ms
Found 135 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 135 transitions
Dead transitions reduction (with SMT) removed 135 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 1731/1866 transitions.
Applied a total of 0 rules in 39 ms. Remains 580 /580 variables (removed 0) and now considering 1731/1731 (removed 0) transitions.
[2024-06-01 17:07:25] [INFO ] Redundant transitions in 36 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 87184 ms. Remains : 580/580 places, 1731/1866 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[60]
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[60]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[60]
[2024-06-01 17:07:25] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:07:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[60]
RANDOM walk for 10000 steps (743 resets) in 121 ms. (81 steps per ms)
BEST_FIRST walk for 10001 steps (86 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[60]
[2024-06-01 17:07:25] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:07:25] [INFO ] Invariant cache hit.
[2024-06-01 17:07:25] [INFO ] [Real]Absence check using 63 positive place invariants in 21 ms returned sat
[2024-06-01 17:07:25] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2024-06-01 17:07:25] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2024-06-01 17:07:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:07:26] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:07:26] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 19 ms returned sat
[2024-06-01 17:07:26] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2024-06-01 17:07:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:07:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 111 ms returned sat
[2024-06-01 17:07:26] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 471 transitions) in 164 ms.
[2024-06-01 17:07:27] [INFO ] Added : 10 causal constraints over 3 iterations in 783 ms. Result :sat
Minimization took 678 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[60]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 53 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:07:28] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:07:28] [INFO ] Invariant cache hit.
[2024-06-01 17:07:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-06-01 17:08:07] [INFO ] Deduced a trap composed of 18 places in 309 ms of which 2 ms to minimize.
[2024-06-01 17:08:12] [INFO ] Deduced a trap composed of 95 places in 399 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 57560ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 57582ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57640 ms. Remains : 580/580 places, 1866/1866 transitions.
[2024-06-01 17:08:25] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:08:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[60]
RANDOM walk for 1000000 steps (72719 resets) in 10933 ms. (91 steps per ms)
BEST_FIRST walk for 1000000 steps (8941 resets) in 1860 ms. (537 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[60]
[2024-06-01 17:08:38] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:08:38] [INFO ] Invariant cache hit.
[2024-06-01 17:08:38] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2024-06-01 17:08:38] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 19 ms returned sat
[2024-06-01 17:08:39] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-06-01 17:08:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:08:39] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2024-06-01 17:08:39] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2024-06-01 17:08:39] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-06-01 17:08:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:08:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 94 ms returned sat
[2024-06-01 17:08:40] [INFO ] Computed and/alt/rep : 1375/5196/1375 causal constraints (skipped 471 transitions) in 145 ms.
[2024-06-01 17:08:40] [INFO ] Added : 10 causal constraints over 3 iterations in 704 ms. Result :sat
Minimization took 5325 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[60]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 80 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 56 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-06-01 17:08:46] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:08:46] [INFO ] Invariant cache hit.
[2024-06-01 17:08:47] [INFO ] Implicit Places using invariants in 773 ms returned []
[2024-06-01 17:08:47] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:08:47] [INFO ] Invariant cache hit.
[2024-06-01 17:08:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:08:55] [INFO ] Implicit Places using invariants and state equation in 8702 ms returned []
Implicit Place search using SMT with State Equation took 9479 ms to find 0 implicit places.
[2024-06-01 17:08:55] [INFO ] Redundant transitions in 37 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-06-01 17:08:55] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-06-01 17:08:55] [INFO ] Invariant cache hit.
[2024-06-01 17:08:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 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 TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 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 TDEAD1027 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1541 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/580 variables, 10/82 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/2437 variables, and 82 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
[2024-06-01 17:09:44] [INFO ] Deduced a trap composed of 18 places in 342 ms of which 2 ms to minimize.
[2024-06-01 17:09:50] [INFO ] Deduced a trap composed of 283 places in 543 ms of which 4 ms to minimize.
[2024-06-01 17:09:51] [INFO ] Deduced a trap composed of 104 places in 471 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 3/75 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 77395ms problems are : Problem set: 615 solved, 1240 unsolved
Search for dead transitions found 615 dead transitions in 77413ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 1251/1866 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-06-01 17:10:13] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 87059 ms. Remains : 580/580 places, 1251/1866 transitions.
[2024-06-01 17:10:13] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-06-01 17:10:13] [INFO ] Computed 82 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[60]
RANDOM walk for 1000000 steps (72675 resets) in 6041 ms. (165 steps per ms)
BEST_FIRST walk for 1000001 steps (8979 resets) in 1327 ms. (753 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[60]
[2024-06-01 17:10:20] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:10:20] [INFO ] Invariant cache hit.
[2024-06-01 17:10:20] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2024-06-01 17:10:20] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 20 ms returned sat
[2024-06-01 17:10:21] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2024-06-01 17:10:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:10:21] [INFO ] [Real]Added 1 Read/Feed constraints in 15 ms returned sat
[2024-06-01 17:10:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:10:21] [INFO ] [Nat]Absence check using 63 positive place invariants in 33 ms returned sat
[2024-06-01 17:10:21] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 25 ms returned sat
[2024-06-01 17:10:22] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2024-06-01 17:10:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2024-06-01 17:10:22] [INFO ] Deduced a trap composed of 238 places in 348 ms of which 3 ms to minimize.
[2024-06-01 17:10:23] [INFO ] Deduced a trap composed of 233 places in 349 ms of which 3 ms to minimize.
[2024-06-01 17:10:23] [INFO ] Deduced a trap composed of 236 places in 363 ms of which 3 ms to minimize.
[2024-06-01 17:10:23] [INFO ] Deduced a trap composed of 234 places in 327 ms of which 3 ms to minimize.
[2024-06-01 17:10:24] [INFO ] Deduced a trap composed of 244 places in 315 ms of which 3 ms to minimize.
[2024-06-01 17:10:24] [INFO ] Deduced a trap composed of 235 places in 315 ms of which 3 ms to minimize.
[2024-06-01 17:10:24] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 3 ms to minimize.
[2024-06-01 17:10:25] [INFO ] Deduced a trap composed of 234 places in 344 ms of which 4 ms to minimize.
[2024-06-01 17:10:25] [INFO ] Deduced a trap composed of 237 places in 247 ms of which 3 ms to minimize.
[2024-06-01 17:10:25] [INFO ] Deduced a trap composed of 223 places in 321 ms of which 4 ms to minimize.
[2024-06-01 17:10:26] [INFO ] Deduced a trap composed of 222 places in 300 ms of which 3 ms to minimize.
[2024-06-01 17:10:26] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 3 ms to minimize.
[2024-06-01 17:10:26] [INFO ] Deduced a trap composed of 241 places in 283 ms of which 3 ms to minimize.
[2024-06-01 17:10:27] [INFO ] Deduced a trap composed of 232 places in 454 ms of which 4 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 232 places in 402 ms of which 3 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 226 places in 361 ms of which 4 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 228 places in 317 ms of which 3 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 236 places in 347 ms of which 3 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 229 places in 333 ms of which 4 ms to minimize.
[2024-06-01 17:10:30] [INFO ] Deduced a trap composed of 230 places in 368 ms of which 4 ms to minimize.
[2024-06-01 17:10:30] [INFO ] Deduced a trap composed of 234 places in 422 ms of which 4 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 230 places in 390 ms of which 4 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 237 places in 383 ms of which 4 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 243 places in 429 ms of which 4 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 233 places in 359 ms of which 4 ms to minimize.
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 233 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 239 places in 368 ms of which 3 ms to minimize.
[2024-06-01 17:10:34] [INFO ] Deduced a trap composed of 230 places in 334 ms of which 4 ms to minimize.
[2024-06-01 17:10:34] [INFO ] Deduced a trap composed of 244 places in 314 ms of which 4 ms to minimize.
[2024-06-01 17:10:35] [INFO ] Deduced a trap composed of 227 places in 329 ms of which 4 ms to minimize.
[2024-06-01 17:10:35] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:10:35] [INFO ] Deduced a trap composed of 229 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:10:36] [INFO ] Deduced a trap composed of 238 places in 264 ms of which 17 ms to minimize.
[2024-06-01 17:10:36] [INFO ] Deduced a trap composed of 238 places in 325 ms of which 4 ms to minimize.
[2024-06-01 17:10:37] [INFO ] Deduced a trap composed of 241 places in 312 ms of which 4 ms to minimize.
[2024-06-01 17:10:37] [INFO ] Deduced a trap composed of 236 places in 382 ms of which 3 ms to minimize.
[2024-06-01 17:10:37] [INFO ] Deduced a trap composed of 234 places in 319 ms of which 3 ms to minimize.
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 3 ms to minimize.
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 3 ms to minimize.
[2024-06-01 17:10:38] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 3 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 232 places in 362 ms of which 4 ms to minimize.
[2024-06-01 17:10:39] [INFO ] Deduced a trap composed of 228 places in 350 ms of which 4 ms to minimize.
[2024-06-01 17:10:40] [INFO ] Deduced a trap composed of 242 places in 407 ms of which 12 ms to minimize.
[2024-06-01 17:10:40] [INFO ] Deduced a trap composed of 222 places in 389 ms of which 4 ms to minimize.
[2024-06-01 17:10:42] [INFO ] Deduced a trap composed of 226 places in 359 ms of which 4 ms to minimize.
[2024-06-01 17:10:42] [INFO ] Deduced a trap composed of 235 places in 366 ms of which 4 ms to minimize.
[2024-06-01 17:10:42] [INFO ] Deduced a trap composed of 246 places in 340 ms of which 4 ms to minimize.
[2024-06-01 17:10:43] [INFO ] Deduced a trap composed of 226 places in 372 ms of which 4 ms to minimize.
[2024-06-01 17:10:43] [INFO ] Deduced a trap composed of 234 places in 356 ms of which 4 ms to minimize.
[2024-06-01 17:10:44] [INFO ] Deduced a trap composed of 232 places in 349 ms of which 4 ms to minimize.
[2024-06-01 17:10:44] [INFO ] Deduced a trap composed of 234 places in 406 ms of which 4 ms to minimize.
[2024-06-01 17:10:45] [INFO ] Deduced a trap composed of 236 places in 394 ms of which 4 ms to minimize.
[2024-06-01 17:10:45] [INFO ] Deduced a trap composed of 230 places in 392 ms of which 4 ms to minimize.
[2024-06-01 17:10:46] [INFO ] Deduced a trap composed of 234 places in 388 ms of which 4 ms to minimize.
[2024-06-01 17:10:46] [INFO ] Deduced a trap composed of 247 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:10:46] [INFO ] Deduced a trap composed of 236 places in 328 ms of which 4 ms to minimize.
[2024-06-01 17:10:47] [INFO ] Deduced a trap composed of 224 places in 321 ms of which 3 ms to minimize.
[2024-06-01 17:10:47] [INFO ] Deduced a trap composed of 238 places in 358 ms of which 3 ms to minimize.
[2024-06-01 17:10:48] [INFO ] Deduced a trap composed of 247 places in 341 ms of which 3 ms to minimize.
[2024-06-01 17:10:48] [INFO ] Deduced a trap composed of 226 places in 292 ms of which 3 ms to minimize.
[2024-06-01 17:10:49] [INFO ] Deduced a trap composed of 232 places in 297 ms of which 2 ms to minimize.
[2024-06-01 17:10:49] [INFO ] Deduced a trap composed of 230 places in 386 ms of which 4 ms to minimize.
[2024-06-01 17:10:50] [INFO ] Deduced a trap composed of 226 places in 327 ms of which 4 ms to minimize.
[2024-06-01 17:10:50] [INFO ] Deduced a trap composed of 228 places in 415 ms of which 4 ms to minimize.
[2024-06-01 17:10:51] [INFO ] Deduced a trap composed of 238 places in 381 ms of which 4 ms to minimize.
[2024-06-01 17:10:51] [INFO ] Deduced a trap composed of 226 places in 359 ms of which 4 ms to minimize.
[2024-06-01 17:10:52] [INFO ] Deduced a trap composed of 228 places in 335 ms of which 3 ms to minimize.
[2024-06-01 17:10:52] [INFO ] Deduced a trap composed of 226 places in 300 ms of which 3 ms to minimize.
[2024-06-01 17:10:53] [INFO ] Deduced a trap composed of 232 places in 409 ms of which 4 ms to minimize.
[2024-06-01 17:10:53] [INFO ] Deduced a trap composed of 228 places in 370 ms of which 4 ms to minimize.
[2024-06-01 17:10:54] [INFO ] Deduced a trap composed of 230 places in 438 ms of which 4 ms to minimize.
[2024-06-01 17:10:54] [INFO ] Deduced a trap composed of 242 places in 387 ms of which 4 ms to minimize.
[2024-06-01 17:10:55] [INFO ] Deduced a trap composed of 239 places in 366 ms of which 3 ms to minimize.
[2024-06-01 17:10:55] [INFO ] Deduced a trap composed of 228 places in 396 ms of which 4 ms to minimize.
[2024-06-01 17:10:56] [INFO ] Deduced a trap composed of 232 places in 397 ms of which 4 ms to minimize.
[2024-06-01 17:10:57] [INFO ] Deduced a trap composed of 230 places in 380 ms of which 4 ms to minimize.
[2024-06-01 17:10:57] [INFO ] Deduced a trap composed of 242 places in 345 ms of which 3 ms to minimize.
[2024-06-01 17:10:58] [INFO ] Deduced a trap composed of 243 places in 310 ms of which 3 ms to minimize.
[2024-06-01 17:10:58] [INFO ] Deduced a trap composed of 243 places in 394 ms of which 4 ms to minimize.
[2024-06-01 17:10:59] [INFO ] Deduced a trap composed of 235 places in 403 ms of which 4 ms to minimize.
[2024-06-01 17:11:00] [INFO ] Deduced a trap composed of 228 places in 310 ms of which 3 ms to minimize.
[2024-06-01 17:11:04] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 42412 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[60]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[60]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 24 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 24 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-06-01 17:11:04] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:11:04] [INFO ] Invariant cache hit.
[2024-06-01 17:11:05] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-06-01 17:11:05] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:11:05] [INFO ] Invariant cache hit.
[2024-06-01 17:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:11:13] [INFO ] Implicit Places using invariants and state equation in 7565 ms returned []
Implicit Place search using SMT with State Equation took 8397 ms to find 0 implicit places.
[2024-06-01 17:11:13] [INFO ] Redundant transitions in 23 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:11:13] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:11:13] [INFO ] Invariant cache hit.
[2024-06-01 17:11:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:27] [INFO ] Deduced a trap composed of 167 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:11:27] [INFO ] Deduced a trap composed of 166 places in 259 ms of which 4 ms to minimize.
[2024-06-01 17:11:27] [INFO ] Deduced a trap composed of 161 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:11:27] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:11:28] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:11:28] [INFO ] Deduced a trap composed of 240 places in 264 ms of which 3 ms to minimize.
[2024-06-01 17:11:29] [INFO ] Deduced a trap composed of 236 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:11:29] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:11:29] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 2 ms to minimize.
[2024-06-01 17:11:29] [INFO ] Deduced a trap composed of 171 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:11:30] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 4 ms to minimize.
[2024-06-01 17:11:30] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 5 ms to minimize.
[2024-06-01 17:11:30] [INFO ] Deduced a trap composed of 151 places in 242 ms of which 3 ms to minimize.
[2024-06-01 17:11:30] [INFO ] Deduced a trap composed of 146 places in 292 ms of which 5 ms to minimize.
[2024-06-01 17:11:31] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 3 ms to minimize.
[2024-06-01 17:11:31] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:11:31] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 4 ms to minimize.
[2024-06-01 17:11:32] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:11:32] [INFO ] Deduced a trap composed of 226 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:11:32] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:33] [INFO ] Deduced a trap composed of 146 places in 267 ms of which 4 ms to minimize.
[2024-06-01 17:11:34] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 3 ms to minimize.
[2024-06-01 17:11:34] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 4 ms to minimize.
[2024-06-01 17:11:34] [INFO ] Deduced a trap composed of 152 places in 248 ms of which 4 ms to minimize.
[2024-06-01 17:11:34] [INFO ] Deduced a trap composed of 229 places in 245 ms of which 4 ms to minimize.
[2024-06-01 17:11:35] [INFO ] Deduced a trap composed of 146 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:11:35] [INFO ] Deduced a trap composed of 146 places in 183 ms of which 3 ms to minimize.
[2024-06-01 17:11:35] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:11:35] [INFO ] Deduced a trap composed of 142 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:11:35] [INFO ] Deduced a trap composed of 181 places in 187 ms of which 3 ms to minimize.
[2024-06-01 17:11:36] [INFO ] Deduced a trap composed of 157 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:11:36] [INFO ] Deduced a trap composed of 131 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:11:36] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:11:36] [INFO ] Deduced a trap composed of 151 places in 240 ms of which 4 ms to minimize.
[2024-06-01 17:11:37] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 4 ms to minimize.
[2024-06-01 17:11:37] [INFO ] Deduced a trap composed of 161 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:11:37] [INFO ] Deduced a trap composed of 177 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:11:37] [INFO ] Deduced a trap composed of 132 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:11:38] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:11:38] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:50] [INFO ] Deduced a trap composed of 136 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:11:50] [INFO ] Deduced a trap composed of 121 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:11:50] [INFO ] Deduced a trap composed of 121 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:11:50] [INFO ] Deduced a trap composed of 121 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 106 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 131 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 79 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 78 places in 229 ms of which 4 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 121 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 131 places in 231 ms of which 3 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 121 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 126 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 111 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 117 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 116 places in 213 ms of which 2 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 112 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:11:53] [INFO ] Deduced a trap composed of 142 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:11:54] [INFO ] Deduced a trap composed of 131 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:11:54] [INFO ] Deduced a trap composed of 126 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:11:54] [INFO ] Deduced a trap composed of 116 places in 217 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:11:56] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 1 ms to minimize.
[2024-06-01 17:11:57] [INFO ] Deduced a trap composed of 175 places in 299 ms of which 3 ms to minimize.
[2024-06-01 17:11:57] [INFO ] Deduced a trap composed of 151 places in 277 ms of which 3 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 111 places in 271 ms of which 3 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 3 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 161 places in 289 ms of which 3 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 140 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 152 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 121 places in 291 ms of which 3 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 156 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 136 places in 275 ms of which 3 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 160 places in 264 ms of which 2 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 156 places in 267 ms of which 3 ms to minimize.
[2024-06-01 17:12:01] [INFO ] Deduced a trap composed of 160 places in 275 ms of which 3 ms to minimize.
[2024-06-01 17:12:01] [INFO ] Deduced a trap composed of 151 places in 264 ms of which 3 ms to minimize.
[2024-06-01 17:12:01] [INFO ] Deduced a trap composed of 155 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 151 places in 340 ms of which 3 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 146 places in 297 ms of which 3 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 150 places in 267 ms of which 3 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 146 places in 256 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:12:05] [INFO ] Deduced a trap composed of 116 places in 297 ms of which 3 ms to minimize.
[2024-06-01 17:12:05] [INFO ] Deduced a trap composed of 131 places in 335 ms of which 3 ms to minimize.
[2024-06-01 17:12:05] [INFO ] Deduced a trap composed of 156 places in 301 ms of which 3 ms to minimize.
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 116 places in 336 ms of which 3 ms to minimize.
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 121 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 130 places in 338 ms of which 3 ms to minimize.
[2024-06-01 17:12:07] [INFO ] Deduced a trap composed of 116 places in 266 ms of which 2 ms to minimize.
[2024-06-01 17:12:07] [INFO ] Deduced a trap composed of 146 places in 284 ms of which 3 ms to minimize.
[2024-06-01 17:12:07] [INFO ] Deduced a trap composed of 130 places in 287 ms of which 3 ms to minimize.
[2024-06-01 17:12:07] [INFO ] Deduced a trap composed of 126 places in 288 ms of which 3 ms to minimize.
[2024-06-01 17:12:08] [INFO ] Deduced a trap composed of 120 places in 282 ms of which 2 ms to minimize.
[2024-06-01 17:12:08] [INFO ] Deduced a trap composed of 131 places in 261 ms of which 2 ms to minimize.
[2024-06-01 17:12:08] [INFO ] Deduced a trap composed of 132 places in 277 ms of which 3 ms to minimize.
[2024-06-01 17:12:09] [INFO ] Deduced a trap composed of 106 places in 264 ms of which 3 ms to minimize.
[2024-06-01 17:12:09] [INFO ] Deduced a trap composed of 111 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:12:09] [INFO ] Deduced a trap composed of 161 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:12:10] [INFO ] Deduced a trap composed of 132 places in 281 ms of which 3 ms to minimize.
[2024-06-01 17:12:10] [INFO ] Deduced a trap composed of 135 places in 272 ms of which 15 ms to minimize.
[2024-06-01 17:12:10] [INFO ] Deduced a trap composed of 121 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:12:10] [INFO ] Deduced a trap composed of 131 places in 274 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:12:14] [INFO ] Deduced a trap composed of 222 places in 198 ms of which 2 ms to minimize.
[2024-06-01 17:12:14] [INFO ] Deduced a trap composed of 236 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:12:14] [INFO ] Deduced a trap composed of 182 places in 195 ms of which 2 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 161 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 171 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 228 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 171 places in 242 ms of which 4 ms to minimize.
[2024-06-01 17:12:16] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 3 ms to minimize.
[2024-06-01 17:12:16] [INFO ] Deduced a trap composed of 176 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:12:16] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:12:16] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 3 ms to minimize.
[2024-06-01 17:12:16] [INFO ] Deduced a trap composed of 171 places in 184 ms of which 2 ms to minimize.
[2024-06-01 17:12:17] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 2 ms to minimize.
[2024-06-01 17:12:17] [INFO ] Deduced a trap composed of 171 places in 259 ms of which 5 ms to minimize.
[2024-06-01 17:12:17] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 3 ms to minimize.
[2024-06-01 17:12:17] [INFO ] Deduced a trap composed of 166 places in 165 ms of which 2 ms to minimize.
[2024-06-01 17:12:18] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 3 ms to minimize.
[2024-06-01 17:12:18] [INFO ] Deduced a trap composed of 239 places in 398 ms of which 3 ms to minimize.
SMT process timed out in 65280ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 65295ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73751 ms. Remains : 580/580 places, 1251/1251 transitions.
RANDOM walk for 40000 steps (2919 resets) in 464 ms. (86 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (351 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (364 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 281987 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 2
Probabilistic random walk after 281987 steps, saw 46264 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-06-01 17:12:21] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:12:21] [INFO ] Invariant cache hit.
[2024-06-01 17:12:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:12:22] [INFO ] Deduced a trap composed of 264 places in 296 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/579 variables, 1/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1242/1821 variables, 579/662 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1821 variables, 1/663 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1821 variables, 0/663 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1822 variables, 1/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1822 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1822 variables, 0/664 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1822/1822 variables, and 664 constraints, problems are : Problem set: 1 solved, 1 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:12:23] [INFO ] Deduced a trap composed of 238 places in 334 ms of which 4 ms to minimize.
[2024-06-01 17:12:23] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 3 ms to minimize.
[2024-06-01 17:12:23] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 2 ms to minimize.
[2024-06-01 17:12:24] [INFO ] Deduced a trap composed of 232 places in 395 ms of which 5 ms to minimize.
[2024-06-01 17:12:24] [INFO ] Deduced a trap composed of 238 places in 287 ms of which 3 ms to minimize.
[2024-06-01 17:12:24] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:12:25] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 4 ms to minimize.
[2024-06-01 17:12:25] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 3 ms to minimize.
[2024-06-01 17:12:25] [INFO ] Deduced a trap composed of 240 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:12:25] [INFO ] Deduced a trap composed of 224 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:12:26] [INFO ] Deduced a trap composed of 238 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:12:26] [INFO ] Deduced a trap composed of 221 places in 238 ms of which 3 ms to minimize.
[2024-06-01 17:12:26] [INFO ] Deduced a trap composed of 229 places in 266 ms of which 2 ms to minimize.
[2024-06-01 17:12:26] [INFO ] Deduced a trap composed of 231 places in 229 ms of which 2 ms to minimize.
[2024-06-01 17:12:27] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:12:27] [INFO ] Deduced a trap composed of 224 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:12:27] [INFO ] Deduced a trap composed of 233 places in 245 ms of which 3 ms to minimize.
[2024-06-01 17:12:27] [INFO ] Deduced a trap composed of 239 places in 226 ms of which 4 ms to minimize.
SMT process timed out in 6029ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 25 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:12:27] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:12:27] [INFO ] Invariant cache hit.
[2024-06-01 17:12:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:12:43] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 3 ms to minimize.
[2024-06-01 17:12:44] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:12:44] [INFO ] Deduced a trap composed of 161 places in 207 ms of which 2 ms to minimize.
[2024-06-01 17:12:44] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 2 ms to minimize.
[2024-06-01 17:12:44] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:12:45] [INFO ] Deduced a trap composed of 240 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:12:45] [INFO ] Deduced a trap composed of 236 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:12:45] [INFO ] Deduced a trap composed of 228 places in 186 ms of which 3 ms to minimize.
[2024-06-01 17:12:45] [INFO ] Deduced a trap composed of 234 places in 186 ms of which 3 ms to minimize.
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 171 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 224 places in 197 ms of which 2 ms to minimize.
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 224 places in 197 ms of which 2 ms to minimize.
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 151 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 236 places in 193 ms of which 2 ms to minimize.
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 228 places in 210 ms of which 2 ms to minimize.
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 226 places in 204 ms of which 4 ms to minimize.
[2024-06-01 17:12:48] [INFO ] Deduced a trap composed of 230 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:12:48] [INFO ] Deduced a trap composed of 226 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:12:48] [INFO ] Deduced a trap composed of 232 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:12:49] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 3 ms to minimize.
[2024-06-01 17:12:49] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 2 ms to minimize.
[2024-06-01 17:12:49] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 16 ms to minimize.
[2024-06-01 17:12:50] [INFO ] Deduced a trap composed of 152 places in 192 ms of which 5 ms to minimize.
[2024-06-01 17:12:50] [INFO ] Deduced a trap composed of 229 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:12:50] [INFO ] Deduced a trap composed of 146 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:12:50] [INFO ] Deduced a trap composed of 146 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:12:50] [INFO ] Deduced a trap composed of 141 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 142 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 181 places in 193 ms of which 3 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 157 places in 198 ms of which 2 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 131 places in 204 ms of which 2 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 2 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 3 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 2 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 3 ms to minimize.
[2024-06-01 17:12:53] [INFO ] Deduced a trap composed of 132 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:12:53] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:12:53] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:12:56] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 2 ms to minimize.
[2024-06-01 17:12:56] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:12:57] [INFO ] Deduced a trap composed of 121 places in 274 ms of which 3 ms to minimize.
[2024-06-01 17:12:57] [INFO ] Deduced a trap composed of 121 places in 232 ms of which 3 ms to minimize.
[2024-06-01 17:12:57] [INFO ] Deduced a trap composed of 106 places in 204 ms of which 2 ms to minimize.
[2024-06-01 17:12:57] [INFO ] Deduced a trap composed of 131 places in 200 ms of which 2 ms to minimize.
[2024-06-01 17:12:58] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:12:58] [INFO ] Deduced a trap composed of 78 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:12:58] [INFO ] Deduced a trap composed of 121 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:12:58] [INFO ] Deduced a trap composed of 131 places in 267 ms of which 3 ms to minimize.
[2024-06-01 17:12:59] [INFO ] Deduced a trap composed of 121 places in 210 ms of which 3 ms to minimize.
[2024-06-01 17:12:59] [INFO ] Deduced a trap composed of 126 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:12:59] [INFO ] Deduced a trap composed of 111 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:12:59] [INFO ] Deduced a trap composed of 117 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:12:59] [INFO ] Deduced a trap composed of 116 places in 185 ms of which 3 ms to minimize.
[2024-06-01 17:13:00] [INFO ] Deduced a trap composed of 112 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:13:00] [INFO ] Deduced a trap composed of 142 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:13:00] [INFO ] Deduced a trap composed of 131 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:13:00] [INFO ] Deduced a trap composed of 126 places in 211 ms of which 2 ms to minimize.
[2024-06-01 17:13:00] [INFO ] Deduced a trap composed of 116 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:13:03] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 2 ms to minimize.
[2024-06-01 17:13:04] [INFO ] Deduced a trap composed of 175 places in 410 ms of which 3 ms to minimize.
[2024-06-01 17:13:04] [INFO ] Deduced a trap composed of 151 places in 314 ms of which 4 ms to minimize.
[2024-06-01 17:13:04] [INFO ] Deduced a trap composed of 111 places in 302 ms of which 3 ms to minimize.
[2024-06-01 17:13:04] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 2 ms to minimize.
[2024-06-01 17:13:05] [INFO ] Deduced a trap composed of 161 places in 274 ms of which 3 ms to minimize.
[2024-06-01 17:13:05] [INFO ] Deduced a trap composed of 140 places in 276 ms of which 3 ms to minimize.
[2024-06-01 17:13:05] [INFO ] Deduced a trap composed of 152 places in 269 ms of which 3 ms to minimize.
[2024-06-01 17:13:06] [INFO ] Deduced a trap composed of 121 places in 298 ms of which 3 ms to minimize.
[2024-06-01 17:13:06] [INFO ] Deduced a trap composed of 156 places in 311 ms of which 3 ms to minimize.
[2024-06-01 17:13:06] [INFO ] Deduced a trap composed of 136 places in 294 ms of which 3 ms to minimize.
[2024-06-01 17:13:07] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 3 ms to minimize.
[2024-06-01 17:13:07] [INFO ] Deduced a trap composed of 156 places in 274 ms of which 3 ms to minimize.
[2024-06-01 17:13:07] [INFO ] Deduced a trap composed of 160 places in 275 ms of which 3 ms to minimize.
[2024-06-01 17:13:07] [INFO ] Deduced a trap composed of 151 places in 291 ms of which 3 ms to minimize.
[2024-06-01 17:13:08] [INFO ] Deduced a trap composed of 155 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:13:08] [INFO ] Deduced a trap composed of 151 places in 260 ms of which 2 ms to minimize.
[2024-06-01 17:13:08] [INFO ] Deduced a trap composed of 146 places in 258 ms of which 2 ms to minimize.
[2024-06-01 17:13:09] [INFO ] Deduced a trap composed of 150 places in 273 ms of which 3 ms to minimize.
[2024-06-01 17:13:09] [INFO ] Deduced a trap composed of 146 places in 257 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:13:11] [INFO ] Deduced a trap composed of 116 places in 393 ms of which 3 ms to minimize.
[2024-06-01 17:13:12] [INFO ] Deduced a trap composed of 131 places in 350 ms of which 3 ms to minimize.
[2024-06-01 17:13:12] [INFO ] Deduced a trap composed of 156 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:13:12] [INFO ] Deduced a trap composed of 116 places in 285 ms of which 3 ms to minimize.
[2024-06-01 17:13:13] [INFO ] Deduced a trap composed of 121 places in 289 ms of which 3 ms to minimize.
[2024-06-01 17:13:13] [INFO ] Deduced a trap composed of 130 places in 291 ms of which 4 ms to minimize.
[2024-06-01 17:13:13] [INFO ] Deduced a trap composed of 116 places in 321 ms of which 4 ms to minimize.
[2024-06-01 17:13:14] [INFO ] Deduced a trap composed of 146 places in 346 ms of which 3 ms to minimize.
[2024-06-01 17:13:14] [INFO ] Deduced a trap composed of 130 places in 273 ms of which 3 ms to minimize.
[2024-06-01 17:13:14] [INFO ] Deduced a trap composed of 126 places in 274 ms of which 4 ms to minimize.
SMT process timed out in 46829ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 46841ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46870 ms. Remains : 580/580 places, 1251/1251 transitions.
RANDOM walk for 40000 steps (2887 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (309 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 339776 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 339776 steps, saw 55193 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2024-06-01 17:13:17] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:13:17] [INFO ] Invariant cache hit.
[2024-06-01 17:13:17] [INFO ] State equation strengthened by 1 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) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1242/1821 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1821 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1821 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1822 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1822 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1822 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1822/1822 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:18] [INFO ] Deduced a trap composed of 238 places in 306 ms of which 3 ms to minimize.
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 3 ms to minimize.
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 222 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:13:20] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:13:20] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 3 ms to minimize.
[2024-06-01 17:13:20] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:13:20] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 3 ms to minimize.
[2024-06-01 17:13:21] [INFO ] Deduced a trap composed of 224 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:13:21] [INFO ] Deduced a trap composed of 238 places in 237 ms of which 4 ms to minimize.
[2024-06-01 17:13:21] [INFO ] Deduced a trap composed of 240 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:13:21] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 3 ms to minimize.
[2024-06-01 17:13:22] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 3 ms to minimize.
[2024-06-01 17:13:22] [INFO ] Deduced a trap composed of 238 places in 240 ms of which 3 ms to minimize.
[2024-06-01 17:13:22] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 3 ms to minimize.
[2024-06-01 17:13:22] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:13:23] [INFO ] Deduced a trap composed of 226 places in 223 ms of which 3 ms to minimize.
[2024-06-01 17:13:23] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:13:23] [INFO ] Deduced a trap composed of 228 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:13:23] [INFO ] Deduced a trap composed of 228 places in 232 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:24] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 2 ms to minimize.
[2024-06-01 17:13:24] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 4 ms to minimize.
[2024-06-01 17:13:24] [INFO ] Deduced a trap composed of 230 places in 301 ms of which 3 ms to minimize.
[2024-06-01 17:13:24] [INFO ] Deduced a trap composed of 238 places in 231 ms of which 3 ms to minimize.
[2024-06-01 17:13:25] [INFO ] Deduced a trap composed of 240 places in 309 ms of which 4 ms to minimize.
[2024-06-01 17:13:25] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:13:25] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:13:25] [INFO ] Deduced a trap composed of 228 places in 227 ms of which 3 ms to minimize.
[2024-06-01 17:13:26] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 3 ms to minimize.
[2024-06-01 17:13:26] [INFO ] Deduced a trap composed of 224 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:13:26] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 2 ms to minimize.
[2024-06-01 17:13:26] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:13:27] [INFO ] Deduced a trap composed of 238 places in 240 ms of which 3 ms to minimize.
[2024-06-01 17:13:27] [INFO ] Deduced a trap composed of 220 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:13:27] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 2 ms to minimize.
[2024-06-01 17:13:27] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:13:28] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:13:28] [INFO ] Deduced a trap composed of 232 places in 231 ms of which 3 ms to minimize.
[2024-06-01 17:13:28] [INFO ] Deduced a trap composed of 228 places in 310 ms of which 5 ms to minimize.
[2024-06-01 17:13:29] [INFO ] Deduced a trap composed of 234 places in 301 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:29] [INFO ] Deduced a trap composed of 232 places in 303 ms of which 4 ms to minimize.
[2024-06-01 17:13:29] [INFO ] Deduced a trap composed of 234 places in 292 ms of which 3 ms to minimize.
[2024-06-01 17:13:29] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:13:30] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 3 ms to minimize.
[2024-06-01 17:13:30] [INFO ] Deduced a trap composed of 230 places in 314 ms of which 4 ms to minimize.
[2024-06-01 17:13:30] [INFO ] Deduced a trap composed of 226 places in 304 ms of which 4 ms to minimize.
[2024-06-01 17:13:31] [INFO ] Deduced a trap composed of 238 places in 289 ms of which 4 ms to minimize.
[2024-06-01 17:13:32] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 3 ms to minimize.
[2024-06-01 17:13:32] [INFO ] Deduced a trap composed of 236 places in 303 ms of which 4 ms to minimize.
[2024-06-01 17:13:33] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 3 ms to minimize.
[2024-06-01 17:13:33] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 3 ms to minimize.
[2024-06-01 17:13:33] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 4 ms to minimize.
[2024-06-01 17:13:34] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 3 ms to minimize.
[2024-06-01 17:13:34] [INFO ] Deduced a trap composed of 236 places in 286 ms of which 4 ms to minimize.
[2024-06-01 17:13:34] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 2 ms to minimize.
[2024-06-01 17:13:35] [INFO ] Deduced a trap composed of 244 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:13:35] [INFO ] Deduced a trap composed of 236 places in 230 ms of which 3 ms to minimize.
[2024-06-01 17:13:35] [INFO ] Deduced a trap composed of 230 places in 232 ms of which 2 ms to minimize.
[2024-06-01 17:13:35] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:13:36] [INFO ] Deduced a trap composed of 226 places in 316 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:36] [INFO ] Deduced a trap composed of 242 places in 296 ms of which 3 ms to minimize.
[2024-06-01 17:13:36] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 4 ms to minimize.
[2024-06-01 17:13:37] [INFO ] Deduced a trap composed of 238 places in 335 ms of which 4 ms to minimize.
[2024-06-01 17:13:37] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 4 ms to minimize.
[2024-06-01 17:13:37] [INFO ] Deduced a trap composed of 226 places in 311 ms of which 4 ms to minimize.
[2024-06-01 17:13:38] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:13:38] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:13:38] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:13:39] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:13:39] [INFO ] Deduced a trap composed of 238 places in 275 ms of which 3 ms to minimize.
[2024-06-01 17:13:39] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 3 ms to minimize.
[2024-06-01 17:13:40] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 3 ms to minimize.
[2024-06-01 17:13:40] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:13:40] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 2 ms to minimize.
[2024-06-01 17:13:40] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:13:41] [INFO ] Deduced a trap composed of 234 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:13:41] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 3 ms to minimize.
[2024-06-01 17:13:41] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 2 ms to minimize.
[2024-06-01 17:13:41] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:13:42] [INFO ] Deduced a trap composed of 228 places in 231 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:42] [INFO ] Deduced a trap composed of 242 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:13:42] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 2 ms to minimize.
[2024-06-01 17:13:42] [INFO ] Deduced a trap composed of 234 places in 230 ms of which 3 ms to minimize.
[2024-06-01 17:13:43] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 2 ms to minimize.
[2024-06-01 17:13:43] [INFO ] Deduced a trap composed of 230 places in 232 ms of which 3 ms to minimize.
[2024-06-01 17:13:43] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 2 ms to minimize.
[2024-06-01 17:13:43] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 3 ms to minimize.
[2024-06-01 17:13:44] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 2 ms to minimize.
[2024-06-01 17:13:44] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 3 ms to minimize.
[2024-06-01 17:13:44] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:13:44] [INFO ] Deduced a trap composed of 228 places in 233 ms of which 2 ms to minimize.
[2024-06-01 17:13:45] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 2 ms to minimize.
[2024-06-01 17:13:45] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 3 ms to minimize.
[2024-06-01 17:13:45] [INFO ] Deduced a trap composed of 226 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:13:46] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 3 ms to minimize.
[2024-06-01 17:13:46] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:13:46] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 2 ms to minimize.
[2024-06-01 17:13:48] [INFO ] Deduced a trap composed of 234 places in 305 ms of which 3 ms to minimize.
[2024-06-01 17:13:48] [INFO ] Deduced a trap composed of 239 places in 269 ms of which 3 ms to minimize.
[2024-06-01 17:13:49] [INFO ] Deduced a trap composed of 242 places in 281 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:50] [INFO ] Deduced a trap composed of 236 places in 330 ms of which 3 ms to minimize.
[2024-06-01 17:13:50] [INFO ] Deduced a trap composed of 236 places in 277 ms of which 3 ms to minimize.
[2024-06-01 17:13:51] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 3 ms to minimize.
[2024-06-01 17:13:51] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 3 ms to minimize.
[2024-06-01 17:13:51] [INFO ] Deduced a trap composed of 232 places in 240 ms of which 3 ms to minimize.
[2024-06-01 17:13:52] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 2 ms to minimize.
[2024-06-01 17:13:52] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 2 ms to minimize.
[2024-06-01 17:13:52] [INFO ] Deduced a trap composed of 226 places in 251 ms of which 2 ms to minimize.
[2024-06-01 17:13:53] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 3 ms to minimize.
[2024-06-01 17:13:53] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:13:53] [INFO ] Deduced a trap composed of 220 places in 233 ms of which 2 ms to minimize.
[2024-06-01 17:13:53] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 3 ms to minimize.
[2024-06-01 17:13:54] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:13:54] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 3 ms to minimize.
[2024-06-01 17:13:54] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 3 ms to minimize.
[2024-06-01 17:13:54] [INFO ] Deduced a trap composed of 240 places in 252 ms of which 3 ms to minimize.
[2024-06-01 17:13:55] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 2 ms to minimize.
[2024-06-01 17:13:55] [INFO ] Deduced a trap composed of 238 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:13:55] [INFO ] Deduced a trap composed of 238 places in 233 ms of which 3 ms to minimize.
[2024-06-01 17:13:55] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:13:56] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 2 ms to minimize.
[2024-06-01 17:13:56] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:13:56] [INFO ] Deduced a trap composed of 238 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:13:57] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:13:57] [INFO ] Deduced a trap composed of 234 places in 283 ms of which 3 ms to minimize.
[2024-06-01 17:13:58] [INFO ] Deduced a trap composed of 228 places in 298 ms of which 3 ms to minimize.
[2024-06-01 17:13:58] [INFO ] Deduced a trap composed of 222 places in 289 ms of which 4 ms to minimize.
[2024-06-01 17:13:59] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 3 ms to minimize.
[2024-06-01 17:13:59] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 2 ms to minimize.
[2024-06-01 17:14:00] [INFO ] Deduced a trap composed of 236 places in 301 ms of which 3 ms to minimize.
[2024-06-01 17:14:00] [INFO ] Deduced a trap composed of 236 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:14:00] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 2 ms to minimize.
[2024-06-01 17:14:00] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 2 ms to minimize.
[2024-06-01 17:14:01] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 3 ms to minimize.
[2024-06-01 17:14:01] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 3 ms to minimize.
[2024-06-01 17:14:01] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 3 ms to minimize.
[2024-06-01 17:14:01] [INFO ] Deduced a trap composed of 252 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:14:02] [INFO ] Deduced a trap composed of 232 places in 241 ms of which 3 ms to minimize.
[2024-06-01 17:14:02] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 2 ms to minimize.
[2024-06-01 17:14:02] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:14:02] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:14:03] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 3 ms to minimize.
[2024-06-01 17:14:03] [INFO ] Deduced a trap composed of 224 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:14:03] [INFO ] Deduced a trap composed of 232 places in 227 ms of which 3 ms to minimize.
SMT process timed out in 45786ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 25 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 24 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-06-01 17:14:03] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:14:03] [INFO ] Invariant cache hit.
[2024-06-01 17:14:04] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-06-01 17:14:04] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:14:04] [INFO ] Invariant cache hit.
[2024-06-01 17:14:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:14:11] [INFO ] Implicit Places using invariants and state equation in 6891 ms returned []
Implicit Place search using SMT with State Equation took 7506 ms to find 0 implicit places.
[2024-06-01 17:14:11] [INFO ] Redundant transitions in 25 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-06-01 17:14:11] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-06-01 17:14:11] [INFO ] Invariant cache hit.
[2024-06-01 17:14:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:14:25] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 3 ms to minimize.
[2024-06-01 17:14:25] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 3 ms to minimize.
[2024-06-01 17:14:25] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:14:26] [INFO ] Deduced a trap composed of 156 places in 248 ms of which 3 ms to minimize.
[2024-06-01 17:14:26] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 3 ms to minimize.
[2024-06-01 17:14:26] [INFO ] Deduced a trap composed of 240 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:14:27] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 3 ms to minimize.
[2024-06-01 17:14:27] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 3 ms to minimize.
[2024-06-01 17:14:27] [INFO ] Deduced a trap composed of 234 places in 195 ms of which 3 ms to minimize.
[2024-06-01 17:14:27] [INFO ] Deduced a trap composed of 171 places in 253 ms of which 3 ms to minimize.
[2024-06-01 17:14:28] [INFO ] Deduced a trap composed of 224 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:14:28] [INFO ] Deduced a trap composed of 224 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:14:28] [INFO ] Deduced a trap composed of 151 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:14:28] [INFO ] Deduced a trap composed of 146 places in 218 ms of which 3 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Deduced a trap composed of 226 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 4 ms to minimize.
[2024-06-01 17:14:30] [INFO ] Deduced a trap composed of 226 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:14:30] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 146 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 152 places in 211 ms of which 3 ms to minimize.
[2024-06-01 17:14:32] [INFO ] Deduced a trap composed of 229 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:14:32] [INFO ] Deduced a trap composed of 146 places in 220 ms of which 3 ms to minimize.
[2024-06-01 17:14:32] [INFO ] Deduced a trap composed of 146 places in 206 ms of which 3 ms to minimize.
[2024-06-01 17:14:32] [INFO ] Deduced a trap composed of 141 places in 280 ms of which 3 ms to minimize.
[2024-06-01 17:14:33] [INFO ] Deduced a trap composed of 142 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:14:33] [INFO ] Deduced a trap composed of 181 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:14:33] [INFO ] Deduced a trap composed of 157 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:14:33] [INFO ] Deduced a trap composed of 131 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 171 places in 205 ms of which 3 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 151 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 3 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 161 places in 266 ms of which 3 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 177 places in 197 ms of which 3 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 132 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 3.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 9.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 7.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s396 1.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 136 places in 247 ms of which 3 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 3 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 121 places in 249 ms of which 3 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 121 places in 235 ms of which 3 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 106 places in 247 ms of which 3 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 131 places in 255 ms of which 6 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 79 places in 224 ms of which 3 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 78 places in 222 ms of which 3 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 121 places in 242 ms of which 3 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 131 places in 256 ms of which 3 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 121 places in 239 ms of which 4 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 126 places in 236 ms of which 3 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 111 places in 235 ms of which 4 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 117 places in 230 ms of which 3 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 116 places in 217 ms of which 3 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 112 places in 213 ms of which 3 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 142 places in 245 ms of which 3 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 3 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 126 places in 286 ms of which 3 ms to minimize.
[2024-06-01 17:14:53] [INFO ] Deduced a trap composed of 116 places in 213 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 2 ms to minimize.
[2024-06-01 17:14:55] [INFO ] Deduced a trap composed of 175 places in 303 ms of which 3 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 151 places in 297 ms of which 3 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 111 places in 321 ms of which 3 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 166 places in 291 ms of which 3 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 161 places in 315 ms of which 3 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 140 places in 309 ms of which 3 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 152 places in 269 ms of which 3 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 121 places in 285 ms of which 3 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 156 places in 299 ms of which 3 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 136 places in 344 ms of which 3 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 160 places in 292 ms of which 3 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 156 places in 279 ms of which 3 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 160 places in 305 ms of which 3 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 151 places in 315 ms of which 4 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 155 places in 348 ms of which 3 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 151 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 146 places in 338 ms of which 3 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 150 places in 300 ms of which 3 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 146 places in 313 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 116 places in 330 ms of which 3 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 131 places in 304 ms of which 3 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 156 places in 289 ms of which 3 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 116 places in 315 ms of which 3 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 121 places in 294 ms of which 3 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 130 places in 309 ms of which 3 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 116 places in 280 ms of which 3 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 146 places in 306 ms of which 3 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 130 places in 311 ms of which 3 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 126 places in 316 ms of which 3 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 120 places in 302 ms of which 3 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 131 places in 301 ms of which 3 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 132 places in 277 ms of which 3 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 106 places in 269 ms of which 3 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 111 places in 288 ms of which 3 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 161 places in 268 ms of which 3 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 132 places in 288 ms of which 4 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 135 places in 290 ms of which 3 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 121 places in 285 ms of which 3 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 131 places in 301 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 17:15:12] [INFO ] Deduced a trap composed of 222 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 236 places in 198 ms of which 3 ms to minimize.
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 182 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 171 places in 234 ms of which 3 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 228 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 171 places in 227 ms of which 3 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 3 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 176 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 171 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 3 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 161 places in 232 ms of which 3 ms to minimize.
SMT process timed out in 64968ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 64985ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72558 ms. Remains : 580/580 places, 1251/1251 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[60]
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-02 in 471199 ms.
[2024-06-01 17:15:16] [INFO ] Flatten gal took : 479 ms
[2024-06-01 17:15:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 16 ms.
[2024-06-01 17:15:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 580 places, 1866 transitions and 12884 arcs took 26 ms.
Total runtime 845019 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-PT-S10J30-UpperBounds-02

BK_STOP 1717262117310

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name PolyORBNT-PT-S10J30-UpperBounds-02
ub formula formula --maxsum=/tmp/2546/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;