Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399500421.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q8m032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717224415695

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:46:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:46:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:46:58] [INFO ] Load time of PNML (sax parser for PT used): 852 ms
[2024-06-01 06:46:58] [INFO ] Transformed 754 places.
[2024-06-01 06:46:58] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:46:58] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1089 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 57 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 474 places in 120 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:46:58] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-06-01 06:46:58] [INFO ] Computed 10 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1]
RANDOM walk for 10000 steps (29 resets) in 114 ms. (86 steps per ms)
FORMULA BugTracking-PT-q8m032-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (15 resets) in 217 ms. (229 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 10, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1]
[2024-06-01 06:46:59] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-06-01 06:46:59] [INFO ] Invariant cache hit.
[2024-06-01 06:46:59] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-01 06:47:00] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2024-06-01 06:47:00] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 06:47:00] [INFO ] [Real]Added 303 Read/Feed constraints in 100 ms returned sat
[2024-06-01 06:47:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:47:01] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-06-01 06:47:01] [INFO ] [Nat]Added 303 Read/Feed constraints in 107 ms returned sat
[2024-06-01 06:47:01] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 408 ms.
[2024-06-01 06:47:02] [INFO ] Added : 2 causal constraints over 1 iterations in 806 ms. Result :sat
Minimization took 1367 ms.
[2024-06-01 06:47:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:47:04] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2024-06-01 06:47:04] [INFO ] [Real]Added 303 Read/Feed constraints in 114 ms returned sat
[2024-06-01 06:47:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:47:05] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2024-06-01 06:47:05] [INFO ] [Nat]Added 303 Read/Feed constraints in 130 ms returned sat
[2024-06-01 06:47:05] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 11 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Deduced a trap composed of 14 places in 573 ms of which 2 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1092 ms
[2024-06-01 06:47:06] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 608 ms.
[2024-06-01 06:47:07] [INFO ] Added : 10 causal constraints over 2 iterations in 1218 ms. Result :sat
Minimization took 1361 ms.
[2024-06-01 06:47:09] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:47:09] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2024-06-01 06:47:09] [INFO ] [Real]Added 303 Read/Feed constraints in 97 ms returned sat
[2024-06-01 06:47:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:47:10] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2024-06-01 06:47:10] [INFO ] [Nat]Added 303 Read/Feed constraints in 347 ms returned sat
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 38 places in 508 ms of which 2 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 935 ms
[2024-06-01 06:47:12] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 306 ms.
[2024-06-01 06:47:13] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 2 ms to minimize.
[2024-06-01 06:47:14] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2024-06-01 06:47:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 879 ms
[2024-06-01 06:47:14] [INFO ] Added : 22 causal constraints over 5 iterations in 2656 ms. Result :sat
Minimization took 317 ms.
[2024-06-01 06:47:14] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:47:15] [INFO ] [Real]Absence check using state equation in 724 ms returned sat
[2024-06-01 06:47:15] [INFO ] [Real]Added 303 Read/Feed constraints in 95 ms returned sat
[2024-06-01 06:47:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:47:16] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2024-06-01 06:47:16] [INFO ] [Nat]Added 303 Read/Feed constraints in 68 ms returned sat
[2024-06-01 06:47:17] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 302 ms.
[2024-06-01 06:47:17] [INFO ] Added : 2 causal constraints over 1 iterations in 697 ms. Result :sat
Minimization took 1267 ms.
[2024-06-01 06:47:18] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:47:19] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2024-06-01 06:47:19] [INFO ] [Real]Added 303 Read/Feed constraints in 109 ms returned sat
[2024-06-01 06:47:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:47:20] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2024-06-01 06:47:20] [INFO ] [Nat]Added 303 Read/Feed constraints in 277 ms returned sat
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 1 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
[2024-06-01 06:47:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 192 ms.
[2024-06-01 06:47:22] [INFO ] Deduced a trap composed of 57 places in 456 ms of which 3 ms to minimize.
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 44 places in 348 ms of which 3 ms to minimize.
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 66 places in 364 ms of which 3 ms to minimize.
[2024-06-01 06:47:24] [INFO ] Deduced a trap composed of 125 places in 475 ms of which 2 ms to minimize.
[2024-06-01 06:47:24] [INFO ] Deduced a trap composed of 86 places in 450 ms of which 2 ms to minimize.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 10, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 10, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 649 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 680 ms. Remains : 269/280 places, 3871/3904 transitions.
[2024-06-01 06:47:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 13 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 5) seen :[0, 2147483647, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, +inf, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1]
[2024-06-01 06:47:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-06-01 06:47:27] [INFO ] Computed 8 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, +inf, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1]
RANDOM walk for 1000011 steps (2 resets) in 1679 ms. (595 steps per ms)
FORMULA BugTracking-PT-q8m032-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4000003 steps (8 resets) in 7772 ms. (514 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1]
[2024-06-01 06:47:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:47:36] [INFO ] Invariant cache hit.
[2024-06-01 06:47:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:47:37] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2024-06-01 06:47:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:47:38] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2024-06-01 06:47:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:47:38] [INFO ] [Nat]Added 283 Read/Feed constraints in 184 ms returned sat
[2024-06-01 06:47:38] [INFO ] Deduced a trap composed of 14 places in 473 ms of which 2 ms to minimize.
[2024-06-01 06:47:39] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 1 ms to minimize.
[2024-06-01 06:47:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1120 ms
[2024-06-01 06:47:39] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 229 ms.
[2024-06-01 06:47:40] [INFO ] Added : 2 causal constraints over 1 iterations in 585 ms. Result :sat
Minimization took 3907 ms.
[2024-06-01 06:47:44] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-01 06:47:44] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2024-06-01 06:47:45] [INFO ] [Real]Added 283 Read/Feed constraints in 129 ms returned sat
[2024-06-01 06:47:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:47:45] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2024-06-01 06:47:46] [INFO ] [Nat]Added 283 Read/Feed constraints in 271 ms returned sat
[2024-06-01 06:47:46] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 2 ms to minimize.
[2024-06-01 06:47:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2024-06-01 06:47:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 315 ms.
[2024-06-01 06:47:47] [INFO ] Added : 10 causal constraints over 3 iterations in 1207 ms. Result :sat
Minimization took 4911 ms.
[2024-06-01 06:47:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:47:53] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-06-01 06:47:53] [INFO ] [Real]Added 283 Read/Feed constraints in 86 ms returned sat
[2024-06-01 06:47:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:47:54] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2024-06-01 06:47:54] [INFO ] [Nat]Added 283 Read/Feed constraints in 126 ms returned sat
[2024-06-01 06:47:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 258 ms.
[2024-06-01 06:47:55] [INFO ] Added : 2 causal constraints over 1 iterations in 631 ms. Result :sat
Minimization took 3645 ms.
[2024-06-01 06:47:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:47:59] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-06-01 06:47:59] [INFO ] [Real]Added 283 Read/Feed constraints in 86 ms returned sat
[2024-06-01 06:47:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:47:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:48:00] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2024-06-01 06:48:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 174 ms returned sat
[2024-06-01 06:48:01] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 1 ms to minimize.
[2024-06-01 06:48:01] [INFO ] Deduced a trap composed of 57 places in 328 ms of which 1 ms to minimize.
[2024-06-01 06:48:02] [INFO ] Deduced a trap composed of 55 places in 326 ms of which 2 ms to minimize.
[2024-06-01 06:48:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1362 ms
[2024-06-01 06:48:02] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 259 ms.
[2024-06-01 06:48:02] [INFO ] Added : 10 causal constraints over 3 iterations in 764 ms. Result :sat
Minimization took 4660 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 129 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 269/269 places, 3871/3871 transitions.
[2024-06-01 06:48:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1]
[2024-06-01 06:48:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:48:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1]
RANDOM walk for 1000004 steps (2 resets) in 1430 ms. (698 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 6866 ms. (582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1]
[2024-06-01 06:48:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:48:17] [INFO ] Invariant cache hit.
[2024-06-01 06:48:17] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:48:18] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2024-06-01 06:48:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:48:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:48:18] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-06-01 06:48:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:48:19] [INFO ] [Nat]Added 283 Read/Feed constraints in 180 ms returned sat
[2024-06-01 06:48:19] [INFO ] Deduced a trap composed of 17 places in 434 ms of which 2 ms to minimize.
[2024-06-01 06:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 614 ms
[2024-06-01 06:48:20] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 311 ms.
[2024-06-01 06:48:20] [INFO ] Added : 4 causal constraints over 1 iterations in 758 ms. Result :sat
Minimization took 4503 ms.
[2024-06-01 06:48:25] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:48:25] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2024-06-01 06:48:25] [INFO ] [Real]Added 283 Read/Feed constraints in 151 ms returned sat
[2024-06-01 06:48:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:48:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:48:26] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2024-06-01 06:48:26] [INFO ] [Nat]Added 283 Read/Feed constraints in 244 ms returned sat
[2024-06-01 06:48:27] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 1 ms to minimize.
[2024-06-01 06:48:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2024-06-01 06:48:27] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 291 ms.
[2024-06-01 06:48:28] [INFO ] Added : 10 causal constraints over 3 iterations in 1140 ms. Result :sat
Minimization took 4303 ms.
[2024-06-01 06:48:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:48:33] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2024-06-01 06:48:33] [INFO ] [Real]Added 283 Read/Feed constraints in 70 ms returned sat
[2024-06-01 06:48:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:48:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:48:34] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2024-06-01 06:48:34] [INFO ] [Nat]Added 283 Read/Feed constraints in 95 ms returned sat
[2024-06-01 06:48:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 270 ms.
[2024-06-01 06:48:35] [INFO ] Added : 2 causal constraints over 1 iterations in 655 ms. Result :sat
Minimization took 4175 ms.
[2024-06-01 06:48:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:48:40] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2024-06-01 06:48:40] [INFO ] [Real]Added 283 Read/Feed constraints in 126 ms returned sat
[2024-06-01 06:48:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:48:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:48:41] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2024-06-01 06:48:41] [INFO ] [Nat]Added 283 Read/Feed constraints in 184 ms returned sat
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 2 ms to minimize.
[2024-06-01 06:48:42] [INFO ] Deduced a trap composed of 57 places in 286 ms of which 1 ms to minimize.
[2024-06-01 06:48:42] [INFO ] Deduced a trap composed of 55 places in 310 ms of which 2 ms to minimize.
[2024-06-01 06:48:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1300 ms
[2024-06-01 06:48:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 318 ms.
[2024-06-01 06:48:43] [INFO ] Added : 10 causal constraints over 3 iterations in 1106 ms. Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 105 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 106 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-06-01 06:48:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:48:48] [INFO ] Invariant cache hit.
[2024-06-01 06:48:49] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-06-01 06:48:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:48:49] [INFO ] Invariant cache hit.
[2024-06-01 06:48:49] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 06:48:51] [INFO ] Implicit Places using invariants and state equation in 2314 ms returned []
Implicit Place search using SMT with State Equation took 2901 ms to find 0 implicit places.
[2024-06-01 06:48:51] [INFO ] Redundant transitions in 332 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-06-01 06:48:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-06-01 06:48:51] [INFO ] Invariant cache hit.
[2024-06-01 06:48:51] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2024-06-01 06:50:24] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-06-01 06:50:24] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 14 ms to minimize.
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2933 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2935 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2937 is UNSAT
Problem TDEAD2938 is UNSAT
Problem TDEAD2939 is UNSAT
Problem TDEAD2940 is UNSAT
Problem TDEAD2941 is UNSAT
Problem TDEAD2942 is UNSAT
Problem TDEAD2943 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2945 is UNSAT
Problem TDEAD2946 is UNSAT
Problem TDEAD2947 is UNSAT
Problem TDEAD2948 is UNSAT
Problem TDEAD2949 is UNSAT
Problem TDEAD2950 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2953 is UNSAT
Problem TDEAD2954 is UNSAT
Problem TDEAD2955 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD2957 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD2960 is UNSAT
Problem TDEAD2961 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2963 is UNSAT
Problem TDEAD2964 is UNSAT
Problem TDEAD2965 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2967 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD2969 is UNSAT
Problem TDEAD2970 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD2973 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3066 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
Problem TDEAD3803 is UNSAT
Problem TDEAD3815 is UNSAT
Problem TDEAD3830 is UNSAT
Problem TDEAD3831 is UNSAT
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
Problem TDEAD3842 is UNSAT
Problem TDEAD3843 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3868 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 8/16 constraints. Problems are: Problem set: 936 solved, 2934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 16 constraints, problems are : Problem set: 936 solved, 2934 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 8/8 constraints]
After SMT, in 108937ms problems are : Problem set: 936 solved, 2934 unsolved
Search for dead transitions found 936 dead transitions in 109040ms
Found 936 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 936 transitions
Dead transitions reduction (with SMT) removed 936 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 2935/3871 transitions.
Reduce places removed 34 places and 960 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 235 transition count 1975
Reduce places removed 24 places and 409 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 58 place count 211 transition count 1566
Reduce places removed 11 places and 147 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 69 place count 200 transition count 1419
Reduce places removed 9 places and 49 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 78 place count 191 transition count 1370
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 189 transition count 1318
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 188 transition count 1299
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 82 place count 187 transition count 1290
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 101 place count 168 transition count 1236
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 7 with 19 rules applied. Total rules applied 120 place count 168 transition count 1236
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 137 place count 151 transition count 1053
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 7 with 17 rules applied. Total rules applied 154 place count 151 transition count 1053
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 154 rules in 59 ms. Remains 151 /269 variables (removed 118) and now considering 1053/2935 (removed 1882) transitions.
[2024-06-01 06:50:40] [INFO ] Flow matrix only has 935 transitions (discarded 118 similar events)
// Phase 1: matrix 935 rows 151 cols
[2024-06-01 06:50:40] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 06:50:41] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 06:50:41] [INFO ] Flow matrix only has 935 transitions (discarded 118 similar events)
[2024-06-01 06:50:41] [INFO ] Invariant cache hit.
[2024-06-01 06:50:41] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-01 06:50:41] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 151/269 places, 1053/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 113373 ms. Remains : 151/269 places, 1053/3871 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m032-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:50:41] [INFO ] Flow matrix only has 935 transitions (discarded 118 similar events)
Found an invariant !
This invariant on transitions {4=1, 753=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 753=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :[1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1]
[2024-06-01 06:50:42] [INFO ] Flow matrix only has 935 transitions (discarded 118 similar events)
// Phase 1: matrix 935 rows 150 cols
[2024-06-01 06:50:42] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
RANDOM walk for 1000026 steps (2 resets) in 1026 ms. (973 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 2432 ms. (1233 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
[2024-06-01 06:50:45] [INFO ] Flow matrix only has 935 transitions (discarded 118 similar events)
[2024-06-01 06:50:45] [INFO ] Invariant cache hit.
[2024-06-01 06:50:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:50:45] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-06-01 06:50:45] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-01 06:50:45] [INFO ] [Real]Added 105 Read/Feed constraints in 33 ms returned sat
[2024-06-01 06:50:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:50:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:50:46] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-06-01 06:50:46] [INFO ] [Nat]Added 105 Read/Feed constraints in 50 ms returned sat
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 1 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 5 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 370 ms
[2024-06-01 06:50:46] [INFO ] Computed and/alt/rep : 367/1457/367 causal constraints (skipped 567 transitions) in 55 ms.
[2024-06-01 06:50:46] [INFO ] Added : 11 causal constraints over 3 iterations in 182 ms. Result :sat
Minimization took 391 ms.
[2024-06-01 06:50:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:50:47] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-06-01 06:50:47] [INFO ] [Real]Added 105 Read/Feed constraints in 18 ms returned sat
[2024-06-01 06:50:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:50:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 06:50:47] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-06-01 06:50:47] [INFO ] [Nat]Added 105 Read/Feed constraints in 44 ms returned sat
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:50:48] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 1 ms to minimize.
[2024-06-01 06:50:48] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 1 ms to minimize.
[2024-06-01 06:50:48] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 1 ms to minimize.
[2024-06-01 06:50:48] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
[2024-06-01 06:50:48] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 1 ms to minimize.
[2024-06-01 06:50:48] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-06-01 06:50:49] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 1 ms to minimize.
[2024-06-01 06:50:49] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 1 ms to minimize.
[2024-06-01 06:50:49] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:50:49] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:50:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1746 ms
[2024-06-01 06:50:49] [INFO ] Computed and/alt/rep : 367/1457/367 causal constraints (skipped 567 transitions) in 60 ms.
[2024-06-01 06:50:49] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 1 ms to minimize.
[2024-06-01 06:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2024-06-01 06:50:49] [INFO ] Added : 8 causal constraints over 2 iterations in 405 ms. Result :sat
Minimization took 364 ms.
[2024-06-01 06:50:50] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:50:50] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-06-01 06:50:50] [INFO ] [Real]Added 105 Read/Feed constraints in 21 ms returned sat
[2024-06-01 06:50:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:50:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:50:50] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-06-01 06:50:50] [INFO ] [Nat]Added 105 Read/Feed constraints in 40 ms returned sat
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:50:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-06-01 06:50:51] [INFO ] Computed and/alt/rep : 367/1457/367 causal constraints (skipped 567 transitions) in 66 ms.
[2024-06-01 06:50:51] [INFO ] Added : 23 causal constraints over 5 iterations in 340 ms. Result :sat
Minimization took 485 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1053/1053 transitions.
Applied a total of 0 rules in 16 ms. Remains 150 /150 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 150/150 places, 1053/1053 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 1053/1053 transitions.
Applied a total of 0 rules in 15 ms. Remains 150 /150 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
[2024-06-01 06:50:52] [INFO ] Flow matrix only has 935 transitions (discarded 118 similar events)
[2024-06-01 06:50:52] [INFO ] Invariant cache hit.
[2024-06-01 06:50:52] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 06:50:52] [INFO ] Flow matrix only has 935 transitions (discarded 118 similar events)
[2024-06-01 06:50:52] [INFO ] Invariant cache hit.
[2024-06-01 06:50:52] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-01 06:50:52] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2024-06-01 06:50:52] [INFO ] Redundant transitions in 43 ms returned []
Running 1052 sub problems to find dead transitions.
[2024-06-01 06:50:52] [INFO ] Flow matrix only has 935 transitions (discarded 118 similar events)
[2024-06-01 06:50:52] [INFO ] Invariant cache hit.
[2024-06-01 06:50:52] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1052 unsolved
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
[2024-06-01 06:51:01] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
Problem TDEAD815 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD810 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 4/12 constraints. Problems are: Problem set: 13 solved, 1039 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 13 solved, 1039 unsolved
At refinement iteration 3 (OVERLAPS) 935/1085 variables, 150/162 constraints. Problems are: Problem set: 13 solved, 1039 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1085 variables, 105/267 constraints. Problems are: Problem set: 13 solved, 1039 unsolved
[2024-06-01 06:51:17] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1085/1085 variables, and 268 constraints, problems are : Problem set: 132 solved, 920 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 1052/1052 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 132 solved, 920 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 8/8 constraints. Problems are: Problem set: 132 solved, 920 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 5/13 constraints. Problems are: Problem set: 132 solved, 920 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 132 solved, 920 unsolved
At refinement iteration 3 (OVERLAPS) 935/1085 variables, 150/163 constraints. Problems are: Problem set: 132 solved, 920 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1085 variables, 105/268 constraints. Problems are: Problem set: 132 solved, 920 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1045 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1085 variables, 920/1188 constraints. Problems are: Problem set: 257 solved, 795 unsolved
[2024-06-01 06:51:51] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1085/1085 variables, and 1190 constraints, problems are : Problem set: 257 solved, 795 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 150/150 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 920/1052 constraints, Known Traps: 7/7 constraints]
After SMT, in 63114ms problems are : Problem set: 257 solved, 795 unsolved
Search for dead transitions found 257 dead transitions in 63126ms
Found 257 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 257 transitions
Dead transitions reduction (with SMT) removed 257 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/150 places, 796/1053 transitions.
Graph (complete) has 1128 edges and 150 vertex of which 142 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 25 places and 320 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 117 transition count 476
Reduce places removed 7 places and 66 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 33 place count 110 transition count 410
Reduce places removed 3 places and 26 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 107 transition count 384
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 105 transition count 368
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 39 place count 104 transition count 363
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 43 place count 100 transition count 328
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 47 place count 100 transition count 328
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 47 rules in 46 ms. Remains 100 /150 variables (removed 50) and now considering 328/796 (removed 468) transitions.
[2024-06-01 06:51:56] [INFO ] Flow matrix only has 308 transitions (discarded 20 similar events)
// Phase 1: matrix 308 rows 100 cols
[2024-06-01 06:51:56] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 06:51:56] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 06:51:56] [INFO ] Flow matrix only has 308 transitions (discarded 20 similar events)
[2024-06-01 06:51:56] [INFO ] Invariant cache hit.
[2024-06-01 06:51:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-01 06:51:56] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 100/150 places, 328/1053 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64481 ms. Remains : 100/150 places, 328/1053 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m032-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:51:56] [INFO ] Flow matrix only has 308 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {2=1, 28=1, 234=1, 289=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 234=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
[2024-06-01 06:51:56] [INFO ] Flow matrix only has 308 transitions (discarded 20 similar events)
// Phase 1: matrix 308 rows 98 cols
[2024-06-01 06:51:56] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
RANDOM walk for 1000001 steps (2 resets) in 647 ms. (1543 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 637 ms. (1567 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
[2024-06-01 06:51:57] [INFO ] Flow matrix only has 308 transitions (discarded 20 similar events)
[2024-06-01 06:51:57] [INFO ] Invariant cache hit.
[2024-06-01 06:51:57] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:51:58] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-01 06:51:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-01 06:51:58] [INFO ] [Real]Added 61 Read/Feed constraints in 8 ms returned sat
[2024-06-01 06:51:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:51:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:51:58] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 06:51:58] [INFO ] [Nat]Added 61 Read/Feed constraints in 13 ms returned sat
[2024-06-01 06:51:58] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:51:58] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 16 ms to minimize.
[2024-06-01 06:51:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2024-06-01 06:51:58] [INFO ] Computed and/alt/rep : 211/1001/211 causal constraints (skipped 96 transitions) in 15 ms.
[2024-06-01 06:51:58] [INFO ] Added : 19 causal constraints over 5 iterations in 93 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 328/328 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 328/328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 328/328 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2024-06-01 06:51:58] [INFO ] Flow matrix only has 308 transitions (discarded 20 similar events)
[2024-06-01 06:51:58] [INFO ] Invariant cache hit.
[2024-06-01 06:51:58] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 06:51:58] [INFO ] Flow matrix only has 308 transitions (discarded 20 similar events)
[2024-06-01 06:51:58] [INFO ] Invariant cache hit.
[2024-06-01 06:51:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-01 06:51:58] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-01 06:51:58] [INFO ] Redundant transitions in 2 ms returned []
Running 327 sub problems to find dead transitions.
[2024-06-01 06:51:58] [INFO ] Flow matrix only has 308 transitions (discarded 20 similar events)
[2024-06-01 06:51:58] [INFO ] Invariant cache hit.
[2024-06-01 06:51:58] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
At refinement iteration 2 (OVERLAPS) 308/406 variables, 98/105 constraints. Problems are: Problem set: 3 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 61/166 constraints. Problems are: Problem set: 3 solved, 324 unsolved
[2024-06-01 06:52:02] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:52:02] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 2/168 constraints. Problems are: Problem set: 3 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/406 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 168 constraints, problems are : Problem set: 3 solved, 324 unsolved in 10140 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/9 constraints. Problems are: Problem set: 3 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 308/406 variables, 98/107 constraints. Problems are: Problem set: 3 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 61/168 constraints. Problems are: Problem set: 3 solved, 324 unsolved
Problem TDEAD156 is UNSAT
Problem TDEAD161 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 324/492 constraints. Problems are: Problem set: 5 solved, 322 unsolved
[2024-06-01 06:52:12] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:52:14] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 2/494 constraints. Problems are: Problem set: 5 solved, 322 unsolved
[2024-06-01 06:52:18] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:52:18] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 2/496 constraints. Problems are: Problem set: 5 solved, 322 unsolved
[2024-06-01 06:52:22] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 1/497 constraints. Problems are: Problem set: 5 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/497 constraints. Problems are: Problem set: 5 solved, 322 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/497 constraints. Problems are: Problem set: 5 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 497 constraints, problems are : Problem set: 5 solved, 322 unsolved in 27644 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 324/327 constraints, Known Traps: 7/7 constraints]
After SMT, in 38061ms problems are : Problem set: 5 solved, 322 unsolved
Search for dead transitions found 5 dead transitions in 38067ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 98/98 places, 323/328 transitions.
Reduce places removed 1 places and 10 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 313
Applied a total of 1 rules in 9 ms. Remains 97 /98 variables (removed 1) and now considering 313/323 (removed 10) transitions.
[2024-06-01 06:52:37] [INFO ] Flow matrix only has 294 transitions (discarded 19 similar events)
// Phase 1: matrix 294 rows 97 cols
[2024-06-01 06:52:37] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 06:52:37] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 06:52:37] [INFO ] Flow matrix only has 294 transitions (discarded 19 similar events)
[2024-06-01 06:52:37] [INFO ] Invariant cache hit.
[2024-06-01 06:52:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 06:52:37] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/98 places, 313/328 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38828 ms. Remains : 97/98 places, 313/328 transitions.
[2024-06-01 06:52:37] [INFO ] Flow matrix only has 294 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {4=1, 41=1, 220=1, 279=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {1=1, 220=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
[2024-06-01 06:52:37] [INFO ] Flow matrix only has 294 transitions (discarded 19 similar events)
[2024-06-01 06:52:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
RANDOM walk for 1000012 steps (2 resets) in 503 ms. (1984 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 586 ms. (1703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
[2024-06-01 06:52:38] [INFO ] Flow matrix only has 294 transitions (discarded 19 similar events)
[2024-06-01 06:52:38] [INFO ] Invariant cache hit.
[2024-06-01 06:52:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:52:38] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 06:52:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 06:52:38] [INFO ] [Real]Added 60 Read/Feed constraints in 9 ms returned sat
[2024-06-01 06:52:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:52:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:52:38] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 06:52:38] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2024-06-01 06:52:38] [INFO ] Computed and/alt/rep : 238/1311/238 causal constraints (skipped 55 transitions) in 20 ms.
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:52:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2024-06-01 06:52:39] [INFO ] Added : 70 causal constraints over 14 iterations in 442 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 313/313 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 313/313 transitions.
Applied a total of 0 rules in 8 ms. Remains 97 /97 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-01 06:52:39] [INFO ] Flow matrix only has 294 transitions (discarded 19 similar events)
[2024-06-01 06:52:39] [INFO ] Invariant cache hit.
[2024-06-01 06:52:39] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 06:52:39] [INFO ] Flow matrix only has 294 transitions (discarded 19 similar events)
[2024-06-01 06:52:39] [INFO ] Invariant cache hit.
[2024-06-01 06:52:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 06:52:39] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-01 06:52:39] [INFO ] Redundant transitions in 1 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-01 06:52:39] [INFO ] Flow matrix only has 294 transitions (discarded 19 similar events)
[2024-06-01 06:52:39] [INFO ] Invariant cache hit.
[2024-06-01 06:52:39] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 2 (OVERLAPS) 294/391 variables, 97/104 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 60/164 constraints. Problems are: Problem set: 36 solved, 276 unsolved
[2024-06-01 06:52:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:52:43] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 2/166 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/166 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/391 variables, 0/166 constraints. Problems are: Problem set: 36 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 166 constraints, problems are : Problem set: 36 solved, 276 unsolved in 7820 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 36 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/9 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 294/391 variables, 97/106 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 60/166 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 276/442 constraints. Problems are: Problem set: 36 solved, 276 unsolved
[2024-06-01 06:52:51] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 1/443 constraints. Problems are: Problem set: 36 solved, 276 unsolved
[2024-06-01 06:52:55] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/444 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/444 constraints. Problems are: Problem set: 36 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/444 constraints. Problems are: Problem set: 36 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 444 constraints, problems are : Problem set: 36 solved, 276 unsolved in 18536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 276/312 constraints, Known Traps: 4/4 constraints]
After SMT, in 26656ms problems are : Problem set: 36 solved, 276 unsolved
Search for dead transitions found 36 dead transitions in 26659ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/97 places, 277/313 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-06-01 06:53:06] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26960 ms. Remains : 97/97 places, 277/313 transitions.
[2024-06-01 06:53:06] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {0=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
[2024-06-01 06:53:06] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
// Phase 1: matrix 258 rows 97 cols
[2024-06-01 06:53:06] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
RANDOM walk for 1000014 steps (2 resets) in 524 ms. (1904 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 549 ms. (1818 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
[2024-06-01 06:53:07] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:07] [INFO ] Invariant cache hit.
[2024-06-01 06:53:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:53:07] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 06:53:07] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 06:53:07] [INFO ] [Real]Added 56 Read/Feed constraints in 9 ms returned sat
[2024-06-01 06:53:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:53:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:53:08] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 06:53:08] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2024-06-01 06:53:08] [INFO ] Computed and/alt/rep : 216/1060/216 causal constraints (skipped 41 transitions) in 18 ms.
[2024-06-01 06:53:08] [INFO ] Added : 49 causal constraints over 10 iterations in 155 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 97/97 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-06-01 06:53:08] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:08] [INFO ] Invariant cache hit.
[2024-06-01 06:53:08] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 06:53:08] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:08] [INFO ] Invariant cache hit.
[2024-06-01 06:53:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 06:53:08] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-06-01 06:53:08] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-01 06:53:08] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:08] [INFO ] Invariant cache hit.
[2024-06-01 06:53:08] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 258/355 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 56/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-01 06:53:11] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/355 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 161 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7771 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 258/355 variables, 97/105 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 56/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 276/437 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 0/355 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 438 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13699 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 2/2 constraints]
After SMT, in 21673ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 21677ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22039 ms. Remains : 97/97 places, 277/277 transitions.
[2024-06-01 06:53:30] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {0=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
[2024-06-01 06:53:30] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
RANDOM walk for 1000017 steps (2 resets) in 713 ms. (1400 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 587 ms. (1700 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
[2024-06-01 06:53:31] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:31] [INFO ] Invariant cache hit.
[2024-06-01 06:53:31] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:53:31] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 06:53:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 06:53:31] [INFO ] [Real]Added 56 Read/Feed constraints in 7 ms returned sat
[2024-06-01 06:53:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:53:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:53:32] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 06:53:32] [INFO ] [Nat]Added 56 Read/Feed constraints in 11 ms returned sat
[2024-06-01 06:53:32] [INFO ] Computed and/alt/rep : 216/1060/216 causal constraints (skipped 41 transitions) in 19 ms.
[2024-06-01 06:53:32] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-06-01 06:53:32] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:53:32] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:53:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 184 ms
[2024-06-01 06:53:32] [INFO ] Added : 53 causal constraints over 12 iterations in 371 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-06-01 06:53:32] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:32] [INFO ] Invariant cache hit.
[2024-06-01 06:53:32] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 06:53:32] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:32] [INFO ] Invariant cache hit.
[2024-06-01 06:53:32] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 06:53:32] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-01 06:53:32] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-01 06:53:32] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:32] [INFO ] Invariant cache hit.
[2024-06-01 06:53:32] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 258/355 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 56/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-01 06:53:35] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/355 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 161 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7658 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 258/355 variables, 97/105 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 56/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 276/437 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-01 06:53:43] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 0/355 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 438 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 2/2 constraints]
After SMT, in 21164ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 21166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21493 ms. Remains : 97/97 places, 277/277 transitions.
[2024-06-01 06:53:54] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {0=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
RANDOM walk for 40036 steps (8 resets) in 233 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1231797 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 1
Probabilistic random walk after 1231797 steps, saw 720391 distinct states, run finished after 3005 ms. (steps per millisecond=409 ) properties seen :0
[2024-06-01 06:53:57] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:57] [INFO ] Invariant cache hit.
[2024-06-01 06:53:57] [INFO ] State equation strengthened by 56 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/120 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/121 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/215 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 127/342 variables, 35/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 24/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/349 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/349 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/355 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/355 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/355 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 56/56 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) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/120 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/121 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/215 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 127/342 variables, 35/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 24/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/342 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/349 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/349 variables, 7/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/349 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/355 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:53:57] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/355 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/355 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/355 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 277/277 transitions.
RANDOM walk for 40097 steps (8 resets) in 42 ms. (932 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31115 steps (6 resets) in 95 ms. (324 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5, 0, 0, 0] Max Struct:[+inf, 1, 1, 1]
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-00
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 06:53:57] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 06:53:57] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:57] [INFO ] Invariant cache hit.
[2024-06-01 06:53:58] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:53:58] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-06-01 06:53:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 06:53:58] [INFO ] [Real]Added 56 Read/Feed constraints in 8 ms returned sat
[2024-06-01 06:53:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:53:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:53:58] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-01 06:53:58] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2024-06-01 06:53:58] [INFO ] Computed and/alt/rep : 216/1060/216 causal constraints (skipped 41 transitions) in 38 ms.
[2024-06-01 06:53:58] [INFO ] Added : 61 causal constraints over 13 iterations in 283 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 277/277 transitions.
[2024-06-01 06:53:58] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {0=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 06:53:58] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 570 ms. (1751 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 565 ms. (1766 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 06:53:59] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:53:59] [INFO ] Invariant cache hit.
[2024-06-01 06:53:59] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:53:59] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 06:53:59] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 06:54:00] [INFO ] [Real]Added 56 Read/Feed constraints in 8 ms returned sat
[2024-06-01 06:54:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:54:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:54:00] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 06:54:00] [INFO ] [Nat]Added 56 Read/Feed constraints in 11 ms returned sat
[2024-06-01 06:54:00] [INFO ] Computed and/alt/rep : 216/1060/216 causal constraints (skipped 41 transitions) in 17 ms.
[2024-06-01 06:54:00] [INFO ] Added : 65 causal constraints over 13 iterations in 231 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 97/97 places, 277/277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 277/277 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2024-06-01 06:54:00] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:54:00] [INFO ] Invariant cache hit.
[2024-06-01 06:54:00] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 06:54:00] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:54:00] [INFO ] Invariant cache hit.
[2024-06-01 06:54:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 06:54:00] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-01 06:54:00] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-01 06:54:00] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
[2024-06-01 06:54:00] [INFO ] Invariant cache hit.
[2024-06-01 06:54:00] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 258/355 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 56/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/355 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 161 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7361 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 258/355 variables, 97/105 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 56/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 276/437 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 0/355 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 438 constraints, problems are : Problem set: 0 solved, 276 unsolved in 14678 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 2/2 constraints]
After SMT, in 22309ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22616 ms. Remains : 97/97 places, 277/277 transitions.
[2024-06-01 06:54:23] [INFO ] Flow matrix only has 258 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {0=1, 184=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 184=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40044 steps (8 resets) in 35 ms. (1112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34548 steps (7 resets) in 40 ms. (842 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-00 in 25473 ms.
[2024-06-01 06:54:23] [INFO ] Flatten gal took : 126 ms
[2024-06-01 06:54:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 16 ms.
[2024-06-01 06:54:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 277 transitions and 1315 arcs took 5 ms.
Total runtime 446590 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 : BugTracking-PT-q8m032-UpperBounds-00

BK_STOP 1717224864196

--------------------
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 BugTracking-PT-q8m032-UpperBounds-00
ub formula formula --maxsum=/tmp/1122/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="BugTracking-PT-q8m032"
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 BugTracking-PT-q8m032, 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 r472-tajo-171620399500421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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