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

--------------------
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 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15: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-q3m064-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717223547498

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-q3m064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:32:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:32:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:32:29] [INFO ] Load time of PNML (sax parser for PT used): 878 ms
[2024-06-01 06:32:29] [INFO ] Transformed 754 places.
[2024-06-01 06:32:29] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:32:29] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1073 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
Deduced a syphon composed of 514 places in 104 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:32:30] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-06-01 06:32:30] [INFO ] Computed 10 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10052 steps (7 resets) in 85 ms. (116 steps per ms)
BEST_FIRST walk for 60006 steps (12 resets) in 220 ms. (271 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 328, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:32:30] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-06-01 06:32:30] [INFO ] Invariant cache hit.
[2024-06-01 06:32:30] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:32:31] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2024-06-01 06:32:31] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-06-01 06:32:31] [INFO ] [Real]Added 255 Read/Feed constraints in 46 ms returned sat
[2024-06-01 06:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:32:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:32:31] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2024-06-01 06:32:31] [INFO ] [Nat]Added 255 Read/Feed constraints in 42 ms returned sat
[2024-06-01 06:32:32] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 217 ms.
[2024-06-01 06:32:32] [INFO ] Added : 2 causal constraints over 1 iterations in 463 ms. Result :sat
Minimization took 740 ms.
[2024-06-01 06:32:33] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:32:33] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2024-06-01 06:32:33] [INFO ] [Real]Added 255 Read/Feed constraints in 50 ms returned sat
[2024-06-01 06:32:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:32:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:32:34] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-06-01 06:32:34] [INFO ] [Nat]Added 255 Read/Feed constraints in 44 ms returned sat
[2024-06-01 06:32:34] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 144 ms.
[2024-06-01 06:32:34] [INFO ] Added : 2 causal constraints over 1 iterations in 322 ms. Result :sat
Minimization took 769 ms.
[2024-06-01 06:32:35] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 06:32:35] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-06-01 06:32:35] [INFO ] [Real]Added 255 Read/Feed constraints in 64 ms returned sat
[2024-06-01 06:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:32:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:32:36] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2024-06-01 06:32:36] [INFO ] [Nat]Added 255 Read/Feed constraints in 46 ms returned sat
[2024-06-01 06:32:36] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 143 ms.
[2024-06-01 06:32:36] [INFO ] Added : 2 causal constraints over 1 iterations in 342 ms. Result :sat
Minimization took 668 ms.
[2024-06-01 06:32:37] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:32:37] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-06-01 06:32:37] [INFO ] [Real]Added 255 Read/Feed constraints in 39 ms returned sat
[2024-06-01 06:32:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:32:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:32:38] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2024-06-01 06:32:38] [INFO ] [Nat]Added 255 Read/Feed constraints in 41 ms returned sat
[2024-06-01 06:32:38] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 148 ms.
[2024-06-01 06:32:38] [INFO ] Added : 1 causal constraints over 1 iterations in 457 ms. Result :sat
Minimization took 672 ms.
[2024-06-01 06:32:39] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:32:40] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2024-06-01 06:32:40] [INFO ] [Real]Added 255 Read/Feed constraints in 58 ms returned sat
[2024-06-01 06:32:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:32:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 06:32:40] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2024-06-01 06:32:40] [INFO ] [Nat]Added 255 Read/Feed constraints in 141 ms returned sat
[2024-06-01 06:32:41] [INFO ] Deduced a trap composed of 20 places in 341 ms of which 17 ms to minimize.
[2024-06-01 06:32:41] [INFO ] Deduced a trap composed of 40 places in 363 ms of which 3 ms to minimize.
[2024-06-01 06:32:42] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 2 ms to minimize.
[2024-06-01 06:32:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1299 ms
[2024-06-01 06:32:42] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 237 ms.
[2024-06-01 06:32:42] [INFO ] Added : 5 causal constraints over 1 iterations in 552 ms. Result :sat
Minimization took 642 ms.
[2024-06-01 06:32:43] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-01 06:32:43] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-06-01 06:32:43] [INFO ] [Real]Added 255 Read/Feed constraints in 37 ms returned sat
[2024-06-01 06:32:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:32:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 06:32:44] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2024-06-01 06:32:44] [INFO ] [Nat]Added 255 Read/Feed constraints in 100 ms returned sat
[2024-06-01 06:32:45] [INFO ] Deduced a trap composed of 59 places in 374 ms of which 2 ms to minimize.
[2024-06-01 06:32:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 572 ms
[2024-06-01 06:32:45] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 208 ms.
[2024-06-01 06:32:45] [INFO ] Added : 4 causal constraints over 1 iterations in 531 ms. Result :sat
Minimization took 767 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 328, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 328, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 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 3 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 340 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 356 ms. Remains : 229/240 places, 2747/2769 transitions.
[2024-06-01 06:32:46] [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 1 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 192 ms. (steps per millisecond=52 ) properties (out of 6) seen :[0, 0, 0, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 2, +inf, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:32:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-06-01 06:32:47] [INFO ] Computed 8 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, +inf, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000022 steps (2 resets) in 1024 ms. (975 steps per ms)
FORMULA BugTracking-PT-q3m064-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 5000004 steps (10 resets) in 10735 ms. (465 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:32:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:32:59] [INFO ] Invariant cache hit.
[2024-06-01 06:32:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:32:59] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2024-06-01 06:32:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:33:00] [INFO ] [Real]Added 241 Read/Feed constraints in 29 ms returned sat
[2024-06-01 06:33:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:33:00] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-06-01 06:33:00] [INFO ] [Nat]Added 241 Read/Feed constraints in 83 ms returned sat
[2024-06-01 06:33:00] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 191 ms.
[2024-06-01 06:33:01] [INFO ] Deduced a trap composed of 61 places in 224 ms of which 1 ms to minimize.
[2024-06-01 06:33:01] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 1 ms to minimize.
[2024-06-01 06:33:01] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2024-06-01 06:33:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 748 ms
[2024-06-01 06:33:02] [INFO ] Added : 5 causal constraints over 3 iterations in 1496 ms. Result :sat
Minimization took 1846 ms.
[2024-06-01 06:33:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:33:04] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2024-06-01 06:33:04] [INFO ] [Real]Added 241 Read/Feed constraints in 33 ms returned sat
[2024-06-01 06:33:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:33:04] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-06-01 06:33:05] [INFO ] [Nat]Added 241 Read/Feed constraints in 48 ms returned sat
[2024-06-01 06:33:05] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 171 ms.
[2024-06-01 06:33:05] [INFO ] Added : 2 causal constraints over 1 iterations in 344 ms. Result :sat
Minimization took 1729 ms.
[2024-06-01 06:33:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:33:07] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-06-01 06:33:07] [INFO ] [Real]Added 241 Read/Feed constraints in 37 ms returned sat
[2024-06-01 06:33:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:33:07] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2024-06-01 06:33:08] [INFO ] [Nat]Added 241 Read/Feed constraints in 35 ms returned sat
[2024-06-01 06:33:08] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 170 ms.
[2024-06-01 06:33:08] [INFO ] Added : 2 causal constraints over 1 iterations in 363 ms. Result :sat
Minimization took 1883 ms.
[2024-06-01 06:33:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:33:10] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2024-06-01 06:33:10] [INFO ] [Real]Added 241 Read/Feed constraints in 26 ms returned sat
[2024-06-01 06:33:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:33:11] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2024-06-01 06:33:11] [INFO ] [Nat]Added 241 Read/Feed constraints in 64 ms returned sat
[2024-06-01 06:33:11] [INFO ] Deduced a trap composed of 41 places in 331 ms of which 11 ms to minimize.
[2024-06-01 06:33:11] [INFO ] Deduced a trap composed of 85 places in 315 ms of which 2 ms to minimize.
[2024-06-01 06:33:12] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 1 ms to minimize.
[2024-06-01 06:33:12] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2024-06-01 06:33:13] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:33:13] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2024-06-01 06:33:13] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 1 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 1 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 1 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 1 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 1 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 2 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 80 places in 219 ms of which 1 ms to minimize.
[2024-06-01 06:33:16] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 1 ms to minimize.
[2024-06-01 06:33:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5027 ms
[2024-06-01 06:33:16] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 173 ms.
[2024-06-01 06:33:16] [INFO ] Added : 4 causal constraints over 1 iterations in 441 ms. Result :sat
Minimization took 2159 ms.
[2024-06-01 06:33:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:33:19] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2024-06-01 06:33:19] [INFO ] [Real]Added 241 Read/Feed constraints in 57 ms returned sat
[2024-06-01 06:33:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:33:20] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2024-06-01 06:33:20] [INFO ] [Nat]Added 241 Read/Feed constraints in 107 ms returned sat
[2024-06-01 06:33:20] [INFO ] Deduced a trap composed of 67 places in 339 ms of which 1 ms to minimize.
[2024-06-01 06:33:20] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 1 ms to minimize.
[2024-06-01 06:33:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 733 ms
[2024-06-01 06:33:21] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 155 ms.
[2024-06-01 06:33:21] [INFO ] Added : 2 causal constraints over 1 iterations in 398 ms. Result :sat
Minimization took 1847 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 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 40 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 40 ms. Remains : 229/229 places, 2747/2747 transitions.
[2024-06-01 06:33:23] [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 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:33:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:33:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000048 steps (2 resets) in 909 ms. (1098 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 10768 ms. (464 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:33:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:33:36] [INFO ] Invariant cache hit.
[2024-06-01 06:33:36] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:33:36] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2024-06-01 06:33:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:33:36] [INFO ] [Real]Added 241 Read/Feed constraints in 45 ms returned sat
[2024-06-01 06:33:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:33:36] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2024-06-01 06:33:37] [INFO ] [Nat]Added 241 Read/Feed constraints in 74 ms returned sat
[2024-06-01 06:33:37] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 204 ms.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 2 ms to minimize.
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 2 ms to minimize.
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:33:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 809 ms
[2024-06-01 06:33:38] [INFO ] Added : 5 causal constraints over 3 iterations in 1597 ms. Result :sat
Minimization took 1817 ms.
[2024-06-01 06:33:40] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:33:41] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-06-01 06:33:41] [INFO ] [Real]Added 241 Read/Feed constraints in 27 ms returned sat
[2024-06-01 06:33:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:33:41] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2024-06-01 06:33:41] [INFO ] [Nat]Added 241 Read/Feed constraints in 48 ms returned sat
[2024-06-01 06:33:41] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 155 ms.
[2024-06-01 06:33:41] [INFO ] Added : 2 causal constraints over 1 iterations in 331 ms. Result :sat
Minimization took 1821 ms.
[2024-06-01 06:33:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:33:44] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2024-06-01 06:33:44] [INFO ] [Real]Added 241 Read/Feed constraints in 40 ms returned sat
[2024-06-01 06:33:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 06:33:44] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-06-01 06:33:44] [INFO ] [Nat]Added 241 Read/Feed constraints in 37 ms returned sat
[2024-06-01 06:33:44] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 149 ms.
[2024-06-01 06:33:45] [INFO ] Added : 2 causal constraints over 1 iterations in 319 ms. Result :sat
Minimization took 1882 ms.
[2024-06-01 06:33:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:33:47] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-06-01 06:33:47] [INFO ] [Real]Added 241 Read/Feed constraints in 27 ms returned sat
[2024-06-01 06:33:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 06:33:47] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2024-06-01 06:33:48] [INFO ] [Nat]Added 241 Read/Feed constraints in 63 ms returned sat
[2024-06-01 06:33:48] [INFO ] Deduced a trap composed of 41 places in 343 ms of which 2 ms to minimize.
[2024-06-01 06:33:48] [INFO ] Deduced a trap composed of 85 places in 316 ms of which 2 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 2 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 1 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 2 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 2 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 49 places in 270 ms of which 3 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 2 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 1 ms to minimize.
[2024-06-01 06:33:51] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:33:52] [INFO ] Deduced a trap composed of 68 places in 204 ms of which 1 ms to minimize.
[2024-06-01 06:33:52] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 80 places in 245 ms of which 2 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:33:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5292 ms
[2024-06-01 06:33:53] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 193 ms.
[2024-06-01 06:33:53] [INFO ] Added : 4 causal constraints over 1 iterations in 512 ms. Result :sat
Minimization took 1883 ms.
[2024-06-01 06:33:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 06:33:56] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-06-01 06:33:56] [INFO ] [Real]Added 241 Read/Feed constraints in 38 ms returned sat
[2024-06-01 06:33:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:33:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 06:33:56] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2024-06-01 06:33:56] [INFO ] [Nat]Added 241 Read/Feed constraints in 79 ms returned sat
[2024-06-01 06:33:57] [INFO ] Deduced a trap composed of 67 places in 360 ms of which 2 ms to minimize.
[2024-06-01 06:33:57] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 2 ms to minimize.
[2024-06-01 06:33:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 844 ms
[2024-06-01 06:33:57] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 179 ms.
[2024-06-01 06:33:58] [INFO ] Added : 2 causal constraints over 1 iterations in 421 ms. Result :sat
Minimization took 1836 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 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 54 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 54 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 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-06-01 06:34:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:34:00] [INFO ] Invariant cache hit.
[2024-06-01 06:34:00] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-06-01 06:34:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:34:00] [INFO ] Invariant cache hit.
[2024-06-01 06:34:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:34:02] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2024-06-01 06:34:02] [INFO ] Redundant transitions in 271 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-06-01 06:34:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-06-01 06:34:02] [INFO ] Invariant cache hit.
[2024-06-01 06:34:02] [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:34:46] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 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:34:50] [INFO ] Deduced a trap composed of 8 places in 75 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:34:51] [INFO ] Deduced a trap composed of 11 places in 90 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:34:51] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 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:34:51] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 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:34:51] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 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:34:51] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 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:34:56] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
Problem TDEAD2683 is UNSAT
Problem TDEAD2695 is UNSAT
[2024-06-01 06:34:57] [INFO ] Deduced a trap composed of 22 places in 76 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
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30063 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:35:09] [INFO ] Deduced a trap composed of 10 places in 54 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:35:10] [INFO ] Deduced a trap composed of 8 places in 80 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 30054 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 88540ms problems are : Problem set: 506 solved, 2240 unsolved
Search for dead transitions found 506 dead transitions in 88588ms
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.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 650 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 191 transition count 1591
Reduce places removed 15 places and 271 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 46 place count 176 transition count 1320
Reduce places removed 10 places and 132 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 56 place count 166 transition count 1188
Reduce places removed 8 places and 89 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 64 place count 158 transition count 1099
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 157 transition count 1082
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 77 place count 145 transition count 1022
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 15 places and 231 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 104 place count 130 transition count 791
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 111 place count 123 transition count 728
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 118 place count 123 transition count 728
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 118 rules in 36 ms. Remains 123 /229 variables (removed 106) and now considering 728/2241 (removed 1513) transitions.
[2024-06-01 06:35:31] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
// Phase 1: matrix 666 rows 123 cols
[2024-06-01 06:35:31] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 06:35:31] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 06:35:31] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
[2024-06-01 06:35:31] [INFO ] Invariant cache hit.
[2024-06-01 06:35:31] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-01 06:35:31] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 123/229 places, 728/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 91216 ms. Remains : 123/229 places, 728/2747 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:35:31] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
Found an invariant !
This invariant on transitions {6=1, 367=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 367=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:35:31] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
// Phase 1: matrix 666 rows 122 cols
[2024-06-01 06:35:31] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 601 ms. (1661 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 3933 ms. (1016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:35:36] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
[2024-06-01 06:35:36] [INFO ] Invariant cache hit.
[2024-06-01 06:35:36] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:35:36] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-06-01 06:35:36] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-01 06:35:36] [INFO ] [Real]Added 87 Read/Feed constraints in 12 ms returned sat
[2024-06-01 06:35:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-01 06:35:36] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-06-01 06:35:36] [INFO ] [Nat]Added 87 Read/Feed constraints in 20 ms returned sat
[2024-06-01 06:35:37] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 6 ms to minimize.
[2024-06-01 06:35:37] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:35:37] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:35:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 293 ms
[2024-06-01 06:35:37] [INFO ] Computed and/alt/rep : 179/546/178 causal constraints (skipped 487 transitions) in 37 ms.
[2024-06-01 06:35:37] [INFO ] Added : 3 causal constraints over 1 iterations in 92 ms. Result :sat
Minimization took 201 ms.
[2024-06-01 06:35:37] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:35:37] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-06-01 06:35:37] [INFO ] [Real]Added 87 Read/Feed constraints in 11 ms returned sat
[2024-06-01 06:35:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:37] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-06-01 06:35:37] [INFO ] [Nat]Added 87 Read/Feed constraints in 31 ms returned sat
[2024-06-01 06:35:38] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-06-01 06:35:38] [INFO ] Computed and/alt/rep : 179/546/178 causal constraints (skipped 487 transitions) in 46 ms.
[2024-06-01 06:35:38] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:35:38] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:35:38] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:35:38] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:35:38] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:35:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 454 ms
[2024-06-01 06:35:38] [INFO ] Added : 14 causal constraints over 5 iterations in 733 ms. Result :sat
Minimization took 278 ms.
[2024-06-01 06:35:39] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:39] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-01 06:35:39] [INFO ] [Real]Added 87 Read/Feed constraints in 10 ms returned sat
[2024-06-01 06:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:39] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-06-01 06:35:39] [INFO ] [Nat]Added 87 Read/Feed constraints in 16 ms returned sat
[2024-06-01 06:35:39] [INFO ] Computed and/alt/rep : 179/546/178 causal constraints (skipped 487 transitions) in 41 ms.
[2024-06-01 06:35:39] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:35:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-06-01 06:35:39] [INFO ] Added : 4 causal constraints over 2 iterations in 248 ms. Result :sat
Minimization took 258 ms.
[2024-06-01 06:35:40] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:35:40] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-06-01 06:35:40] [INFO ] [Real]Added 87 Read/Feed constraints in 10 ms returned sat
[2024-06-01 06:35:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:35:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:35:40] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-01 06:35:40] [INFO ] [Nat]Added 87 Read/Feed constraints in 17 ms returned sat
[2024-06-01 06:35:40] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2024-06-01 06:35:40] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-06-01 06:35:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2024-06-01 06:35:40] [INFO ] Computed and/alt/rep : 179/546/178 causal constraints (skipped 487 transitions) in 39 ms.
[2024-06-01 06:35:40] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:35:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-06-01 06:35:40] [INFO ] Added : 14 causal constraints over 5 iterations in 359 ms. Result :sat
Minimization took 239 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 728/728 transitions.
Applied a total of 0 rules in 25 ms. Remains 122 /122 variables (removed 0) and now considering 728/728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 122/122 places, 728/728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 728/728 transitions.
Applied a total of 0 rules in 16 ms. Remains 122 /122 variables (removed 0) and now considering 728/728 (removed 0) transitions.
[2024-06-01 06:35:41] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
[2024-06-01 06:35:41] [INFO ] Invariant cache hit.
[2024-06-01 06:35:41] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 06:35:41] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
[2024-06-01 06:35:41] [INFO ] Invariant cache hit.
[2024-06-01 06:35:41] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-01 06:35:42] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-06-01 06:35:42] [INFO ] Redundant transitions in 15 ms returned []
Running 727 sub problems to find dead transitions.
[2024-06-01 06:35:42] [INFO ] Flow matrix only has 666 transitions (discarded 62 similar events)
[2024-06-01 06:35:42] [INFO ] Invariant cache hit.
[2024-06-01 06:35:42] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 727 unsolved
[2024-06-01 06:35:45] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:35:45] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 723 unsolved
Problem TDEAD413 is UNSAT
At refinement iteration 3 (OVERLAPS) 666/788 variables, 122/131 constraints. Problems are: Problem set: 5 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/788 variables, 87/218 constraints. Problems are: Problem set: 5 solved, 722 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/788 variables, 0/218 constraints. Problems are: Problem set: 5 solved, 722 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/788 variables, 0/218 constraints. Problems are: Problem set: 5 solved, 722 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/788 variables, and 218 constraints, problems are : Problem set: 5 solved, 722 unsolved in 28543 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 2/9 constraints. Problems are: Problem set: 5 solved, 722 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 722 unsolved
At refinement iteration 3 (OVERLAPS) 666/788 variables, 122/131 constraints. Problems are: Problem set: 5 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/788 variables, 87/218 constraints. Problems are: Problem set: 5 solved, 722 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 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 TDEAD279 is UNSAT
Problem TDEAD280 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 TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 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
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 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 TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD720 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/788 variables, 722/940 constraints. Problems are: Problem set: 79 solved, 648 unsolved
[2024-06-01 06:36:28] [INFO ] Deduced a trap composed of 14 places in 33 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
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 1/941 constraints. Problems are: Problem set: 124 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/788 variables, and 941 constraints, problems are : Problem set: 124 solved, 603 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 722/727 constraints, Known Traps: 3/3 constraints]
After SMT, in 60270ms problems are : Problem set: 124 solved, 603 unsolved
Search for dead transitions found 124 dead transitions in 60277ms
Found 124 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 124 transitions
Dead transitions reduction (with SMT) removed 124 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/122 places, 604/728 transitions.
Graph (complete) has 865 edges and 122 vertex of which 119 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 12 places and 189 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 107 transition count 415
Reduce places removed 8 places and 73 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 21 place count 99 transition count 342
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 25 place count 95 transition count 313
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 93 transition count 297
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 92 transition count 288
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 34 place count 86 transition count 242
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 40 place count 86 transition count 242
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 40 rules in 12 ms. Remains 86 /122 variables (removed 36) and now considering 242/604 (removed 362) transitions.
[2024-06-01 06:36:42] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 86 cols
[2024-06-01 06:36:42] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 06:36:42] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 06:36:42] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:36:42] [INFO ] Invariant cache hit.
[2024-06-01 06:36:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:36:42] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 86/122 places, 242/728 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61092 ms. Remains : 86/122 places, 242/728 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:36:42] [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 1 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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:36:42] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 83 cols
[2024-06-01 06:36:42] [INFO ] Computed 8 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 416 ms. (2398 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 574 ms. (1739 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:36:43] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:36:43] [INFO ] Invariant cache hit.
[2024-06-01 06:36:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:36:43] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:36:43] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 06:36:43] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:36:43] [INFO ] [Real]Added 48 Read/Feed constraints in 11 ms returned sat
[2024-06-01 06:36:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:36:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:36:43] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:36:43] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-01 06:36:43] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2024-06-01 06:36:43] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:36:43] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:36:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2024-06-01 06:36:44] [INFO ] Computed and/alt/rep : 187/1011/187 causal constraints (skipped 37 transitions) in 12 ms.
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:36:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2024-06-01 06:36:44] [INFO ] Added : 39 causal constraints over 10 iterations in 241 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 2, 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 6 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 7 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-06-01 06:36:44] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:36:44] [INFO ] Invariant cache hit.
[2024-06-01 06:36:44] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 06:36:44] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:36:44] [INFO ] Invariant cache hit.
[2024-06-01 06:36:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:36:44] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-06-01 06:36:44] [INFO ] Redundant transitions in 2 ms returned []
Running 241 sub problems to find dead transitions.
[2024-06-01 06:36:44] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-06-01 06:36:44] [INFO ] Invariant cache hit.
[2024-06-01 06:36:44] [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
[2024-06-01 06:36:46] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:36:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 2/141 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 141 constraints, problems are : Problem set: 2 solved, 239 unsolved in 5214 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: 2/2 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, 2/10 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 225/308 variables, 83/93 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 48/141 constraints. Problems are: Problem set: 2 solved, 239 unsolved
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 239/380 constraints. Problems are: Problem set: 4 solved, 237 unsolved
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/381 constraints. Problems are: Problem set: 5 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/381 constraints. Problems are: Problem set: 5 solved, 236 unsolved
At refinement iteration 9 (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 9182 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 14587ms problems are : Problem set: 5 solved, 236 unsolved
Search for dead transitions found 5 dead transitions in 14590ms
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 6 ms. Remains 82 /83 variables (removed 1) and now considering 231/237 (removed 6) transitions.
[2024-06-01 06:36:59] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
// Phase 1: matrix 215 rows 82 cols
[2024-06-01 06:36:59] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 06:36:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 06:36:59] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:36:59] [INFO ] Invariant cache hit.
[2024-06-01 06:36:59] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:36:59] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 197 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 15061 ms. Remains : 82/83 places, 231/242 transitions.
[2024-06-01 06:36:59] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 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 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:36:59] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:36:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000026 steps (2 resets) in 372 ms. (2681 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 533 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:37:00] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:37:00] [INFO ] Invariant cache hit.
[2024-06-01 06:37:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:37:00] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:37:00] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 06:37:00] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:37:00] [INFO ] [Real]Added 47 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:37:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:37:00] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:37:00] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-01 06:37:00] [INFO ] [Nat]Added 47 Read/Feed constraints in 9 ms returned sat
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-06-01 06:37:00] [INFO ] Computed and/alt/rep : 178/955/178 causal constraints (skipped 36 transitions) in 14 ms.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2024-06-01 06:37:00] [INFO ] Added : 43 causal constraints over 11 iterations in 279 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 2, 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 4 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 4 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:37:01] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:37:01] [INFO ] Invariant cache hit.
[2024-06-01 06:37:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 06:37:01] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:37:01] [INFO ] Invariant cache hit.
[2024-06-01 06:37:01] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 06:37:01] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-06-01 06:37:01] [INFO ] Redundant transitions in 0 ms returned []
Running 230 sub problems to find dead transitions.
[2024-06-01 06:37:01] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-06-01 06:37:01] [INFO ] Invariant cache hit.
[2024-06-01 06:37:01] [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:37:04] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 2/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (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 5838 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
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/358 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/358 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-06-01 06:37:12] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:37:12] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:37:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:37:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/297 variables, 4/362 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/362 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/297 variables, 0/362 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 362 constraints, problems are : Problem set: 12 solved, 218 unsolved in 12594 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: 7/7 constraints]
After SMT, in 18578ms problems are : Problem set: 12 solved, 218 unsolved
Search for dead transitions found 12 dead transitions in 18581ms
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:37:19] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18822 ms. Remains : 82/82 places, 219/231 transitions.
[2024-06-01 06:37:19] [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 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:37:19] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-06-01 06:37:19] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 434 ms. (2298 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 578 ms. (1727 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 06:37:20] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:20] [INFO ] Invariant cache hit.
[2024-06-01 06:37:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:37:21] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:37:21] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 06:37:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:37:21] [INFO ] [Real]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-06-01 06:37:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:37:21] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:37:21] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 06:37:21] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:37:21] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:37:21] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:37:21] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:37:21] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:37:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 218 ms
[2024-06-01 06:37:21] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 12 ms.
[2024-06-01 06:37:21] [INFO ] Added : 39 causal constraints over 9 iterations in 118 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 2, 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 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:37:21] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:21] [INFO ] Invariant cache hit.
[2024-06-01 06:37:21] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 06:37:21] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:21] [INFO ] Invariant cache hit.
[2024-06-01 06:37:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:37:21] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-06-01 06:37:21] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:37:21] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:21] [INFO ] Invariant cache hit.
[2024-06-01 06:37:21] [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 4735 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
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 353 constraints, problems are : Problem set: 0 solved, 218 unsolved in 5635 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]
After SMT, in 10530ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 10533ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10786 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:37:32] [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 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40099 steps (8 resets) in 140 ms. (284 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1231788 steps, run visited all 1 properties in 2670 ms. (steps per millisecond=461 )
Probabilistic random walk after 1231788 steps, saw 722049 distinct states, run finished after 2673 ms. (steps per millisecond=460 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 2, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-05
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:37:35] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10022 steps (2 resets) in 5 ms. (1670 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 06:37:35] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:35] [INFO ] Invariant cache hit.
[2024-06-01 06:37:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-01 06:37:35] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:37:35] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-01 06:37:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:37:35] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:37:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:37:35] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:37:35] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 06:37:35] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 210 ms
[2024-06-01 06:37:35] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 10 ms.
[2024-06-01 06:37:35] [INFO ] Added : 39 causal constraints over 9 iterations in 94 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 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 6 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 6 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:37: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 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 06:37:36] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000027 steps (2 resets) in 568 ms. (1757 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 571 ms. (1748 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 06:37:37] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:37] [INFO ] Invariant cache hit.
[2024-06-01 06:37:37] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-01 06:37:37] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 06:37:37] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 06:37:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:37:37] [INFO ] [Real]Added 45 Read/Feed constraints in 5 ms returned sat
[2024-06-01 06:37:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 06:37:37] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 06:37:37] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-01 06:37:37] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-06-01 06:37:37] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2024-06-01 06:37:37] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:37:37] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:37:37] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:37:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 230 ms
[2024-06-01 06:37:37] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 12 ms.
[2024-06-01 06:37:37] [INFO ] Added : 39 causal constraints over 9 iterations in 128 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 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:37:37] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:37] [INFO ] Invariant cache hit.
[2024-06-01 06:37:37] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 06:37:37] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:37] [INFO ] Invariant cache hit.
[2024-06-01 06:37:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:37:38] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-01 06:37:38] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-06-01 06:37:38] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-06-01 06:37:38] [INFO ] Invariant cache hit.
[2024-06-01 06:37:38] [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 4485 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
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 353 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6288 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]
After SMT, in 10926ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 10929ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11174 ms. Remains : 82/82 places, 219/219 transitions.
[2024-06-01 06:37:49] [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 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40125 steps (8 resets) in 48 ms. (818 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1231788 steps, run visited all 1 properties in 2509 ms. (steps per millisecond=490 )
Probabilistic random walk after 1231788 steps, saw 722049 distinct states, run finished after 2509 ms. (steps per millisecond=490 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q3m064-UpperBounds-05 in 16368 ms.
[2024-06-01 06:37:51] [INFO ] Flatten gal took : 77 ms
[2024-06-01 06:37:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 06:37:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 219 transitions and 1042 arcs took 6 ms.
Total runtime 323287 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-q3m064-UpperBounds-05

BK_STOP 1717223872219

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

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

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