Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765300509.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BugTracking-PT-q3m016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765300509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1749138654023

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-05 15:50:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 15:50:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:50:58] [INFO ] Load time of PNML (sax parser for PT used): 1547 ms
[2025-06-05 15:50:58] [INFO ] Transformed 754 places.
[2025-06-05 15:50:58] [INFO ] Transformed 27370 transitions.
[2025-06-05 15:50:58] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1933 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 25 ms.
Deduced a syphon composed of 514 places in 148 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-05 15:50:59] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-06-05 15:50:59] [INFO ] Computed 10 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, 1, +inf]
RANDOM walk for 10000 steps (28 resets) in 163 ms. (60 steps per ms)
FORMULA BugTracking-PT-q3m016-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (42 resets) in 371 ms. (188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-06-05 15:50:59] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-06-05 15:50:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:00] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-05 15:51:01] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2025-06-05 15:51:01] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-05 15:51:01] [INFO ] [Real]Added 255 Read/Feed constraints in 98 ms returned sat
[2025-06-05 15:51:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 15:51:02] [INFO ] [Nat]Absence check using state equation in 731 ms returned sat
[2025-06-05 15:51:02] [INFO ] [Nat]Added 255 Read/Feed constraints in 123 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:03] [INFO ] Deduced a trap composed of 12 places in 483 ms of which 25 ms to minimize.
[2025-06-05 15:51:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 673 ms
[2025-06-05 15:51:03] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 401 ms.
[2025-06-05 15:51:04] [INFO ] Added : 6 causal constraints over 2 iterations in 945 ms. Result :sat
Minimization took 931 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:05] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 15:51:06] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2025-06-05 15:51:06] [INFO ] [Real]Added 255 Read/Feed constraints in 101 ms returned sat
[2025-06-05 15:51:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 15:51:07] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2025-06-05 15:51:07] [INFO ] [Nat]Added 255 Read/Feed constraints in 380 ms returned sat
[2025-06-05 15:51:07] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 263 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:09] [INFO ] Deduced a trap composed of 13 places in 778 ms of which 28 ms to minimize.
[2025-06-05 15:51:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1108 ms
[2025-06-05 15:51:09] [INFO ] Added : 12 causal constraints over 4 iterations in 2411 ms. Result :sat
Minimization took 718 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:10] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 15:51:11] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2025-06-05 15:51:11] [INFO ] [Real]Added 255 Read/Feed constraints in 77 ms returned sat
[2025-06-05 15:51:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 15:51:12] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2025-06-05 15:51:12] [INFO ] [Nat]Added 255 Read/Feed constraints in 97 ms returned sat
[2025-06-05 15:51:12] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 340 ms.
[2025-06-05 15:51:13] [INFO ] Added : 2 causal constraints over 1 iterations in 676 ms. Result :sat
Minimization took 677 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:14] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 15:51:14] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2025-06-05 15:51:14] [INFO ] [Real]Added 255 Read/Feed constraints in 56 ms returned sat
[2025-06-05 15:51:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 15:51:15] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2025-06-05 15:51:15] [INFO ] [Nat]Added 255 Read/Feed constraints in 130 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:16] [INFO ] Deduced a trap composed of 31 places in 875 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:17] [INFO ] Deduced a trap composed of 36 places in 690 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:18] [INFO ] Deduced a trap composed of 45 places in 722 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:19] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:19] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 13 ms to minimize.
[2025-06-05 15:51:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3583 ms
[2025-06-05 15:51:19] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 256 ms.
[2025-06-05 15:51:20] [INFO ] Added : 7 causal constraints over 2 iterations in 577 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:20] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 15:51:20] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2025-06-05 15:51:21] [INFO ] [Real]Added 255 Read/Feed constraints in 56 ms returned sat
[2025-06-05 15:51:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 15:51:21] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2025-06-05 15:51:22] [INFO ] [Nat]Added 255 Read/Feed constraints in 167 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:22] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 11 ms to minimize.
[2025-06-05 15:51:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 493 ms
[2025-06-05 15:51:22] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 230 ms.
[2025-06-05 15:51:23] [INFO ] Added : 4 causal constraints over 1 iterations in 588 ms. Result :sat
Minimization took 685 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:23] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 15:51:24] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2025-06-05 15:51:24] [INFO ] [Real]Added 255 Read/Feed constraints in 61 ms returned sat
[2025-06-05 15:51:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 15:51:25] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2025-06-05 15:51:25] [INFO ] [Nat]Added 255 Read/Feed constraints in 168 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:26] [INFO ] Deduced a trap composed of 21 places in 698 ms of which 13 ms to minimize.
[2025-06-05 15:51:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 864 ms
[2025-06-05 15:51:26] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 292 ms.
[2025-06-05 15:51:27] [INFO ] Added : 7 causal constraints over 2 iterations in 731 ms. Result :sat
Minimization took 663 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:27] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 15:51:28] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2025-06-05 15:51:28] [INFO ] [Real]Added 255 Read/Feed constraints in 53 ms returned sat
[2025-06-05 15:51:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:51:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 15:51:29] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2025-06-05 15:51:29] [INFO ] [Nat]Added 255 Read/Feed constraints in 142 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:30] [INFO ] Deduced a trap composed of 12 places in 1224 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:51:31] [INFO ] Deduced a trap composed of 37 places in 744 ms of which 24 ms to minimize.
[2025-06-05 15:51:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2256 ms
[2025-06-05 15:51:32] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 233 ms.
[2025-06-05 15:51:32] [INFO ] Added : 3 causal constraints over 1 iterations in 581 ms. Result :sat
Minimization took 681 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Support contains 7 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.18 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 7 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 549 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 573 ms. Remains : 229/240 places, 2747/2769 transitions.
[2025-06-05 15:51:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 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 412 ms. (steps per millisecond=24 ) properties (out of 7) seen :[0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-06-05 15:51:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2025-06-05 15:51:35] [INFO ] Computed 8 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000003 steps (2 resets) in 5284 ms. (189 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 20845 ms. (335 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-06-05 15:52:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 15:52:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:01] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-06-05 15:52:02] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2025-06-05 15:52:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 15:52:02] [INFO ] [Real]Added 241 Read/Feed constraints in 76 ms returned sat
[2025-06-05 15:52:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 15:52:03] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2025-06-05 15:52:03] [INFO ] [Nat]Added 241 Read/Feed constraints in 129 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:04] [INFO ] Deduced a trap composed of 12 places in 463 ms of which 17 ms to minimize.
[2025-06-05 15:52:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 599 ms
[2025-06-05 15:52:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 261 ms.
[2025-06-05 15:52:04] [INFO ] Added : 1 causal constraints over 1 iterations in 566 ms. Result :sat
Minimization took 2300 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 15:52:08] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2025-06-05 15:52:08] [INFO ] [Real]Added 241 Read/Feed constraints in 59 ms returned sat
[2025-06-05 15:52:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 15:52:09] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2025-06-05 15:52:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 167 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:09] [INFO ] Deduced a trap composed of 7 places in 427 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:10] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 10 ms to minimize.
[2025-06-05 15:52:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 932 ms
[2025-06-05 15:52:10] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 377 ms.
[2025-06-05 15:52:10] [INFO ] Added : 4 causal constraints over 1 iterations in 722 ms. Result :sat
Minimization took 2272 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 15:52:13] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2025-06-05 15:52:14] [INFO ] [Real]Added 241 Read/Feed constraints in 59 ms returned sat
[2025-06-05 15:52:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 15:52:14] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2025-06-05 15:52:14] [INFO ] [Nat]Added 241 Read/Feed constraints in 56 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:15] [INFO ] Deduced a trap composed of 11 places in 437 ms of which 15 ms to minimize.
[2025-06-05 15:52:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 568 ms
[2025-06-05 15:52:15] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 229 ms.
[2025-06-05 15:52:16] [INFO ] Added : 2 causal constraints over 1 iterations in 538 ms. Result :sat
Minimization took 2299 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 15:52:19] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2025-06-05 15:52:19] [INFO ] [Real]Added 241 Read/Feed constraints in 55 ms returned sat
[2025-06-05 15:52:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 15:52:20] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2025-06-05 15:52:20] [INFO ] [Nat]Added 241 Read/Feed constraints in 112 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:20] [INFO ] Deduced a trap composed of 31 places in 583 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:21] [INFO ] Deduced a trap composed of 34 places in 579 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:22] [INFO ] Deduced a trap composed of 28 places in 555 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:23] [INFO ] Deduced a trap composed of 11 places in 640 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:23] [INFO ] Deduced a trap composed of 43 places in 635 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:24] [INFO ] Deduced a trap composed of 43 places in 611 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:25] [INFO ] Deduced a trap composed of 62 places in 671 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:26] [INFO ] Deduced a trap composed of 38 places in 683 ms of which 22 ms to minimize.
[2025-06-05 15:52:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6407 ms
[2025-06-05 15:52:26] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 251 ms.
[2025-06-05 15:52:27] [INFO ] Added : 10 causal constraints over 3 iterations in 903 ms. Result :sat
Minimization took 2353 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:30] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 15:52:30] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2025-06-05 15:52:30] [INFO ] [Real]Added 241 Read/Feed constraints in 69 ms returned sat
[2025-06-05 15:52:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 15:52:31] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2025-06-05 15:52:31] [INFO ] [Nat]Added 241 Read/Feed constraints in 192 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:32] [INFO ] Deduced a trap composed of 7 places in 621 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:33] [INFO ] Deduced a trap composed of 10 places in 586 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:33] [INFO ] Deduced a trap composed of 31 places in 608 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:34] [INFO ] Deduced a trap composed of 34 places in 556 ms of which 21 ms to minimize.
[2025-06-05 15:52:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2752 ms
[2025-06-05 15:52:34] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 239 ms.
[2025-06-05 15:52:35] [INFO ] Added : 1 causal constraints over 1 iterations in 558 ms. Result :sat
Minimization took 2234 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:37] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 15:52:38] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2025-06-05 15:52:38] [INFO ] [Real]Added 241 Read/Feed constraints in 59 ms returned sat
[2025-06-05 15:52:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 15:52:39] [INFO ] [Nat]Absence check using state equation in 611 ms returned sat
[2025-06-05 15:52:39] [INFO ] [Nat]Added 241 Read/Feed constraints in 243 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:39] [INFO ] Deduced a trap composed of 11 places in 465 ms of which 17 ms to minimize.
[2025-06-05 15:52:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 608 ms
[2025-06-05 15:52:40] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 240 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:52:41] [INFO ] Deduced a trap composed of 21 places in 615 ms of which 17 ms to minimize.
[2025-06-05 15:52:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 818 ms
[2025-06-05 15:52:41] [INFO ] Added : 11 causal constraints over 4 iterations in 1922 ms. Result :sat
Minimization took 2348 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:44] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 15:52:45] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2025-06-05 15:52:45] [INFO ] [Real]Added 241 Read/Feed constraints in 53 ms returned sat
[2025-06-05 15:52:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 15:52:45] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2025-06-05 15:52:46] [INFO ] [Nat]Added 241 Read/Feed constraints in 174 ms returned sat
[2025-06-05 15:52:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 230 ms.
[2025-06-05 15:52:46] [INFO ] Added : 4 causal constraints over 1 iterations in 544 ms. Result :sat
Minimization took 2302 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Support contains 7 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 95 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 106 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 68 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-06-05 15:52:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 15:52:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:50] [INFO ] Implicit Places using invariants in 652 ms returned []
[2025-06-05 15:52:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 15:52:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:52:51] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 15:52:54] [INFO ] Implicit Places using invariants and state equation in 3983 ms returned []
Implicit Place search using SMT with State Equation took 4640 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:52:54] [INFO ] Redundant transitions in 255 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-06-05 15:52:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 15:52:54] [INFO ] Invariant cache hit.
[2025-06-05 15:52:54] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:30] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 9 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30104 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/1184 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
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
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 2738 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:47] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 4 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
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:48] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 5 ms to minimize.
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:48] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 3 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
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
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
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 TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 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 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
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:53:57] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 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
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 4/13 constraints. Problems are: Problem set: 222 solved, 2524 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 13 constraints, problems are : Problem set: 222 solved, 2524 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1562/1184 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67758ms problems are : Problem set: 222 solved, 2524 unsolved
Search for dead transitions found 222 dead transitions in 67804ms
Found 222 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 222 transitions
Dead transitions reduction (with SMT) removed 222 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2525/2747 transitions.
Reduce places removed 26 places and 563 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 203 transition count 1962
Reduce places removed 20 places and 260 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 46 place count 183 transition count 1702
Reduce places removed 8 places and 198 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 54 place count 175 transition count 1504
Reduce places removed 8 places and 118 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 62 place count 167 transition count 1386
Reduce places removed 3 places and 66 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 164 transition count 1320
Reduce places removed 3 places and 52 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 68 place count 161 transition count 1268
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 71 place count 158 transition count 1225
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 15 places and 270 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 89 place count 143 transition count 955
Deduced a syphon composed of 5 places in 2 ms
Applied a total of 89 rules in 121 ms. Remains 143 /229 variables (removed 86) and now considering 955/2525 (removed 1570) transitions.
[2025-06-05 15:54:02] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
// Phase 1: matrix 904 rows 143 cols
[2025-06-05 15:54:02] [INFO ] Computed 13 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:04] [INFO ] Implicit Places using invariants in 1247 ms returned []
[2025-06-05 15:54:04] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 15:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:04] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 15:54:05] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 2566 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 143/229 places, 955/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 75514 ms. Remains : 143/229 places, 955/2747 transitions.
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
FORMULA BugTracking-PT-q3m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 15:54:05] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 589=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {7=1, 589=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-06-05 15:54:05] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
// Phase 1: matrix 904 rows 138 cols
[2025-06-05 15:54:05] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2375 ms. (420 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 2871 ms. (696 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
[2025-06-05 15:54:11] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 15:54:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:54:11] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 15:54:11] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2025-06-05 15:54:11] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 15:54:11] [INFO ] [Real]Added 113 Read/Feed constraints in 39 ms returned sat
[2025-06-05 15:54:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:54:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-05 15:54:11] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-06-05 15:54:11] [INFO ] [Nat]Added 113 Read/Feed constraints in 45 ms returned sat
[2025-06-05 15:54:11] [INFO ] Computed and/alt/rep : 231/857/230 causal constraints (skipped 673 transitions) in 76 ms.
[2025-06-05 15:54:12] [INFO ] Added : 2 causal constraints over 1 iterations in 189 ms. Result :sat
Minimization took 528 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:54:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 15:54:12] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2025-06-05 15:54:12] [INFO ] [Real]Added 113 Read/Feed constraints in 24 ms returned sat
[2025-06-05 15:54:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:54:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 15:54:13] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2025-06-05 15:54:13] [INFO ] [Nat]Added 113 Read/Feed constraints in 42 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:13] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:13] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:13] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:14] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:14] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 7 ms to minimize.
[2025-06-05 15:54:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1319 ms
[2025-06-05 15:54:14] [INFO ] Computed and/alt/rep : 231/857/230 causal constraints (skipped 673 transitions) in 75 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:15] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 10 ms to minimize.
[2025-06-05 15:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2025-06-05 15:54:15] [INFO ] Added : 13 causal constraints over 5 iterations in 984 ms. Result :sat
Minimization took 587 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 1, +inf]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 955/955 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 138/138 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 955/955 transitions.
Applied a total of 0 rules in 31 ms. Remains 138 /138 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2025-06-05 15:54:16] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 15:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:16] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-06-05 15:54:16] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 15:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:54:17] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 15:54:18] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:54:18] [INFO ] Redundant transitions in 46 ms returned []
Running 954 sub problems to find dead transitions.
[2025-06-05 15:54:18] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 15:54:18] [INFO ] Invariant cache hit.
[2025-06-05 15:54:18] [INFO ] State equation strengthened by 113 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:23] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:25] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 3 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:54:26] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 3/11 constraints. Problems are: Problem set: 150 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 150 solved, 804 unsolved
Problem TDEAD619 is UNSAT
At refinement iteration 3 (OVERLAPS) 904/1042 variables, 138/149 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 113/262 constraints. Problems are: Problem set: 151 solved, 803 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1042/1042 variables, and 262 constraints, problems are : Problem set: 151 solved, 803 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 151 solved, 803 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 7/7 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 3/10 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 1/11 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 5 (OVERLAPS) 904/1042 variables, 138/149 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 113/262 constraints. Problems are: Problem set: 151 solved, 803 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
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 803/1065 constraints. Problems are: Problem set: 216 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/1042 variables, and 1065 constraints, problems are : Problem set: 216 solved, 738 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 803/954 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61559ms problems are : Problem set: 216 solved, 738 unsolved
Search for dead transitions found 216 dead transitions in 61565ms
Found 216 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 216 transitions
Dead transitions reduction (with SMT) removed 216 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 138/138 places, 739/955 transitions.
Graph (complete) has 1062 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 211 transitions.
Graph (complete) has 806 edges and 122 vertex of which 2 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.0 ms
Discarding 120 places :
Also discarding 528 output transitions
Drop transitions (Output transitions of discarded places.) removed 528 transitions
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 17 rules in 4 ms. Remains 2 /138 variables (removed 136) and now considering 0/739 (removed 739) transitions.
[2025-06-05 15:55:19] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:55:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-05 15:55:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:55:19] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/138 places, 0/955 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63503 ms. Remains : 2/138 places, 0/955 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 263382 ms.

BK_STOP 1749138920020

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-q3m016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m016, 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 r016-smll-174853765300509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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