MCC'2024- Execution of r516-tajo-171654447200469

About the Execution of LTSMin+red for PolyORBNT-PT-S05J60

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4428.884	758119.00	901159.00	190.40	1 1 1 61 4 1 ? 4 1 1 1 1 1 1 1 10	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447200469.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-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K 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 1.5M 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717260481846

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-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:48:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 16:48:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:48:03] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-06-01 16:48:03] [INFO ] Transformed 909 places.
[2024-06-01 16:48:03] [INFO ] Transformed 1970 transitions.
[2024-06-01 16:48:03] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 10] Max Struct:[+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, 1, 61, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 16:48:03] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-06-01 16:48:03] [INFO ] Computed 142 invariants in 115 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 10] Max Struct:[245, 87, 262, 61, 1399, 245, 262, 305, 245, 364, 1, 25, 65, 245, 10]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (687 resets) in 239 ms. (41 steps per ms)
BEST_FIRST walk for 130013 steps (1804 resets) in 504 ms. (257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 4, 1, 3, 4, 1, 1, 0, 1, 1, 1] Max Struct:[245, 87, 262, 1399, 245, 262, 305, 245, 364, 1, 25, 65, 245]
[2024-06-01 16:48:04] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:48:04] [INFO ] Invariant cache hit.
[2024-06-01 16:48:04] [INFO ] [Real]Absence check using 111 positive place invariants in 32 ms returned sat
[2024-06-01 16:48:04] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 38 ms returned unsat
[2024-06-01 16:48:04] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-06-01 16:48:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 38 ms returned unsat
[2024-06-01 16:48:05] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-06-01 16:48:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 41 ms returned unsat
[2024-06-01 16:48:05] [INFO ] [Real]Absence check using 111 positive place invariants in 20 ms returned sat
[2024-06-01 16:48:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 55 ms returned unsat
[2024-06-01 16:48:05] [INFO ] [Real]Absence check using 111 positive place invariants in 19 ms returned sat
[2024-06-01 16:48:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned unsat
[2024-06-01 16:48:05] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-06-01 16:48:05] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 40 ms returned sat
[2024-06-01 16:48:06] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2024-06-01 16:48:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:48:06] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-06-01 16:48:06] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 30 ms returned sat
[2024-06-01 16:48:07] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2024-06-01 16:48:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:48:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 288 ms returned sat
[2024-06-01 16:48:08] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 117 ms.
[2024-06-01 16:48:08] [INFO ] Added : 16 causal constraints over 4 iterations in 744 ms. Result :sat
Minimization took 874 ms.
[2024-06-01 16:48:09] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-06-01 16:48:09] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2024-06-01 16:48:10] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2024-06-01 16:48:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:48:10] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-06-01 16:48:10] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 38 ms returned sat
[2024-06-01 16:48:12] [INFO ] [Nat]Absence check using state equation in 1630 ms returned unsat
[2024-06-01 16:48:12] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-06-01 16:48:12] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 44 ms returned unsat
[2024-06-01 16:48:12] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-06-01 16:48:12] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 42 ms returned unsat
[2024-06-01 16:48:13] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-06-01 16:48:13] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned sat
[2024-06-01 16:48:13] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2024-06-01 16:48:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:48:14] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-06-01 16:48:14] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 40 ms returned sat
[2024-06-01 16:48:14] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2024-06-01 16:48:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 144 ms returned sat
[2024-06-01 16:48:15] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 131 ms.
[2024-06-01 16:48:16] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 27 ms to minimize.
[2024-06-01 16:48:17] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 828 ms
Maximisation of solution failed !
Minimization took 2 ms.
[2024-06-01 16:48:19] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-06-01 16:48:19] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 19 ms returned unsat
[2024-06-01 16:48:19] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-06-01 16:48:19] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 37 ms returned unsat
[2024-06-01 16:48:19] [INFO ] [Real]Absence check using 111 positive place invariants in 37 ms returned sat
[2024-06-01 16:48:19] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 45 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 4, 1, 3, 4, 1, 1, 0, 1, 1, 1] Max Struct:[1, 1, 1, 4, 1, 262, 4, 1, 1, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0] Max Struct:[262, 1]
Support contains 2 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 3 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 305 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2024-06-01 16:48:19] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-06-01 16:48:19] [INFO ] Computed 137 invariants in 77 ms
[2024-06-01 16:48:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 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 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-06-01 16:48:45] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 4 ms to minimize.
[2024-06-01 16:48:56] [INFO ] Deduced a trap composed of 13 places in 444 ms of which 7 ms to minimize.
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 195 places in 389 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 135 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 3/3 constraints]
After SMT, in 43273ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 43302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43636 ms. Remains : 770/909 places, 1181/1315 transitions.
[2024-06-01 16:49:03] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:49:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0] Max Struct:[136, 1]
RANDOM walk for 1000000 steps (52217 resets) in 7483 ms. (133 steps per ms)
FORMULA PolyORBNT-PT-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (3484 resets) in 1407 ms. (710 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-06-01 16:49:12] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:49:12] [INFO ] Invariant cache hit.
[2024-06-01 16:49:12] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-06-01 16:49:12] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 34 ms returned sat
[2024-06-01 16:49:12] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2024-06-01 16:49:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:49:13] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-06-01 16:49:13] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 32 ms returned sat
[2024-06-01 16:49:13] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2024-06-01 16:49:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:49:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 202 ms returned sat
[2024-06-01 16:49:14] [INFO ] Deduced a trap composed of 214 places in 408 ms of which 5 ms to minimize.
[2024-06-01 16:49:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2024-06-01 16:49:14] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 131 ms.
[2024-06-01 16:49:14] [INFO ] Added : 9 causal constraints over 2 iterations in 493 ms. Result :sat
Minimization took 3263 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 70 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 770/770 places, 1181/1181 transitions.
[2024-06-01 16:49:18] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:49:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (52048 resets) in 7174 ms. (139 steps per ms)
BEST_FIRST walk for 1000001 steps (3424 resets) in 1512 ms. (660 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-06-01 16:49:27] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:49:27] [INFO ] Invariant cache hit.
[2024-06-01 16:49:27] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-06-01 16:49:27] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 33 ms returned sat
[2024-06-01 16:49:28] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2024-06-01 16:49:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:49:28] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-06-01 16:49:28] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 31 ms returned sat
[2024-06-01 16:49:28] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2024-06-01 16:49:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:49:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 163 ms returned sat
[2024-06-01 16:49:29] [INFO ] Deduced a trap composed of 214 places in 409 ms of which 6 ms to minimize.
[2024-06-01 16:49:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2024-06-01 16:49:29] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 85 ms.
[2024-06-01 16:49:29] [INFO ] Added : 9 causal constraints over 2 iterations in 413 ms. Result :sat
Minimization took 3105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 60 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 72 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-06-01 16:49:33] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:49:33] [INFO ] Invariant cache hit.
[2024-06-01 16:49:34] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2024-06-01 16:49:34] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:49:34] [INFO ] Invariant cache hit.
[2024-06-01 16:49:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:49:47] [INFO ] Implicit Places using invariants and state equation in 13451 ms returned []
Implicit Place search using SMT with State Equation took 14767 ms to find 0 implicit places.
[2024-06-01 16:49:48] [INFO ] Redundant transitions in 111 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-06-01 16:49:48] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:49:48] [INFO ] Invariant cache hit.
[2024-06-01 16:49:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 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 TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 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 TDEAD793 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 TDEAD800 is UNSAT
Problem TDEAD802 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 TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1947 variables, and 137 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
[2024-06-01 16:50:25] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
[2024-06-01 16:50:45] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:50:49] [INFO ] Deduced a trap composed of 226 places in 323 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 2/135 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 135 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 3/3 constraints]
After SMT, in 62871ms problems are : Problem set: 95 solved, 1080 unsolved
Search for dead transitions found 95 dead transitions in 62894ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1086/1181 transitions.
Applied a total of 0 rules in 53 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-06-01 16:50:51] [INFO ] Redundant transitions in 64 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78006 ms. Remains : 770/770 places, 1086/1181 transitions.
[2024-06-01 16:50:51] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-06-01 16:50:51] [INFO ] Computed 137 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (52073 resets) in 7097 ms. (140 steps per ms)
BEST_FIRST walk for 1000001 steps (3321 resets) in 1551 ms. (644 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-06-01 16:50:59] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:50:59] [INFO ] Invariant cache hit.
[2024-06-01 16:50:59] [INFO ] [Real]Absence check using 111 positive place invariants in 36 ms returned sat
[2024-06-01 16:50:59] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 45 ms returned sat
[2024-06-01 16:51:00] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2024-06-01 16:51:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:51:00] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-06-01 16:51:00] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 30 ms returned sat
[2024-06-01 16:51:01] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2024-06-01 16:51:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:51:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2024-06-01 16:51:01] [INFO ] Deduced a trap composed of 251 places in 359 ms of which 5 ms to minimize.
[2024-06-01 16:51:02] [INFO ] Deduced a trap composed of 251 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:51:02] [INFO ] Deduced a trap composed of 246 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:51:02] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:51:03] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:51:03] [INFO ] Deduced a trap composed of 267 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:51:03] [INFO ] Deduced a trap composed of 239 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:51:04] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:51:04] [INFO ] Deduced a trap composed of 254 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:51:04] [INFO ] Deduced a trap composed of 257 places in 317 ms of which 4 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 260 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 17 ms to minimize.
[2024-06-01 16:51:05] [INFO ] Deduced a trap composed of 248 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 248 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 239 places in 304 ms of which 4 ms to minimize.
[2024-06-01 16:51:07] [INFO ] Deduced a trap composed of 246 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:51:08] [INFO ] Deduced a trap composed of 257 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 279 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 249 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 252 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 248 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 245 places in 253 ms of which 5 ms to minimize.
[2024-06-01 16:51:10] [INFO ] Deduced a trap composed of 246 places in 252 ms of which 7 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 264 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:51:11] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 251 places in 341 ms of which 5 ms to minimize.
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 245 places in 369 ms of which 5 ms to minimize.
[2024-06-01 16:51:13] [INFO ] Deduced a trap composed of 248 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:51:13] [INFO ] Deduced a trap composed of 257 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:51:14] [INFO ] Deduced a trap composed of 236 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:51:14] [INFO ] Deduced a trap composed of 243 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:51:14] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:51:15] [INFO ] Deduced a trap composed of 261 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:51:16] [INFO ] Deduced a trap composed of 246 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 257 places in 314 ms of which 4 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 245 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 255 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:51:18] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:51:18] [INFO ] Deduced a trap composed of 251 places in 245 ms of which 5 ms to minimize.
[2024-06-01 16:51:18] [INFO ] Deduced a trap composed of 246 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:51:19] [INFO ] Deduced a trap composed of 231 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:51:19] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 253 places in 298 ms of which 10 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 260 places in 310 ms of which 10 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 284 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:51:21] [INFO ] Deduced a trap composed of 248 places in 298 ms of which 5 ms to minimize.
[2024-06-01 16:51:21] [INFO ] Deduced a trap composed of 273 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:51:22] [INFO ] Deduced a trap composed of 245 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:51:22] [INFO ] Deduced a trap composed of 236 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:51:25] [INFO ] Deduced a trap composed of 254 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:51:26] [INFO ] Deduced a trap composed of 230 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:51:27] [INFO ] Deduced a trap composed of 247 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:51:27] [INFO ] Deduced a trap composed of 259 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:51:27] [INFO ] Deduced a trap composed of 240 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:51:30] [INFO ] Deduced a trap composed of 241 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:51:31] [INFO ] Deduced a trap composed of 250 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:51:36] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 34509 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 61 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 46 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-06-01 16:51:36] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:51:36] [INFO ] Invariant cache hit.
[2024-06-01 16:51:37] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2024-06-01 16:51:37] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:51:37] [INFO ] Invariant cache hit.
[2024-06-01 16:51:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:51:50] [INFO ] Implicit Places using invariants and state equation in 13112 ms returned []
Implicit Place search using SMT with State Equation took 14424 ms to find 0 implicit places.
[2024-06-01 16:51:50] [INFO ] Redundant transitions in 26 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:51:50] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:51:50] [INFO ] Invariant cache hit.
[2024-06-01 16:51:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:52:03] [INFO ] Deduced a trap composed of 281 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:52:03] [INFO ] Deduced a trap composed of 242 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:52:04] [INFO ] Deduced a trap composed of 209 places in 336 ms of which 4 ms to minimize.
[2024-06-01 16:52:04] [INFO ] Deduced a trap composed of 206 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:52:04] [INFO ] Deduced a trap composed of 209 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:52:05] [INFO ] Deduced a trap composed of 204 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:52:05] [INFO ] Deduced a trap composed of 203 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:52:05] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:52:05] [INFO ] Deduced a trap composed of 209 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:52:06] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:52:06] [INFO ] Deduced a trap composed of 206 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:52:06] [INFO ] Deduced a trap composed of 197 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:52:07] [INFO ] Deduced a trap composed of 201 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:52:07] [INFO ] Deduced a trap composed of 206 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:52:07] [INFO ] Deduced a trap composed of 199 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:52:08] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 5 ms to minimize.
[2024-06-01 16:52:08] [INFO ] Deduced a trap composed of 204 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:52:08] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:52:08] [INFO ] Deduced a trap composed of 197 places in 317 ms of which 4 ms to minimize.
[2024-06-01 16:52:09] [INFO ] Deduced a trap composed of 201 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:52:10] [INFO ] Deduced a trap composed of 240 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:52:11] [INFO ] Deduced a trap composed of 248 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:52:12] [INFO ] Deduced a trap composed of 211 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:52:12] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:52:12] [INFO ] Deduced a trap composed of 240 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:52:12] [INFO ] Deduced a trap composed of 265 places in 288 ms of which 3 ms to minimize.
[2024-06-01 16:52:13] [INFO ] Deduced a trap composed of 233 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:52:13] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 196 places in 209 ms of which 4 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:52:14] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 206 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:52:15] [INFO ] Deduced a trap composed of 209 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:52:16] [INFO ] Deduced a trap composed of 206 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:52:16] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:52:16] [INFO ] Deduced a trap composed of 199 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:52:17] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:52:17] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:52:34] [INFO ] Deduced a trap composed of 149 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:52:34] [INFO ] Deduced a trap composed of 149 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:52:34] [INFO ] Deduced a trap composed of 136 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 140 places in 335 ms of which 4 ms to minimize.
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 136 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 246 places in 324 ms of which 4 ms to minimize.
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 188 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:52:36] [INFO ] Deduced a trap composed of 239 places in 361 ms of which 6 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 242 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 147 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:52:37] [INFO ] Deduced a trap composed of 210 places in 391 ms of which 5 ms to minimize.
[2024-06-01 16:52:38] [INFO ] Deduced a trap composed of 208 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:52:38] [INFO ] Deduced a trap composed of 202 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:52:38] [INFO ] Deduced a trap composed of 213 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:52:39] [INFO ] Deduced a trap composed of 212 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:52:39] [INFO ] Deduced a trap composed of 206 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:52:39] [INFO ] Deduced a trap composed of 203 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:52:40] [INFO ] Deduced a trap composed of 240 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:52:40] [INFO ] Deduced a trap composed of 242 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:52:41] [INFO ] Deduced a trap composed of 239 places in 304 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 62733ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77253 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2127 resets) in 1099 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (149 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 161901 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 161901 steps, saw 47463 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-01 16:52:56] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:52:56] [INFO ] Invariant cache hit.
[2024-06-01 16:52:56] [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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 1 solved, 1 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 16:52:58] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:52:58] [INFO ] Deduced a trap composed of 269 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:52:58] [INFO ] Deduced a trap composed of 246 places in 248 ms of which 9 ms to minimize.
[2024-06-01 16:52:59] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:52:59] [INFO ] Deduced a trap composed of 236 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:52:59] [INFO ] Deduced a trap composed of 239 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:53:00] [INFO ] Deduced a trap composed of 254 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:53:00] [INFO ] Deduced a trap composed of 254 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:53:00] [INFO ] Deduced a trap composed of 254 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:53:00] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:53:01] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:53:01] [INFO ] Deduced a trap composed of 254 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:53:01] [INFO ] Deduced a trap composed of 239 places in 269 ms of which 5 ms to minimize.
[2024-06-01 16:53:02] [INFO ] Deduced a trap composed of 254 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:53:02] [INFO ] Deduced a trap composed of 233 places in 268 ms of which 5 ms to minimize.
[2024-06-01 16:53:02] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:53:02] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 4 ms to minimize.
SMT process timed out in 6068ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:53:03] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:53:03] [INFO ] Invariant cache hit.
[2024-06-01 16:53:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:53:16] [INFO ] Deduced a trap composed of 281 places in 259 ms of which 5 ms to minimize.
[2024-06-01 16:53:16] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 5 ms to minimize.
[2024-06-01 16:53:16] [INFO ] Deduced a trap composed of 209 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:53:16] [INFO ] Deduced a trap composed of 206 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:53:17] [INFO ] Deduced a trap composed of 209 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:53:17] [INFO ] Deduced a trap composed of 204 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:53:17] [INFO ] Deduced a trap composed of 203 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:53:18] [INFO ] Deduced a trap composed of 197 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:53:18] [INFO ] Deduced a trap composed of 209 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:53:18] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:53:19] [INFO ] Deduced a trap composed of 206 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:53:19] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:53:19] [INFO ] Deduced a trap composed of 201 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:53:20] [INFO ] Deduced a trap composed of 206 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:53:20] [INFO ] Deduced a trap composed of 199 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:53:20] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 3 ms to minimize.
[2024-06-01 16:53:20] [INFO ] Deduced a trap composed of 204 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:53:21] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 3 ms to minimize.
[2024-06-01 16:53:21] [INFO ] Deduced a trap composed of 197 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:53:21] [INFO ] Deduced a trap composed of 201 places in 259 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:53:22] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:53:23] [INFO ] Deduced a trap composed of 248 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:53:24] [INFO ] Deduced a trap composed of 211 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:53:24] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-06-01 16:53:24] [INFO ] Deduced a trap composed of 240 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:53:25] [INFO ] Deduced a trap composed of 265 places in 260 ms of which 5 ms to minimize.
[2024-06-01 16:53:25] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:53:25] [INFO ] Deduced a trap composed of 197 places in 225 ms of which 3 ms to minimize.
SMT process timed out in 22453ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 22478ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22532 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2066 resets) in 435 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (132 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 188460 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 188460 steps, saw 55567 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 16:53:28] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:53:28] [INFO ] Invariant cache hit.
[2024-06-01 16:53:28] [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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:53:30] [INFO ] Deduced a trap composed of 233 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:53:30] [INFO ] Deduced a trap composed of 269 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:53:30] [INFO ] Deduced a trap composed of 246 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 5 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 239 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 254 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:53:32] [INFO ] Deduced a trap composed of 254 places in 338 ms of which 6 ms to minimize.
[2024-06-01 16:53:32] [INFO ] Deduced a trap composed of 254 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:53:32] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:53:33] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 5 ms to minimize.
[2024-06-01 16:53:33] [INFO ] Deduced a trap composed of 254 places in 295 ms of which 5 ms to minimize.
[2024-06-01 16:53:33] [INFO ] Deduced a trap composed of 239 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:53:34] [INFO ] Deduced a trap composed of 254 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:53:34] [INFO ] Deduced a trap composed of 233 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:53:34] [INFO ] Deduced a trap composed of 242 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:53:35] [INFO ] Deduced a trap composed of 242 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:53:35] [INFO ] Deduced a trap composed of 218 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:53:35] [INFO ] Deduced a trap composed of 241 places in 278 ms of which 4 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 258 places in 242 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 224 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 241 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 251 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 239 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 239 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 240 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 251 places in 240 ms of which 5 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 246 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 265 places in 232 ms of which 5 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 250 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:53:39] [INFO ] Deduced a trap composed of 256 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 248 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:53:40] [INFO ] Deduced a trap composed of 254 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 272 places in 308 ms of which 6 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 251 places in 229 ms of which 3 ms to minimize.
[2024-06-01 16:53:41] [INFO ] Deduced a trap composed of 257 places in 274 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:53:42] [INFO ] Deduced a trap composed of 231 places in 378 ms of which 6 ms to minimize.
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 260 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:53:43] [INFO ] Deduced a trap composed of 245 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:53:45] [INFO ] Deduced a trap composed of 236 places in 380 ms of which 6 ms to minimize.
[2024-06-01 16:53:45] [INFO ] Deduced a trap composed of 230 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:53:45] [INFO ] Deduced a trap composed of 236 places in 322 ms of which 5 ms to minimize.
[2024-06-01 16:53:46] [INFO ] Deduced a trap composed of 218 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:53:46] [INFO ] Deduced a trap composed of 246 places in 284 ms of which 3 ms to minimize.
[2024-06-01 16:53:46] [INFO ] Deduced a trap composed of 248 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:53:47] [INFO ] Deduced a trap composed of 242 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:53:47] [INFO ] Deduced a trap composed of 227 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:53:48] [INFO ] Deduced a trap composed of 251 places in 379 ms of which 6 ms to minimize.
[2024-06-01 16:53:48] [INFO ] Deduced a trap composed of 254 places in 380 ms of which 6 ms to minimize.
[2024-06-01 16:53:49] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:53:50] [INFO ] Deduced a trap composed of 239 places in 368 ms of which 6 ms to minimize.
[2024-06-01 16:53:50] [INFO ] Deduced a trap composed of 242 places in 373 ms of which 5 ms to minimize.
[2024-06-01 16:53:50] [INFO ] Deduced a trap composed of 242 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:53:52] [INFO ] Deduced a trap composed of 248 places in 373 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:53:53] [INFO ] Deduced a trap composed of 260 places in 294 ms of which 5 ms to minimize.
[2024-06-01 16:53:53] [INFO ] Deduced a trap composed of 242 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:53:53] [INFO ] Deduced a trap composed of 257 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 245 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:53:54] [INFO ] Deduced a trap composed of 242 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 245 places in 329 ms of which 6 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 236 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 236 places in 320 ms of which 6 ms to minimize.
[2024-06-01 16:53:56] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 273 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 236 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 239 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:53:58] [INFO ] Deduced a trap composed of 260 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:53:58] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 5 ms to minimize.
[2024-06-01 16:53:58] [INFO ] Deduced a trap composed of 257 places in 280 ms of which 5 ms to minimize.
[2024-06-01 16:53:58] [INFO ] Deduced a trap composed of 239 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:53:59] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:53:59] [INFO ] Deduced a trap composed of 268 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 236 places in 315 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 233 places in 226 ms of which 5 ms to minimize.
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 242 places in 289 ms of which 17 ms to minimize.
[2024-06-01 16:54:01] [INFO ] Deduced a trap composed of 245 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:54:02] [INFO ] Deduced a trap composed of 257 places in 315 ms of which 8 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 245 places in 299 ms of which 4 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:54:03] [INFO ] Deduced a trap composed of 250 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:54:04] [INFO ] Deduced a trap composed of 242 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:54:04] [INFO ] Deduced a trap composed of 254 places in 341 ms of which 4 ms to minimize.
[2024-06-01 16:54:05] [INFO ] Deduced a trap composed of 239 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:54:05] [INFO ] Deduced a trap composed of 247 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:54:05] [INFO ] Deduced a trap composed of 242 places in 355 ms of which 6 ms to minimize.
[2024-06-01 16:54:07] [INFO ] Deduced a trap composed of 224 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:54:07] [INFO ] Deduced a trap composed of 239 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:54:08] [INFO ] Deduced a trap composed of 218 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:54:08] [INFO ] Deduced a trap composed of 231 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:54:08] [INFO ] Deduced a trap composed of 254 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:54:09] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:54:09] [INFO ] Deduced a trap composed of 254 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:54:09] [INFO ] Deduced a trap composed of 239 places in 283 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:54:10] [INFO ] Deduced a trap composed of 246 places in 305 ms of which 5 ms to minimize.
[2024-06-01 16:54:10] [INFO ] Deduced a trap composed of 263 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:54:10] [INFO ] Deduced a trap composed of 242 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:54:11] [INFO ] Deduced a trap composed of 260 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:54:12] [INFO ] Deduced a trap composed of 218 places in 380 ms of which 5 ms to minimize.
[2024-06-01 16:54:12] [INFO ] Deduced a trap composed of 224 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:54:13] [INFO ] Deduced a trap composed of 236 places in 341 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1852 variables, and 244 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 107/107 constraints]
After SMT, in 45832ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 46 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 60 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-06-01 16:54:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:54:14] [INFO ] Invariant cache hit.
[2024-06-01 16:54:15] [INFO ] Implicit Places using invariants in 1282 ms returned []
[2024-06-01 16:54:15] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:54:15] [INFO ] Invariant cache hit.
[2024-06-01 16:54:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:54:27] [INFO ] Implicit Places using invariants and state equation in 12038 ms returned []
Implicit Place search using SMT with State Equation took 13322 ms to find 0 implicit places.
[2024-06-01 16:54:28] [INFO ] Redundant transitions in 13 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:54:28] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:54:28] [INFO ] Invariant cache hit.
[2024-06-01 16:54:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:54:40] [INFO ] Deduced a trap composed of 281 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:54:41] [INFO ] Deduced a trap composed of 242 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:54:41] [INFO ] Deduced a trap composed of 209 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:54:41] [INFO ] Deduced a trap composed of 206 places in 286 ms of which 5 ms to minimize.
[2024-06-01 16:54:42] [INFO ] Deduced a trap composed of 209 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:54:42] [INFO ] Deduced a trap composed of 204 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:54:42] [INFO ] Deduced a trap composed of 203 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:54:43] [INFO ] Deduced a trap composed of 197 places in 222 ms of which 4 ms to minimize.
[2024-06-01 16:54:43] [INFO ] Deduced a trap composed of 209 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:54:43] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:54:44] [INFO ] Deduced a trap composed of 206 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:54:44] [INFO ] Deduced a trap composed of 197 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:54:44] [INFO ] Deduced a trap composed of 201 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:54:44] [INFO ] Deduced a trap composed of 206 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:54:45] [INFO ] Deduced a trap composed of 199 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:54:45] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:54:45] [INFO ] Deduced a trap composed of 204 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:54:46] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:54:46] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:54:46] [INFO ] Deduced a trap composed of 201 places in 276 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:54:47] [INFO ] Deduced a trap composed of 240 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:54:49] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:54:49] [INFO ] Deduced a trap composed of 211 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:54:49] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:54:49] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:54:50] [INFO ] Deduced a trap composed of 265 places in 255 ms of which 3 ms to minimize.
[2024-06-01 16:54:50] [INFO ] Deduced a trap composed of 233 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:54:50] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:54:51] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:54:51] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:54:52] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:54:52] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:54:52] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 3 ms to minimize.
[2024-06-01 16:54:53] [INFO ] Deduced a trap composed of 206 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:54:53] [INFO ] Deduced a trap composed of 209 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:54:53] [INFO ] Deduced a trap composed of 206 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:54:53] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:54:54] [INFO ] Deduced a trap composed of 199 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:54:54] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:54:54] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:55:11] [INFO ] Deduced a trap composed of 149 places in 351 ms of which 6 ms to minimize.
[2024-06-01 16:55:11] [INFO ] Deduced a trap composed of 149 places in 349 ms of which 5 ms to minimize.
[2024-06-01 16:55:12] [INFO ] Deduced a trap composed of 136 places in 293 ms of which 3 ms to minimize.
[2024-06-01 16:55:12] [INFO ] Deduced a trap composed of 140 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:55:12] [INFO ] Deduced a trap composed of 136 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:55:13] [INFO ] Deduced a trap composed of 246 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:55:13] [INFO ] Deduced a trap composed of 188 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:55:13] [INFO ] Deduced a trap composed of 239 places in 269 ms of which 3 ms to minimize.
[2024-06-01 16:55:14] [INFO ] Deduced a trap composed of 242 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:55:14] [INFO ] Deduced a trap composed of 147 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:55:14] [INFO ] Deduced a trap composed of 210 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:55:15] [INFO ] Deduced a trap composed of 208 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:55:15] [INFO ] Deduced a trap composed of 202 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:55:15] [INFO ] Deduced a trap composed of 213 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:55:15] [INFO ] Deduced a trap composed of 212 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:55:16] [INFO ] Deduced a trap composed of 206 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:55:16] [INFO ] Deduced a trap composed of 203 places in 276 ms of which 3 ms to minimize.
[2024-06-01 16:55:17] [INFO ] Deduced a trap composed of 240 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:55:17] [INFO ] Deduced a trap composed of 242 places in 416 ms of which 5 ms to minimize.
[2024-06-01 16:55:18] [INFO ] Deduced a trap composed of 239 places in 302 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 62518ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62527ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75942 ms. Remains : 770/770 places, 1086/1086 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[136]
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-06
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:[136]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[136]
[2024-06-01 16:55:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:55:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[136]
RANDOM walk for 10000 steps (530 resets) in 110 ms. (90 steps per ms)
BEST_FIRST walk for 10001 steps (37 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-06-01 16:55:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:55:30] [INFO ] Invariant cache hit.
[2024-06-01 16:55:30] [INFO ] [Real]Absence check using 111 positive place invariants in 40 ms returned sat
[2024-06-01 16:55:30] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 30 ms returned sat
[2024-06-01 16:55:31] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2024-06-01 16:55:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:55:31] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-06-01 16:55:31] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 31 ms returned sat
[2024-06-01 16:55:32] [INFO ] [Nat]Absence check using state equation in 878 ms returned sat
[2024-06-01 16:55:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:55:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2024-06-01 16:55:32] [INFO ] Deduced a trap composed of 251 places in 288 ms of which 5 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 251 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 246 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:55:33] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 230 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 267 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 239 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:55:34] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 254 places in 347 ms of which 6 ms to minimize.
[2024-06-01 16:55:35] [INFO ] Deduced a trap composed of 257 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 260 places in 353 ms of which 6 ms to minimize.
[2024-06-01 16:55:36] [INFO ] Deduced a trap composed of 242 places in 388 ms of which 6 ms to minimize.
[2024-06-01 16:55:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 44 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:55:36] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:55:36] [INFO ] Invariant cache hit.
[2024-06-01 16:55:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:55:50] [INFO ] Deduced a trap composed of 281 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:55:50] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:55:51] [INFO ] Deduced a trap composed of 209 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:55:51] [INFO ] Deduced a trap composed of 206 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:55:51] [INFO ] Deduced a trap composed of 209 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:55:52] [INFO ] Deduced a trap composed of 204 places in 271 ms of which 5 ms to minimize.
[2024-06-01 16:55:52] [INFO ] Deduced a trap composed of 203 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:55:52] [INFO ] Deduced a trap composed of 197 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:55:53] [INFO ] Deduced a trap composed of 209 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:55:53] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:55:53] [INFO ] Deduced a trap composed of 206 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:55:54] [INFO ] Deduced a trap composed of 197 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:55:54] [INFO ] Deduced a trap composed of 201 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:55:54] [INFO ] Deduced a trap composed of 206 places in 345 ms of which 5 ms to minimize.
[2024-06-01 16:55:55] [INFO ] Deduced a trap composed of 199 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:55:55] [INFO ] Deduced a trap composed of 197 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:55:55] [INFO ] Deduced a trap composed of 204 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:55:56] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:55:56] [INFO ] Deduced a trap composed of 197 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:55:56] [INFO ] Deduced a trap composed of 201 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:55:58] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 248 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:55:59] [INFO ] Deduced a trap composed of 211 places in 255 ms of which 4 ms to minimize.
SMT process timed out in 22791ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 22802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22849 ms. Remains : 770/770 places, 1086/1086 transitions.
[2024-06-01 16:55:59] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:55:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (52017 resets) in 7134 ms. (140 steps per ms)
BEST_FIRST walk for 1000001 steps (3508 resets) in 1423 ms. (702 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-06-01 16:56:08] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:56:08] [INFO ] Invariant cache hit.
[2024-06-01 16:56:08] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-06-01 16:56:08] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 35 ms returned sat
[2024-06-01 16:56:08] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2024-06-01 16:56:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:56:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-06-01 16:56:08] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 31 ms returned sat
[2024-06-01 16:56:09] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2024-06-01 16:56:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:56:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2024-06-01 16:56:10] [INFO ] Deduced a trap composed of 251 places in 305 ms of which 6 ms to minimize.
[2024-06-01 16:56:10] [INFO ] Deduced a trap composed of 251 places in 314 ms of which 4 ms to minimize.
[2024-06-01 16:56:10] [INFO ] Deduced a trap composed of 246 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:56:11] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:56:11] [INFO ] Deduced a trap composed of 230 places in 341 ms of which 3 ms to minimize.
[2024-06-01 16:56:11] [INFO ] Deduced a trap composed of 267 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:56:12] [INFO ] Deduced a trap composed of 239 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:56:12] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:56:12] [INFO ] Deduced a trap composed of 254 places in 230 ms of which 4 ms to minimize.
[2024-06-01 16:56:13] [INFO ] Deduced a trap composed of 257 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:56:13] [INFO ] Deduced a trap composed of 260 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:56:13] [INFO ] Deduced a trap composed of 242 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:56:14] [INFO ] Deduced a trap composed of 248 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:56:14] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:56:14] [INFO ] Deduced a trap composed of 242 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:56:15] [INFO ] Deduced a trap composed of 248 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:56:15] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:56:15] [INFO ] Deduced a trap composed of 246 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:56:16] [INFO ] Deduced a trap composed of 257 places in 308 ms of which 4 ms to minimize.
[2024-06-01 16:56:17] [INFO ] Deduced a trap composed of 279 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:56:17] [INFO ] Deduced a trap composed of 249 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:56:18] [INFO ] Deduced a trap composed of 252 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:56:18] [INFO ] Deduced a trap composed of 248 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:56:18] [INFO ] Deduced a trap composed of 245 places in 279 ms of which 4 ms to minimize.
[2024-06-01 16:56:19] [INFO ] Deduced a trap composed of 246 places in 298 ms of which 4 ms to minimize.
[2024-06-01 16:56:19] [INFO ] Deduced a trap composed of 264 places in 278 ms of which 3 ms to minimize.
[2024-06-01 16:56:19] [INFO ] Deduced a trap composed of 233 places in 259 ms of which 3 ms to minimize.
[2024-06-01 16:56:20] [INFO ] Deduced a trap composed of 251 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:56:20] [INFO ] Deduced a trap composed of 245 places in 289 ms of which 3 ms to minimize.
[2024-06-01 16:56:21] [INFO ] Deduced a trap composed of 248 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:56:21] [INFO ] Deduced a trap composed of 257 places in 267 ms of which 3 ms to minimize.
[2024-06-01 16:56:22] [INFO ] Deduced a trap composed of 236 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:56:22] [INFO ] Deduced a trap composed of 243 places in 296 ms of which 5 ms to minimize.
[2024-06-01 16:56:22] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:56:23] [INFO ] Deduced a trap composed of 261 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:56:24] [INFO ] Deduced a trap composed of 246 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:56:24] [INFO ] Deduced a trap composed of 257 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:56:25] [INFO ] Deduced a trap composed of 245 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:56:25] [INFO ] Deduced a trap composed of 255 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:56:26] [INFO ] Deduced a trap composed of 236 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:56:26] [INFO ] Deduced a trap composed of 251 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:56:27] [INFO ] Deduced a trap composed of 246 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:56:27] [INFO ] Deduced a trap composed of 231 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:56:27] [INFO ] Deduced a trap composed of 238 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:56:28] [INFO ] Deduced a trap composed of 253 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:56:28] [INFO ] Deduced a trap composed of 260 places in 242 ms of which 3 ms to minimize.
[2024-06-01 16:56:28] [INFO ] Deduced a trap composed of 284 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:56:29] [INFO ] Deduced a trap composed of 248 places in 245 ms of which 3 ms to minimize.
[2024-06-01 16:56:29] [INFO ] Deduced a trap composed of 273 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:56:30] [INFO ] Deduced a trap composed of 245 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:56:30] [INFO ] Deduced a trap composed of 236 places in 337 ms of which 22 ms to minimize.
[2024-06-01 16:56:33] [INFO ] Deduced a trap composed of 254 places in 315 ms of which 4 ms to minimize.
[2024-06-01 16:56:34] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 5 ms to minimize.
[2024-06-01 16:56:35] [INFO ] Deduced a trap composed of 247 places in 334 ms of which 4 ms to minimize.
[2024-06-01 16:56:35] [INFO ] Deduced a trap composed of 259 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:56:35] [INFO ] Deduced a trap composed of 240 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:56:38] [INFO ] Deduced a trap composed of 241 places in 287 ms of which 3 ms to minimize.
[2024-06-01 16:56:39] [INFO ] Deduced a trap composed of 250 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:56:43] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 34006 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 79 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 64 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-06-01 16:56:44] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:56:44] [INFO ] Invariant cache hit.
[2024-06-01 16:56:45] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2024-06-01 16:56:45] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:56:45] [INFO ] Invariant cache hit.
[2024-06-01 16:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:56:57] [INFO ] Implicit Places using invariants and state equation in 12515 ms returned []
Implicit Place search using SMT with State Equation took 13806 ms to find 0 implicit places.
[2024-06-01 16:56:57] [INFO ] Redundant transitions in 13 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:56:58] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:56:58] [INFO ] Invariant cache hit.
[2024-06-01 16:56:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 281 places in 360 ms of which 5 ms to minimize.
[2024-06-01 16:57:11] [INFO ] Deduced a trap composed of 242 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:57:12] [INFO ] Deduced a trap composed of 209 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:57:12] [INFO ] Deduced a trap composed of 206 places in 261 ms of which 7 ms to minimize.
[2024-06-01 16:57:12] [INFO ] Deduced a trap composed of 209 places in 314 ms of which 6 ms to minimize.
[2024-06-01 16:57:13] [INFO ] Deduced a trap composed of 204 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:57:13] [INFO ] Deduced a trap composed of 203 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:57:13] [INFO ] Deduced a trap composed of 197 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:57:13] [INFO ] Deduced a trap composed of 209 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:57:14] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:57:14] [INFO ] Deduced a trap composed of 206 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 197 places in 292 ms of which 5 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 201 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 206 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:57:15] [INFO ] Deduced a trap composed of 199 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:57:16] [INFO ] Deduced a trap composed of 197 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:57:16] [INFO ] Deduced a trap composed of 204 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:57:16] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:57:16] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:57:17] [INFO ] Deduced a trap composed of 201 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:57:18] [INFO ] Deduced a trap composed of 240 places in 303 ms of which 5 ms to minimize.
[2024-06-01 16:57:20] [INFO ] Deduced a trap composed of 248 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:57:20] [INFO ] Deduced a trap composed of 211 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:57:20] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 3 ms to minimize.
[2024-06-01 16:57:20] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 265 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 233 places in 260 ms of which 5 ms to minimize.
[2024-06-01 16:57:21] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:57:22] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-06-01 16:57:22] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:57:23] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:57:24] [INFO ] Deduced a trap composed of 206 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:57:24] [INFO ] Deduced a trap composed of 209 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:57:24] [INFO ] Deduced a trap composed of 206 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:57:25] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 4 ms to minimize.
[2024-06-01 16:57:25] [INFO ] Deduced a trap composed of 199 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:57:25] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
[2024-06-01 16:57:26] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:57:42] [INFO ] Deduced a trap composed of 149 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:57:42] [INFO ] Deduced a trap composed of 149 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:57:42] [INFO ] Deduced a trap composed of 136 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:57:43] [INFO ] Deduced a trap composed of 140 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:57:43] [INFO ] Deduced a trap composed of 136 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:57:43] [INFO ] Deduced a trap composed of 246 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:57:43] [INFO ] Deduced a trap composed of 188 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:57:44] [INFO ] Deduced a trap composed of 239 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:57:44] [INFO ] Deduced a trap composed of 242 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:57:44] [INFO ] Deduced a trap composed of 147 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:57:45] [INFO ] Deduced a trap composed of 210 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:57:45] [INFO ] Deduced a trap composed of 208 places in 261 ms of which 3 ms to minimize.
[2024-06-01 16:57:45] [INFO ] Deduced a trap composed of 202 places in 266 ms of which 3 ms to minimize.
[2024-06-01 16:57:46] [INFO ] Deduced a trap composed of 213 places in 317 ms of which 4 ms to minimize.
[2024-06-01 16:57:46] [INFO ] Deduced a trap composed of 212 places in 308 ms of which 4 ms to minimize.
[2024-06-01 16:57:46] [INFO ] Deduced a trap composed of 206 places in 309 ms of which 4 ms to minimize.
[2024-06-01 16:57:47] [INFO ] Deduced a trap composed of 203 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:57:48] [INFO ] Deduced a trap composed of 240 places in 389 ms of which 6 ms to minimize.
[2024-06-01 16:57:48] [INFO ] Deduced a trap composed of 242 places in 359 ms of which 5 ms to minimize.
[2024-06-01 16:57:49] [INFO ] Deduced a trap composed of 239 places in 381 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 63327ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 63340ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77262 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2067 resets) in 760 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (141 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 170843 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 170843 steps, saw 50192 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 16:58:04] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:58:04] [INFO ] Invariant cache hit.
[2024-06-01 16:58:04] [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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 1 solved, 1 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 16:58:05] [INFO ] Deduced a trap composed of 233 places in 261 ms of which 4 ms to minimize.
[2024-06-01 16:58:06] [INFO ] Deduced a trap composed of 269 places in 315 ms of which 4 ms to minimize.
[2024-06-01 16:58:06] [INFO ] Deduced a trap composed of 246 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:58:06] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:58:07] [INFO ] Deduced a trap composed of 236 places in 329 ms of which 5 ms to minimize.
[2024-06-01 16:58:07] [INFO ] Deduced a trap composed of 239 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:58:07] [INFO ] Deduced a trap composed of 254 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:58:07] [INFO ] Deduced a trap composed of 254 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:58:08] [INFO ] Deduced a trap composed of 254 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:58:08] [INFO ] Deduced a trap composed of 236 places in 299 ms of which 5 ms to minimize.
[2024-06-01 16:58:08] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 3 ms to minimize.
[2024-06-01 16:58:09] [INFO ] Deduced a trap composed of 254 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:58:09] [INFO ] Deduced a trap composed of 239 places in 226 ms of which 3 ms to minimize.
[2024-06-01 16:58:09] [INFO ] Deduced a trap composed of 254 places in 358 ms of which 5 ms to minimize.
[2024-06-01 16:58:10] [INFO ] Deduced a trap composed of 233 places in 316 ms of which 5 ms to minimize.
[2024-06-01 16:58:10] [INFO ] Deduced a trap composed of 242 places in 221 ms of which 3 ms to minimize.
[2024-06-01 16:58:10] [INFO ] Deduced a trap composed of 242 places in 289 ms of which 4 ms to minimize.
SMT process timed out in 5940ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:58:10] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:58:10] [INFO ] Invariant cache hit.
[2024-06-01 16:58:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:58:23] [INFO ] Deduced a trap composed of 281 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:58:23] [INFO ] Deduced a trap composed of 242 places in 318 ms of which 15 ms to minimize.
[2024-06-01 16:58:24] [INFO ] Deduced a trap composed of 209 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:58:24] [INFO ] Deduced a trap composed of 206 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:58:24] [INFO ] Deduced a trap composed of 209 places in 241 ms of which 3 ms to minimize.
[2024-06-01 16:58:24] [INFO ] Deduced a trap composed of 204 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:58:25] [INFO ] Deduced a trap composed of 203 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:58:25] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:58:25] [INFO ] Deduced a trap composed of 209 places in 223 ms of which 4 ms to minimize.
[2024-06-01 16:58:26] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:58:26] [INFO ] Deduced a trap composed of 206 places in 258 ms of which 3 ms to minimize.
[2024-06-01 16:58:26] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:58:26] [INFO ] Deduced a trap composed of 201 places in 262 ms of which 4 ms to minimize.
[2024-06-01 16:58:27] [INFO ] Deduced a trap composed of 206 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:58:27] [INFO ] Deduced a trap composed of 199 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:58:27] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:58:28] [INFO ] Deduced a trap composed of 204 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:58:28] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:58:28] [INFO ] Deduced a trap composed of 197 places in 274 ms of which 5 ms to minimize.
[2024-06-01 16:58:28] [INFO ] Deduced a trap composed of 201 places in 272 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:58:30] [INFO ] Deduced a trap composed of 240 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:58:31] [INFO ] Deduced a trap composed of 248 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:58:31] [INFO ] Deduced a trap composed of 211 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:58:32] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-06-01 16:58:32] [INFO ] Deduced a trap composed of 240 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:58:32] [INFO ] Deduced a trap composed of 265 places in 238 ms of which 3 ms to minimize.
[2024-06-01 16:58:32] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:58:33] [INFO ] Deduced a trap composed of 197 places in 287 ms of which 4 ms to minimize.
SMT process timed out in 22490ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 22500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22527 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2092 resets) in 490 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (143 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 169039 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 169039 steps, saw 49657 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 16:58:36] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:58:36] [INFO ] Invariant cache hit.
[2024-06-01 16:58:36] [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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 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) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:58:37] [INFO ] Deduced a trap composed of 233 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:58:37] [INFO ] Deduced a trap composed of 269 places in 297 ms of which 5 ms to minimize.
[2024-06-01 16:58:38] [INFO ] Deduced a trap composed of 246 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:58:38] [INFO ] Deduced a trap composed of 242 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:58:38] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:58:39] [INFO ] Deduced a trap composed of 239 places in 282 ms of which 4 ms to minimize.
[2024-06-01 16:58:39] [INFO ] Deduced a trap composed of 254 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:58:39] [INFO ] Deduced a trap composed of 254 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:58:39] [INFO ] Deduced a trap composed of 254 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:58:40] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:58:40] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:58:40] [INFO ] Deduced a trap composed of 254 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:58:40] [INFO ] Deduced a trap composed of 239 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:58:41] [INFO ] Deduced a trap composed of 254 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:58:41] [INFO ] Deduced a trap composed of 233 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:58:41] [INFO ] Deduced a trap composed of 242 places in 219 ms of which 4 ms to minimize.
[2024-06-01 16:58:42] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:58:42] [INFO ] Deduced a trap composed of 218 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:58:42] [INFO ] Deduced a trap composed of 241 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:58:42] [INFO ] Deduced a trap composed of 258 places in 270 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:58:43] [INFO ] Deduced a trap composed of 224 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:58:43] [INFO ] Deduced a trap composed of 241 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:58:43] [INFO ] Deduced a trap composed of 251 places in 235 ms of which 4 ms to minimize.
[2024-06-01 16:58:43] [INFO ] Deduced a trap composed of 239 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:58:44] [INFO ] Deduced a trap composed of 239 places in 248 ms of which 3 ms to minimize.
[2024-06-01 16:58:44] [INFO ] Deduced a trap composed of 240 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:58:44] [INFO ] Deduced a trap composed of 251 places in 221 ms of which 4 ms to minimize.
[2024-06-01 16:58:44] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:58:45] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:58:45] [INFO ] Deduced a trap composed of 246 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:58:45] [INFO ] Deduced a trap composed of 236 places in 348 ms of which 4 ms to minimize.
[2024-06-01 16:58:46] [INFO ] Deduced a trap composed of 265 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:58:46] [INFO ] Deduced a trap composed of 250 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:58:46] [INFO ] Deduced a trap composed of 256 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:58:47] [INFO ] Deduced a trap composed of 248 places in 297 ms of which 4 ms to minimize.
[2024-06-01 16:58:47] [INFO ] Deduced a trap composed of 248 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:58:47] [INFO ] Deduced a trap composed of 254 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:58:48] [INFO ] Deduced a trap composed of 272 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:58:48] [INFO ] Deduced a trap composed of 251 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:58:48] [INFO ] Deduced a trap composed of 257 places in 283 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:58:48] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:58:49] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:58:49] [INFO ] Deduced a trap composed of 231 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:58:50] [INFO ] Deduced a trap composed of 260 places in 310 ms of which 4 ms to minimize.
[2024-06-01 16:58:50] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:58:51] [INFO ] Deduced a trap composed of 236 places in 302 ms of which 4 ms to minimize.
[2024-06-01 16:58:51] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:58:52] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 4 ms to minimize.
[2024-06-01 16:58:52] [INFO ] Deduced a trap composed of 218 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:58:52] [INFO ] Deduced a trap composed of 246 places in 259 ms of which 6 ms to minimize.
[2024-06-01 16:58:53] [INFO ] Deduced a trap composed of 248 places in 243 ms of which 4 ms to minimize.
[2024-06-01 16:58:53] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 4 ms to minimize.
[2024-06-01 16:58:53] [INFO ] Deduced a trap composed of 227 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:58:54] [INFO ] Deduced a trap composed of 251 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:58:54] [INFO ] Deduced a trap composed of 254 places in 302 ms of which 3 ms to minimize.
[2024-06-01 16:58:55] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:58:55] [INFO ] Deduced a trap composed of 239 places in 285 ms of which 3 ms to minimize.
[2024-06-01 16:58:56] [INFO ] Deduced a trap composed of 242 places in 297 ms of which 5 ms to minimize.
[2024-06-01 16:58:56] [INFO ] Deduced a trap composed of 242 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:58:58] [INFO ] Deduced a trap composed of 248 places in 297 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:58:58] [INFO ] Deduced a trap composed of 260 places in 288 ms of which 4 ms to minimize.
[2024-06-01 16:58:59] [INFO ] Deduced a trap composed of 242 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:58:59] [INFO ] Deduced a trap composed of 257 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:58:59] [INFO ] Deduced a trap composed of 245 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:58:59] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 3 ms to minimize.
[2024-06-01 16:59:00] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:59:00] [INFO ] Deduced a trap composed of 245 places in 273 ms of which 3 ms to minimize.
[2024-06-01 16:59:00] [INFO ] Deduced a trap composed of 236 places in 230 ms of which 3 ms to minimize.
[2024-06-01 16:59:01] [INFO ] Deduced a trap composed of 236 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:59:01] [INFO ] Deduced a trap composed of 233 places in 357 ms of which 5 ms to minimize.
[2024-06-01 16:59:02] [INFO ] Deduced a trap composed of 273 places in 342 ms of which 6 ms to minimize.
[2024-06-01 16:59:02] [INFO ] Deduced a trap composed of 236 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:59:03] [INFO ] Deduced a trap composed of 239 places in 311 ms of which 5 ms to minimize.
[2024-06-01 16:59:03] [INFO ] Deduced a trap composed of 260 places in 293 ms of which 5 ms to minimize.
[2024-06-01 16:59:03] [INFO ] Deduced a trap composed of 236 places in 272 ms of which 4 ms to minimize.
[2024-06-01 16:59:04] [INFO ] Deduced a trap composed of 257 places in 246 ms of which 3 ms to minimize.
[2024-06-01 16:59:04] [INFO ] Deduced a trap composed of 239 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:59:04] [INFO ] Deduced a trap composed of 230 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:59:04] [INFO ] Deduced a trap composed of 268 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:59:05] [INFO ] Deduced a trap composed of 236 places in 360 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:59:05] [INFO ] Deduced a trap composed of 233 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:59:06] [INFO ] Deduced a trap composed of 242 places in 275 ms of which 4 ms to minimize.
[2024-06-01 16:59:06] [INFO ] Deduced a trap composed of 245 places in 310 ms of which 5 ms to minimize.
[2024-06-01 16:59:07] [INFO ] Deduced a trap composed of 257 places in 377 ms of which 5 ms to minimize.
[2024-06-01 16:59:08] [INFO ] Deduced a trap composed of 245 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:59:08] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 5 ms to minimize.
[2024-06-01 16:59:09] [INFO ] Deduced a trap composed of 250 places in 335 ms of which 5 ms to minimize.
[2024-06-01 16:59:09] [INFO ] Deduced a trap composed of 242 places in 336 ms of which 6 ms to minimize.
[2024-06-01 16:59:09] [INFO ] Deduced a trap composed of 254 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:59:10] [INFO ] Deduced a trap composed of 239 places in 289 ms of which 5 ms to minimize.
[2024-06-01 16:59:10] [INFO ] Deduced a trap composed of 247 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:59:11] [INFO ] Deduced a trap composed of 242 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:59:12] [INFO ] Deduced a trap composed of 224 places in 352 ms of which 5 ms to minimize.
[2024-06-01 16:59:13] [INFO ] Deduced a trap composed of 239 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:59:13] [INFO ] Deduced a trap composed of 218 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:59:13] [INFO ] Deduced a trap composed of 231 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:59:14] [INFO ] Deduced a trap composed of 254 places in 241 ms of which 6 ms to minimize.
[2024-06-01 16:59:14] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:59:14] [INFO ] Deduced a trap composed of 254 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:59:14] [INFO ] Deduced a trap composed of 239 places in 231 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:59:15] [INFO ] Deduced a trap composed of 246 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:59:15] [INFO ] Deduced a trap composed of 263 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:59:16] [INFO ] Deduced a trap composed of 242 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:59:16] [INFO ] Deduced a trap composed of 260 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:59:17] [INFO ] Deduced a trap composed of 218 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:59:17] [INFO ] Deduced a trap composed of 224 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:59:18] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 3 ms to minimize.
[2024-06-01 16:59:21] [INFO ] Deduced a trap composed of 261 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:59:21] [INFO ] Deduced a trap composed of 260 places in 302 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1852 variables, and 246 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45008 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 109/109 constraints]
After SMT, in 45835ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 57 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 43 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-06-01 16:59:22] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:59:22] [INFO ] Invariant cache hit.
[2024-06-01 16:59:23] [INFO ] Implicit Places using invariants in 1294 ms returned []
[2024-06-01 16:59:23] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:59:23] [INFO ] Invariant cache hit.
[2024-06-01 16:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:59:36] [INFO ] Implicit Places using invariants and state equation in 12759 ms returned []
Implicit Place search using SMT with State Equation took 14081 ms to find 0 implicit places.
[2024-06-01 16:59:36] [INFO ] Redundant transitions in 21 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:59:36] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-06-01 16:59:36] [INFO ] Invariant cache hit.
[2024-06-01 16:59:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:59:48] [INFO ] Deduced a trap composed of 281 places in 280 ms of which 4 ms to minimize.
[2024-06-01 16:59:49] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:59:49] [INFO ] Deduced a trap composed of 209 places in 238 ms of which 4 ms to minimize.
[2024-06-01 16:59:49] [INFO ] Deduced a trap composed of 206 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:59:49] [INFO ] Deduced a trap composed of 209 places in 250 ms of which 4 ms to minimize.
[2024-06-01 16:59:50] [INFO ] Deduced a trap composed of 204 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:59:50] [INFO ] Deduced a trap composed of 203 places in 252 ms of which 3 ms to minimize.
[2024-06-01 16:59:50] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 3 ms to minimize.
[2024-06-01 16:59:50] [INFO ] Deduced a trap composed of 209 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:59:51] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 4 ms to minimize.
[2024-06-01 16:59:51] [INFO ] Deduced a trap composed of 206 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:59:52] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:59:52] [INFO ] Deduced a trap composed of 201 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:59:52] [INFO ] Deduced a trap composed of 206 places in 241 ms of which 4 ms to minimize.
[2024-06-01 16:59:52] [INFO ] Deduced a trap composed of 199 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:59:53] [INFO ] Deduced a trap composed of 197 places in 338 ms of which 5 ms to minimize.
[2024-06-01 16:59:53] [INFO ] Deduced a trap composed of 204 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:59:53] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:59:54] [INFO ] Deduced a trap composed of 197 places in 320 ms of which 6 ms to minimize.
[2024-06-01 16:59:54] [INFO ] Deduced a trap composed of 201 places in 309 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:59:55] [INFO ] Deduced a trap composed of 240 places in 325 ms of which 6 ms to minimize.
[2024-06-01 16:59:56] [INFO ] Deduced a trap composed of 248 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:59:57] [INFO ] Deduced a trap composed of 211 places in 263 ms of which 3 ms to minimize.
[2024-06-01 16:59:57] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:59:57] [INFO ] Deduced a trap composed of 240 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:59:57] [INFO ] Deduced a trap composed of 265 places in 236 ms of which 3 ms to minimize.
[2024-06-01 16:59:58] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:59:58] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:59:59] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-06-01 16:59:59] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:00:00] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-06-01 17:00:00] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-06-01 17:00:00] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2024-06-01 17:00:00] [INFO ] Deduced a trap composed of 206 places in 241 ms of which 4 ms to minimize.
[2024-06-01 17:00:01] [INFO ] Deduced a trap composed of 209 places in 248 ms of which 4 ms to minimize.
[2024-06-01 17:00:01] [INFO ] Deduced a trap composed of 206 places in 236 ms of which 3 ms to minimize.
[2024-06-01 17:00:01] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-06-01 17:00:01] [INFO ] Deduced a trap composed of 199 places in 236 ms of which 4 ms to minimize.
[2024-06-01 17:00:02] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:00:02] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 17:00:20] [INFO ] Deduced a trap composed of 149 places in 365 ms of which 4 ms to minimize.
[2024-06-01 17:00:20] [INFO ] Deduced a trap composed of 149 places in 332 ms of which 5 ms to minimize.
[2024-06-01 17:00:20] [INFO ] Deduced a trap composed of 136 places in 262 ms of which 4 ms to minimize.
[2024-06-01 17:00:21] [INFO ] Deduced a trap composed of 140 places in 255 ms of which 4 ms to minimize.
[2024-06-01 17:00:21] [INFO ] Deduced a trap composed of 136 places in 267 ms of which 3 ms to minimize.
[2024-06-01 17:00:21] [INFO ] Deduced a trap composed of 246 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:00:22] [INFO ] Deduced a trap composed of 188 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:00:22] [INFO ] Deduced a trap composed of 239 places in 252 ms of which 4 ms to minimize.
[2024-06-01 17:00:22] [INFO ] Deduced a trap composed of 242 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:00:22] [INFO ] Deduced a trap composed of 147 places in 253 ms of which 4 ms to minimize.
[2024-06-01 17:00:23] [INFO ] Deduced a trap composed of 210 places in 275 ms of which 4 ms to minimize.
[2024-06-01 17:00:23] [INFO ] Deduced a trap composed of 208 places in 281 ms of which 4 ms to minimize.
[2024-06-01 17:00:23] [INFO ] Deduced a trap composed of 202 places in 277 ms of which 4 ms to minimize.
[2024-06-01 17:00:24] [INFO ] Deduced a trap composed of 213 places in 291 ms of which 4 ms to minimize.
[2024-06-01 17:00:24] [INFO ] Deduced a trap composed of 212 places in 359 ms of which 5 ms to minimize.
[2024-06-01 17:00:24] [INFO ] Deduced a trap composed of 206 places in 266 ms of which 4 ms to minimize.
[2024-06-01 17:00:25] [INFO ] Deduced a trap composed of 203 places in 344 ms of which 3 ms to minimize.
[2024-06-01 17:00:26] [INFO ] Deduced a trap composed of 240 places in 278 ms of which 4 ms to minimize.
[2024-06-01 17:00:26] [INFO ] Deduced a trap composed of 242 places in 289 ms of which 4 ms to minimize.
[2024-06-01 17:00:26] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 62757ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76947 ms. Remains : 770/770 places, 1086/1086 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[136]
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-06 in 308699 ms.
[2024-06-01 17:00:39] [INFO ] Flatten gal took : 179 ms
[2024-06-01 17:00:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 17:00:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 770 places, 1086 transitions and 5509 arcs took 15 ms.
Total runtime 756524 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-S05J60-UpperBounds-06

BK_STOP 1717261239965

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name PolyORBNT-PT-S05J60-UpperBounds-06
ub formula formula --maxsum=/tmp/2892/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-S05J60"
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-S05J60, 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-171654447200469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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