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-171620399300357.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-q3m032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399300357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 02:28 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:23 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-q3m032-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717223461130

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-q3m032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:31:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:31:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:31:04] [INFO ] Load time of PNML (sax parser for PT used): 1176 ms
[2024-06-01 06:31:04] [INFO ] Transformed 754 places.
[2024-06-01 06:31:04] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:31:04] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1464 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 67 ms.
Deduced a syphon composed of 514 places in 92 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m032-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:31:04] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-06-01 06:31:04] [INFO ] Computed 10 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (14 resets) in 171 ms. (58 steps per ms)
BEST_FIRST walk for 50004 steps (14 resets) in 202 ms. (246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:31:05] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-06-01 06:31:05] [INFO ] Invariant cache hit.
[2024-06-01 06:31:05] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:31:06] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2024-06-01 06:31:06] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 06:31:06] [INFO ] [Real]Added 255 Read/Feed constraints in 74 ms returned sat
[2024-06-01 06:31:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:07] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-06-01 06:31:07] [INFO ] [Nat]Added 255 Read/Feed constraints in 103 ms returned sat
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 31 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 17 places in 571 ms of which 14 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1105 ms
[2024-06-01 06:31:08] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 233 ms.
[2024-06-01 06:31:08] [INFO ] Added : 5 causal constraints over 1 iterations in 607 ms. Result :sat
Minimization took 642 ms.
[2024-06-01 06:31:09] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:31:10] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2024-06-01 06:31:10] [INFO ] [Real]Added 255 Read/Feed constraints in 67 ms returned sat
[2024-06-01 06:31:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:10] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2024-06-01 06:31:10] [INFO ] [Nat]Added 255 Read/Feed constraints in 98 ms returned sat
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 0 ms to minimize.
[2024-06-01 06:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2024-06-01 06:31:11] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 271 ms.
[2024-06-01 06:31:11] [INFO ] Added : 11 causal constraints over 3 iterations in 792 ms. Result :sat
Minimization took 685 ms.
[2024-06-01 06:31:12] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:13] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-06-01 06:31:13] [INFO ] [Real]Added 255 Read/Feed constraints in 46 ms returned sat
[2024-06-01 06:31:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:13] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2024-06-01 06:31:13] [INFO ] [Nat]Added 255 Read/Feed constraints in 95 ms returned sat
[2024-06-01 06:31:13] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 213 ms.
[2024-06-01 06:31:14] [INFO ] Added : 7 causal constraints over 2 iterations in 640 ms. Result :sat
Minimization took 754 ms.
[2024-06-01 06:31:15] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:15] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2024-06-01 06:31:15] [INFO ] [Real]Added 255 Read/Feed constraints in 25 ms returned sat
[2024-06-01 06:31:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:16] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-06-01 06:31:16] [INFO ] [Nat]Added 255 Read/Feed constraints in 127 ms returned sat
[2024-06-01 06:31:16] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 2 ms to minimize.
[2024-06-01 06:31:16] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 2 ms to minimize.
[2024-06-01 06:31:16] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 1 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 1 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 9 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1705 ms
[2024-06-01 06:31:18] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 145 ms.
[2024-06-01 06:31:18] [INFO ] Added : 6 causal constraints over 2 iterations in 421 ms. Result :sat
Minimization took 661 ms.
[2024-06-01 06:31:19] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:19] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2024-06-01 06:31:19] [INFO ] [Real]Added 255 Read/Feed constraints in 37 ms returned sat
[2024-06-01 06:31:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:19] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-06-01 06:31:20] [INFO ] [Nat]Added 255 Read/Feed constraints in 38 ms returned sat
[2024-06-01 06:31:20] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 171 ms.
[2024-06-01 06:31:20] [INFO ] Added : 2 causal constraints over 1 iterations in 363 ms. Result :sat
Minimization took 811 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 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 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 510 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 229/240 places, 2747/2769 transitions.
[2024-06-01 06:31:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 5) seen :[1, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:31:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-06-01 06:31:22] [INFO ] Computed 8 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000010 steps (2 resets) in 1788 ms. (558 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 10757 ms. (464 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:31:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:31:35] [INFO ] Invariant cache hit.
[2024-06-01 06:31:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:35] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2024-06-01 06:31:35] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:31:36] [INFO ] [Real]Added 241 Read/Feed constraints in 165 ms returned sat
[2024-06-01 06:31:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:36] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-06-01 06:31:36] [INFO ] [Nat]Added 241 Read/Feed constraints in 189 ms returned sat
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 73 places in 267 ms of which 2 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 1 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 48 places in 270 ms of which 1 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 1 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 1 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 1 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 1 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2710 ms
[2024-06-01 06:31:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 146 ms.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 1 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2024-06-01 06:31:40] [INFO ] Added : 7 causal constraints over 2 iterations in 948 ms. Result :sat
Minimization took 1868 ms.
[2024-06-01 06:31:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:42] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2024-06-01 06:31:42] [INFO ] [Real]Added 241 Read/Feed constraints in 35 ms returned sat
[2024-06-01 06:31:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:31:43] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2024-06-01 06:31:43] [INFO ] [Nat]Added 241 Read/Feed constraints in 96 ms returned sat
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 8 places in 310 ms of which 2 ms to minimize.
[2024-06-01 06:31:44] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 1 ms to minimize.
[2024-06-01 06:31:44] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 1 ms to minimize.
[2024-06-01 06:31:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1018 ms
[2024-06-01 06:31:44] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 143 ms.
[2024-06-01 06:31:45] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2024-06-01 06:31:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-06-01 06:31:45] [INFO ] Added : 11 causal constraints over 3 iterations in 739 ms. Result :sat
Minimization took 1837 ms.
[2024-06-01 06:31:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-06-01 06:31:47] [INFO ] [Real]Added 241 Read/Feed constraints in 28 ms returned sat
[2024-06-01 06:31:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2024-06-01 06:31:48] [INFO ] [Nat]Added 241 Read/Feed constraints in 99 ms returned sat
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 1 ms to minimize.
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 2 ms to minimize.
[2024-06-01 06:31:49] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 1 ms to minimize.
[2024-06-01 06:31:49] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:31:49] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 1 ms to minimize.
[2024-06-01 06:31:49] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 1 ms to minimize.
[2024-06-01 06:31:50] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:31:50] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 1 ms to minimize.
[2024-06-01 06:31:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2477 ms
[2024-06-01 06:31:50] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2024-06-01 06:31:50] [INFO ] Added : 5 causal constraints over 1 iterations in 305 ms. Result :sat
Minimization took 1822 ms.
[2024-06-01 06:31:52] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:53] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2024-06-01 06:31:53] [INFO ] [Real]Added 241 Read/Feed constraints in 32 ms returned sat
[2024-06-01 06:31:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:53] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2024-06-01 06:31:53] [INFO ] [Nat]Added 241 Read/Feed constraints in 58 ms returned sat
[2024-06-01 06:31:54] [INFO ] Deduced a trap composed of 42 places in 375 ms of which 2 ms to minimize.
[2024-06-01 06:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 489 ms
[2024-06-01 06:31:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 155 ms.
[2024-06-01 06:31:54] [INFO ] Added : 3 causal constraints over 1 iterations in 352 ms. Result :sat
Minimization took 1832 ms.
[2024-06-01 06:31:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:57] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2024-06-01 06:31:57] [INFO ] [Real]Added 241 Read/Feed constraints in 28 ms returned sat
[2024-06-01 06:31:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:31:57] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-06-01 06:31:57] [INFO ] [Nat]Added 241 Read/Feed constraints in 47 ms returned sat
[2024-06-01 06:31:57] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2024-06-01 06:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2024-06-01 06:31:58] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 137 ms.
[2024-06-01 06:31:58] [INFO ] Added : 2 causal constraints over 1 iterations in 301 ms. Result :sat
Minimization took 1846 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 50 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 49 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-06-01 06:32:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:32:01] [INFO ] Invariant cache hit.
[2024-06-01 06:32:01] [INFO ] Implicit Places using invariants in 581 ms returned []
[2024-06-01 06:32:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:32:01] [INFO ] Invariant cache hit.
[2024-06-01 06:32:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:32:03] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
[2024-06-01 06:32:03] [INFO ] Redundant transitions in 222 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-06-01 06:32:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:32:03] [INFO ] Invariant cache hit.
[2024-06-01 06:32:03] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2024-06-01 06:32:50] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:32:53] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 4 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
[2024-06-01 06:32:53] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 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 TDEAD1575 is UNSAT
Problem TDEAD1576 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 TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 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 TDEAD1595 is UNSAT
Problem TDEAD1596 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 TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 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 TDEAD1615 is UNSAT
Problem TDEAD1616 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
[2024-06-01 06:32:54] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
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 TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
[2024-06-01 06:32:54] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
[2024-06-01 06:32:54] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
[2024-06-01 06:32:54] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
[2024-06-01 06:32:54] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
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
[2024-06-01 06:32:59] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
Problem TDEAD2683 is UNSAT
Problem TDEAD2695 is UNSAT
[2024-06-01 06:32:59] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 10/18 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 18 constraints, problems are : Problem set: 236 solved, 2510 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 236 solved, 2510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 7/7 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 10/17 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 2/19 constraints. Problems are: Problem set: 506 solved, 2240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/19 constraints. Problems are: Problem set: 506 solved, 2240 unsolved
At refinement iteration 4 (OVERLAPS) 8/229 variables, 1/20 constraints. Problems are: Problem set: 506 solved, 2240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 20 constraints, problems are : Problem set: 506 solved, 2240 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 12/12 constraints]
After SMT, in 92023ms problems are : Problem set: 506 solved, 2240 unsolved
Search for dead transitions found 506 dead transitions in 92114ms
Found 506 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 506 transitions
Dead transitions reduction (with SMT) removed 506 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2241/2747 transitions.
Graph (complete) has 2782 edges and 229 vertex of which 221 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 28 places and 650 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 193 transition count 1591
Reduce places removed 15 places and 271 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 44 place count 178 transition count 1320
Reduce places removed 9 places and 132 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 53 place count 169 transition count 1188
Reduce places removed 8 places and 89 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 61 place count 161 transition count 1099
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 62 place count 160 transition count 1082
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 74 place count 148 transition count 1022
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 16 places and 231 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 102 place count 132 transition count 791
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 110 place count 124 transition count 719
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 118 place count 124 transition count 719
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 118 rules in 77 ms. Remains 124 /229 variables (removed 105) and now considering 719/2241 (removed 1522) transitions.
[2024-06-01 06:33:35] [INFO ] Flow matrix only has 655 transitions (discarded 64 similar events)
// Phase 1: matrix 655 rows 124 cols
[2024-06-01 06:33:35] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 06:33:35] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 06:33:35] [INFO ] Flow matrix only has 655 transitions (discarded 64 similar events)
[2024-06-01 06:33:35] [INFO ] Invariant cache hit.
[2024-06-01 06:33:36] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 06:33:36] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 124/229 places, 719/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 95282 ms. Remains : 124/229 places, 719/2747 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m032-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:33:36] [INFO ] Flow matrix only has 655 transitions (discarded 64 similar events)
Found an invariant !
This invariant on transitions {7=1, 356=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {6=1, 356=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:33:36] [INFO ] Flow matrix only has 655 transitions (discarded 64 similar events)
// Phase 1: matrix 655 rows 121 cols
[2024-06-01 06:33:36] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000010 steps (2 resets) in 918 ms. (1088 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1911 ms. (1046 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:33:39] [INFO ] Flow matrix only has 655 transitions (discarded 64 similar events)
[2024-06-01 06:33:39] [INFO ] Invariant cache hit.
[2024-06-01 06:33:39] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:33:39] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-06-01 06:33:39] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 06:33:39] [INFO ] [Real]Added 85 Read/Feed constraints in 28 ms returned sat
[2024-06-01 06:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:33:39] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-01 06:33:39] [INFO ] [Nat]Added 85 Read/Feed constraints in 17 ms returned sat
[2024-06-01 06:33:39] [INFO ] Computed and/alt/rep : 172/524/171 causal constraints (skipped 483 transitions) in 36 ms.
[2024-06-01 06:33:40] [INFO ] Added : 4 causal constraints over 2 iterations in 99 ms. Result :sat
Minimization took 220 ms.
[2024-06-01 06:33:40] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:33:40] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-01 06:33:40] [INFO ] [Real]Added 85 Read/Feed constraints in 9 ms returned sat
[2024-06-01 06:33:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:33:40] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-06-01 06:33:40] [INFO ] [Nat]Added 85 Read/Feed constraints in 11 ms returned sat
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:33:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2024-06-01 06:33:40] [INFO ] Computed and/alt/rep : 172/524/171 causal constraints (skipped 483 transitions) in 31 ms.
[2024-06-01 06:33:40] [INFO ] Added : 3 causal constraints over 1 iterations in 77 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 719/719 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 121/121 places, 719/719 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 719/719 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2024-06-01 06:33:41] [INFO ] Flow matrix only has 655 transitions (discarded 64 similar events)
[2024-06-01 06:33:41] [INFO ] Invariant cache hit.
[2024-06-01 06:33:41] [INFO ] Implicit Places using invariants in 791 ms returned []
[2024-06-01 06:33:41] [INFO ] Flow matrix only has 655 transitions (discarded 64 similar events)
[2024-06-01 06:33:41] [INFO ] Invariant cache hit.
[2024-06-01 06:33:42] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 06:33:42] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
[2024-06-01 06:33:42] [INFO ] Redundant transitions in 15 ms returned []
Running 718 sub problems to find dead transitions.
[2024-06-01 06:33:42] [INFO ] Flow matrix only has 655 transitions (discarded 64 similar events)
[2024-06-01 06:33:42] [INFO ] Invariant cache hit.
[2024-06-01 06:33:42] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 718 unsolved
[2024-06-01 06:33:46] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 714 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 714 unsolved
Problem TDEAD404 is UNSAT
At refinement iteration 3 (OVERLAPS) 655/776 variables, 121/129 constraints. Problems are: Problem set: 5 solved, 713 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/776 variables, 85/214 constraints. Problems are: Problem set: 5 solved, 713 unsolved
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 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 TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/776 variables, 1/215 constraints. Problems are: Problem set: 65 solved, 653 unsolved
[2024-06-01 06:34:00] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 1/216 constraints. Problems are: Problem set: 95 solved, 623 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 0/216 constraints. Problems are: Problem set: 95 solved, 623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/776 variables, and 216 constraints, problems are : Problem set: 95 solved, 623 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 95 solved, 623 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 6/6 constraints. Problems are: Problem set: 95 solved, 623 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/9 constraints. Problems are: Problem set: 95 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/9 constraints. Problems are: Problem set: 95 solved, 623 unsolved
At refinement iteration 3 (OVERLAPS) 3/121 variables, 1/10 constraints. Problems are: Problem set: 95 solved, 623 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 95 solved, 623 unsolved
At refinement iteration 5 (OVERLAPS) 655/776 variables, 121/131 constraints. Problems are: Problem set: 95 solved, 623 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/776 variables, 85/216 constraints. Problems are: Problem set: 95 solved, 623 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD711 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 623/839 constraints. Problems are: Problem set: 124 solved, 594 unsolved
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 11 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 06:34:37] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 06:34:38] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 15 ms to minimize.
Problem TDEAD106 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 6/845 constraints. Problems are: Problem set: 125 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/776 variables, and 845 constraints, problems are : Problem set: 125 solved, 593 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 623/718 constraints, Known Traps: 9/9 constraints]
After SMT, in 61885ms problems are : Problem set: 125 solved, 593 unsolved
Search for dead transitions found 125 dead transitions in 61892ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 121/121 places, 594/719 transitions.
Graph (complete) has 861 edges and 121 vertex of which 118 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 13 places and 179 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 105 transition count 415
Reduce places removed 8 places and 73 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 97 transition count 342
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 93 transition count 313
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 91 transition count 297
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 90 transition count 288
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 35 place count 84 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 41 place count 84 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 41 rules in 11 ms. Remains 84 /121 variables (removed 37) and now considering 242/594 (removed 352) transitions.
[2024-06-01 06:34:44] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 84 cols
[2024-06-01 06:34:44] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 06:34:44] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 06:34:44] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:34:44] [INFO ] Invariant cache hit.
[2024-06-01 06:34:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:34:45] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/121 places, 242/719 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63899 ms. Remains : 84/121 places, 242/719 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m032-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:34:45] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {4=1, 154=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 154=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:34:45] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 83 cols
[2024-06-01 06:34:45] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000006 steps (2 resets) in 544 ms. (1834 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 498 ms. (2004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:34:46] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:34:46] [INFO ] Invariant cache hit.
[2024-06-01 06:34:46] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:34:46] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:34:46] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 06:34:46] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:34:46] [INFO ] [Real]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-06-01 06:34:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:34:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:34:46] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:34:46] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 06:34:46] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 265 ms
[2024-06-01 06:34:46] [INFO ] Computed and/alt/rep : 187/1011/187 causal constraints (skipped 37 transitions) in 12 ms.
[2024-06-01 06:34:46] [INFO ] Added : 55 causal constraints over 11 iterations in 183 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 83/83 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 06:34:47] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:34:47] [INFO ] Invariant cache hit.
[2024-06-01 06:34:47] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 06:34:47] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:34:47] [INFO ] Invariant cache hit.
[2024-06-01 06:34:47] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:34:47] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-01 06:34:47] [INFO ] Redundant transitions in 6 ms returned []
Running 241 sub problems to find dead transitions.
[2024-06-01 06:34:47] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:34:47] [INFO ] Invariant cache hit.
[2024-06-01 06:34:47] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 3 (OVERLAPS) 225/308 variables, 83/91 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 48/139 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/139 constraints. Problems are: Problem set: 2 solved, 239 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/139 constraints. Problems are: Problem set: 2 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 139 constraints, problems are : Problem set: 2 solved, 239 unsolved in 4119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 225/308 variables, 83/91 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 48/139 constraints. Problems are: Problem set: 2 solved, 239 unsolved
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 239/378 constraints. Problems are: Problem set: 4 solved, 237 unsolved
[2024-06-01 06:34:53] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 1/379 constraints. Problems are: Problem set: 4 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/379 constraints. Problems are: Problem set: 4 solved, 237 unsolved
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/308 variables, 1/380 constraints. Problems are: Problem set: 4 solved, 237 unsolved
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
Problem TDEAD118 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/381 constraints. Problems are: Problem set: 5 solved, 236 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/381 constraints. Problems are: Problem set: 5 solved, 236 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/381 constraints. Problems are: Problem set: 5 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 381 constraints, problems are : Problem set: 5 solved, 236 unsolved in 14688 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 239/241 constraints, Known Traps: 3/3 constraints]
After SMT, in 19046ms problems are : Problem set: 5 solved, 236 unsolved
Search for dead transitions found 5 dead transitions in 19048ms
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 : 83/83 places, 237/242 transitions.
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 231
Applied a total of 1 rules in 12 ms. Remains 82 /83 variables (removed 1) and now considering 231/237 (removed 6) transitions.
[2024-06-01 06:35:06] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
// Phase 1: matrix 215 rows 82 cols
[2024-06-01 06:35:06] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 06:35:06] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 06:35:06] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:35:06] [INFO ] Invariant cache hit.
[2024-06-01 06:35:06] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:35:06] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/83 places, 231/242 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19629 ms. Remains : 82/83 places, 231/242 transitions.
[2024-06-01 06:35:06] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {1=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 144=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:35:06] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:35:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000021 steps (2 resets) in 726 ms. (1375 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 685 ms. (1457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:35:08] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:35:08] [INFO ] Invariant cache hit.
[2024-06-01 06:35:08] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:08] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:35:08] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 06:35:08] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:35:08] [INFO ] [Real]Added 47 Read/Feed constraints in 9 ms returned sat
[2024-06-01 06:35:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:08] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:35:08] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-01 06:35:08] [INFO ] [Nat]Added 47 Read/Feed constraints in 12 ms returned sat
[2024-06-01 06:35:08] [INFO ] Computed and/alt/rep : 178/955/178 causal constraints (skipped 36 transitions) in 22 ms.
[2024-06-01 06:35:08] [INFO ] Added : 58 causal constraints over 12 iterations in 293 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-06-01 06:35:08] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:35:08] [INFO ] Invariant cache hit.
[2024-06-01 06:35:09] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 06:35:09] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:35:09] [INFO ] Invariant cache hit.
[2024-06-01 06:35:09] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:35:09] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-01 06:35:09] [INFO ] Redundant transitions in 0 ms returned []
Running 230 sub problems to find dead transitions.
[2024-06-01 06:35:09] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:35:09] [INFO ] Invariant cache hit.
[2024-06-01 06:35:09] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 3 (OVERLAPS) 215/297 variables, 82/90 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 47/137 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/137 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 1/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-06-01 06:35:13] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 139 constraints, problems are : Problem set: 12 solved, 218 unsolved in 6765 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 12 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 2/10 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 215/297 variables, 82/92 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 47/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 218/357 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/357 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/297 variables, 0/357 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 357 constraints, problems are : Problem set: 12 solved, 218 unsolved in 6488 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 218/230 constraints, Known Traps: 2/2 constraints]
After SMT, in 13451ms problems are : Problem set: 12 solved, 218 unsolved
Search for dead transitions found 12 dead transitions in 13454ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 219/231 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:35:22] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13814 ms. Remains : 82/82 places, 219/231 transitions.
[2024-06-01 06:35:22] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:35:22] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-06-01 06:35:22] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 559 ms. (1785 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 565 ms. (1766 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:35:23] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:23] [INFO ] Invariant cache hit.
[2024-06-01 06:35:23] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:23] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:35:24] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-01 06:35:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:35:24] [INFO ] [Real]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-06-01 06:35:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-01 06:35:24] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:35:24] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 06:35:24] [INFO ] [Nat]Added 45 Read/Feed constraints in 5 ms returned sat
[2024-06-01 06:35:24] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 10 ms.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2024-06-01 06:35:24] [INFO ] Added : 84 causal constraints over 17 iterations in 393 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:35:24] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:24] [INFO ] Invariant cache hit.
[2024-06-01 06:35:24] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 06:35:24] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:24] [INFO ] Invariant cache hit.
[2024-06-01 06:35:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:35:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-06-01 06:35:24] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:35:24] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:24] [INFO ] Invariant cache hit.
[2024-06-01 06:35:24] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 3794 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6937 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 10916ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 10920ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11205 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:35:35] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40049 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1349596 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :0 out of 1
Probabilistic random walk after 1349596 steps, saw 764105 distinct states, run finished after 3005 ms. (steps per millisecond=449 ) properties seen :0
[2024-06-01 06:35:39] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:39] [INFO ] Invariant cache hit.
[2024-06-01 06:35:39] [INFO ] State equation strengthened by 45 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) 97/104 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/105 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 87/192 variables, 33/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/260 variables, 24/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/261 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/261 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/261 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 12/273 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/273 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 11/284 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/284 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/284 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/284 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/285 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/285 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 97/104 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/105 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/192 variables, 33/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/260 variables, 24/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/261 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/261 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/261 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 12/273 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/273 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 11/284 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/284 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/284 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/284 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/285 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/285 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/285 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/285 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
RANDOM walk for 40060 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1367567 steps, run timeout after 3001 ms. (steps per millisecond=455 ) properties seen :0 out of 1
Probabilistic random walk after 1367567 steps, saw 769943 distinct states, run finished after 3001 ms. (steps per millisecond=455 ) properties seen :0
[2024-06-01 06:35:42] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:42] [INFO ] Invariant cache hit.
[2024-06-01 06:35:42] [INFO ] State equation strengthened by 45 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) 97/104 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/105 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 87/192 variables, 33/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/260 variables, 24/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/261 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/261 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/261 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 12/273 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/273 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 11/284 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/284 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/284 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/284 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/285 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/285 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 97/104 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/105 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/192 variables, 33/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/260 variables, 24/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/261 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/261 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/261 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 12/273 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/273 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 11/284 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/284 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/284 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/284 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/285 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/285 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/285 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/285 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 317ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:35:43] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:43] [INFO ] Invariant cache hit.
[2024-06-01 06:35:43] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 06:35:43] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:43] [INFO ] Invariant cache hit.
[2024-06-01 06:35:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:35:43] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-01 06:35:43] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:35:43] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:43] [INFO ] Invariant cache hit.
[2024-06-01 06:35:43] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 3688 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6538 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 10510ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 10519ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10764 ms. Remains : 82/82 places, 219/219 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 331 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 80 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 80 transition count 201
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 79 transition count 201
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 31 place count 68 transition count 157
Iterating global reduction 1 with 11 rules applied. Total rules applied 42 place count 68 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 68 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 67 transition count 155
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 66 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 65 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 63 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 61 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 57 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 71 place count 53 transition count 152
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 75 place count 53 transition count 148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 79 place count 49 transition count 148
Applied a total of 79 rules in 27 ms. Remains 49 /82 variables (removed 33) and now considering 148/219 (removed 71) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 148 rows 49 cols
[2024-06-01 06:35:53] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 06:35:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 06:35:53] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:35:53] [INFO ] After 73ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-01 06:35:54] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 197 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[16, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-01
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:35:54] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-06-01 06:35:54] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 06:35:54] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:54] [INFO ] Invariant cache hit.
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 06:35:54] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:35:54] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:35:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-06-01 06:35:54] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:35:54] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 15 ms.
[2024-06-01 06:35:54] [INFO ] Added : 92 causal constraints over 19 iterations in 250 ms. Result :sat
Minimization took 55 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 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:35:54] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 10 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 06:35:54] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 510 ms. (1956 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:35:55] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:55] [INFO ] Invariant cache hit.
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:35:55] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 06:35:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:35:56] [INFO ] [Real]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-06-01 06:35:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-06-01 06:35:56] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-01 06:35:56] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 12 ms.
[2024-06-01 06:35:56] [INFO ] Added : 92 causal constraints over 19 iterations in 227 ms. Result :sat
Minimization took 61 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 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-06-01 06:35:56] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:56] [INFO ] Invariant cache hit.
[2024-06-01 06:35:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 06:35:56] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:56] [INFO ] Invariant cache hit.
[2024-06-01 06:35:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:35:56] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-06-01 06:35:56] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:35:56] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:35:56] [INFO ] Invariant cache hit.
[2024-06-01 06:35:56] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 3825 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6956 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 10930ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 10932ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11150 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:36:07] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=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 :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 31113 steps (6 resets) in 31 ms. (972 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-q3m032-UpperBounds-01 in 13751 ms.
[2024-06-01 06:36:08] [INFO ] Flatten gal took : 138 ms
[2024-06-01 06:36:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 06:36:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 219 transitions and 1042 arcs took 4 ms.
Total runtime 305506 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-q3m032-UpperBounds-01

BK_STOP 1717223768604

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

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

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