About the Execution of ITS-Tools for BugTracking-PT-q3m256
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.472 | 3600000.00 | 3634560.00 | 75404.40 | ? ? 0 0 0 0 0 ? 0 0 0 1 0 0 ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690300381.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BugTracking-PT-q3m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690300381
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678351293994
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-q3m256
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 08:41:36] [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]
[2023-03-09 08:41:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:41:37] [INFO ] Load time of PNML (sax parser for PT used): 1042 ms
[2023-03-09 08:41:37] [INFO ] Transformed 754 places.
[2023-03-09 08:41:37] [INFO ] Transformed 27370 transitions.
[2023-03-09 08:41:37] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
Deduced a syphon composed of 514 places in 178 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2023-03-09 08:41:38] [INFO ] Computed 10 place invariants in 89 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :1
FORMULA BugTracking-PT-q3m256-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :5
[2023-03-09 08:41:38] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-09 08:41:38] [INFO ] Computed 10 place invariants in 19 ms
[2023-03-09 08:41:38] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-09 08:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:39] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2023-03-09 08:41:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:41:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-09 08:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:40] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2023-03-09 08:41:40] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 08:41:40] [INFO ] [Nat]Added 255 Read/Feed constraints in 52 ms returned sat
[2023-03-09 08:41:40] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 360 ms.
[2023-03-09 08:41:41] [INFO ] Deduced a trap composed of 12 places in 486 ms of which 2 ms to minimize.
[2023-03-09 08:41:42] [INFO ] Deduced a trap composed of 38 places in 603 ms of which 2 ms to minimize.
[2023-03-09 08:41:42] [INFO ] Deduced a trap composed of 55 places in 313 ms of which 2 ms to minimize.
[2023-03-09 08:41:43] [INFO ] Deduced a trap composed of 7 places in 601 ms of which 2 ms to minimize.
[2023-03-09 08:41:43] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 1 ms to minimize.
[2023-03-09 08:41:44] [INFO ] Deduced a trap composed of 17 places in 504 ms of which 0 ms to minimize.
[2023-03-09 08:41:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3413 ms
[2023-03-09 08:41:44] [INFO ] Added : 4 causal constraints over 2 iterations in 4249 ms. Result :unknown
[2023-03-09 08:41:44] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 08:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:45] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2023-03-09 08:41:45] [INFO ] [Real]Added 255 Read/Feed constraints in 35 ms returned sat
[2023-03-09 08:41:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:41:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 08:41:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:45] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2023-03-09 08:41:45] [INFO ] [Nat]Added 255 Read/Feed constraints in 28 ms returned sat
[2023-03-09 08:41:45] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 199 ms.
[2023-03-09 08:41:46] [INFO ] Added : 2 causal constraints over 1 iterations in 427 ms. Result :sat
Minimization took 144 ms.
[2023-03-09 08:41:46] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 08:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:46] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2023-03-09 08:41:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:41:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 08:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:47] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-09 08:41:47] [INFO ] [Nat]Added 255 Read/Feed constraints in 47 ms returned sat
[2023-03-09 08:41:47] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 140 ms.
[2023-03-09 08:41:47] [INFO ] Added : 2 causal constraints over 1 iterations in 346 ms. Result :sat
Minimization took 156 ms.
[2023-03-09 08:41:47] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 08:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:48] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2023-03-09 08:41:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:41:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 08:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:48] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2023-03-09 08:41:48] [INFO ] [Nat]Added 255 Read/Feed constraints in 89 ms returned sat
[2023-03-09 08:41:49] [INFO ] Deduced a trap composed of 8 places in 339 ms of which 1 ms to minimize.
[2023-03-09 08:41:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2023-03-09 08:41:49] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 247 ms.
[2023-03-09 08:41:49] [INFO ] Deduced a trap composed of 48 places in 299 ms of which 1 ms to minimize.
[2023-03-09 08:41:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2023-03-09 08:41:50] [INFO ] Added : 7 causal constraints over 2 iterations in 961 ms. Result :sat
Minimization took 294 ms.
[2023-03-09 08:41:50] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 08:41:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:51] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2023-03-09 08:41:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:41:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 08:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:41:51] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2023-03-09 08:41:51] [INFO ] [Nat]Added 255 Read/Feed constraints in 93 ms returned sat
[2023-03-09 08:41:52] [INFO ] Deduced a trap composed of 52 places in 321 ms of which 0 ms to minimize.
[2023-03-09 08:41:52] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 0 ms to minimize.
[2023-03-09 08:41:52] [INFO ] Deduced a trap composed of 95 places in 289 ms of which 0 ms to minimize.
[2023-03-09 08:41:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1263 ms
[2023-03-09 08:41:53] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 167 ms.
[2023-03-09 08:41:53] [INFO ] Added : 4 causal constraints over 1 iterations in 368 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 1, -1] Max seen :[0, 5, 0, 0, 0]
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 640 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 653 ms. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:41:54] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000146 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1944 ms. (steps per millisecond=514 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2206 ms. (steps per millisecond=453 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2409 ms. (steps per millisecond=415 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2210 ms. (steps per millisecond=452 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2168 ms. (steps per millisecond=461 ) properties (out of 5) seen :0
[2023-03-09 08:42:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:42:06] [INFO ] Computed 8 place invariants in 36 ms
[2023-03-09 08:42:06] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2023-03-09 08:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:06] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-09 08:42:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:07] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-09 08:42:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:42:07] [INFO ] [Nat]Added 241 Read/Feed constraints in 102 ms returned sat
[2023-03-09 08:42:07] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 0 ms to minimize.
[2023-03-09 08:42:08] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 0 ms to minimize.
[2023-03-09 08:42:08] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 0 ms to minimize.
[2023-03-09 08:42:08] [INFO ] Deduced a trap composed of 54 places in 268 ms of which 0 ms to minimize.
[2023-03-09 08:42:08] [INFO ] Deduced a trap composed of 83 places in 267 ms of which 0 ms to minimize.
[2023-03-09 08:42:09] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 1 ms to minimize.
[2023-03-09 08:42:09] [INFO ] Deduced a trap composed of 90 places in 263 ms of which 0 ms to minimize.
[2023-03-09 08:42:09] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 0 ms to minimize.
[2023-03-09 08:42:10] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 0 ms to minimize.
[2023-03-09 08:42:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2910 ms
[2023-03-09 08:42:10] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 151 ms.
[2023-03-09 08:42:10] [INFO ] Added : 6 causal constraints over 2 iterations in 483 ms. Result :sat
Minimization took 225 ms.
[2023-03-09 08:42:11] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:11] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-09 08:42:11] [INFO ] [Real]Added 241 Read/Feed constraints in 43 ms returned sat
[2023-03-09 08:42:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:42:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:12] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2023-03-09 08:42:12] [INFO ] [Nat]Added 241 Read/Feed constraints in 39 ms returned sat
[2023-03-09 08:42:12] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 187 ms.
[2023-03-09 08:42:12] [INFO ] Added : 2 causal constraints over 1 iterations in 446 ms. Result :sat
Minimization took 297 ms.
[2023-03-09 08:42:13] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-09 08:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:13] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-09 08:42:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:13] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2023-03-09 08:42:13] [INFO ] [Nat]Added 241 Read/Feed constraints in 47 ms returned sat
[2023-03-09 08:42:14] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 164 ms.
[2023-03-09 08:42:14] [INFO ] Added : 2 causal constraints over 1 iterations in 465 ms. Result :sat
Minimization took 246 ms.
[2023-03-09 08:42:14] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:15] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-09 08:42:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:15] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2023-03-09 08:42:15] [INFO ] [Nat]Added 241 Read/Feed constraints in 69 ms returned sat
[2023-03-09 08:42:16] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 0 ms to minimize.
[2023-03-09 08:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2023-03-09 08:42:16] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 137 ms.
[2023-03-09 08:42:16] [INFO ] Added : 7 causal constraints over 2 iterations in 456 ms. Result :sat
Minimization took 186 ms.
[2023-03-09 08:42:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:17] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2023-03-09 08:42:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:42:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:17] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-09 08:42:17] [INFO ] [Nat]Added 241 Read/Feed constraints in 132 ms returned sat
[2023-03-09 08:42:18] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 5 ms to minimize.
[2023-03-09 08:42:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2023-03-09 08:42:18] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 146 ms.
[2023-03-09 08:42:18] [INFO ] Added : 3 causal constraints over 1 iterations in 431 ms. Result :sat
Minimization took 3012 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 1, -1] Max seen :[0, 13, 0, 0, 0]
Support contains 5 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 118 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 118 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 102 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:42:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:42:22] [INFO ] Invariant cache hit.
[2023-03-09 08:42:22] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-09 08:42:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:42:22] [INFO ] Invariant cache hit.
[2023-03-09 08:42:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:42:24] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2023-03-09 08:42:24] [INFO ] Redundant transitions in 238 ms returned []
[2023-03-09 08:42:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:42:24] [INFO ] Invariant cache hit.
[2023-03-09 08:42:25] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3583 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:42:25] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1991 ms. (steps per millisecond=502 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2014 ms. (steps per millisecond=496 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1832 ms. (steps per millisecond=545 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1758 ms. (steps per millisecond=568 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1955 ms. (steps per millisecond=511 ) properties (out of 5) seen :2
[2023-03-09 08:42:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:42:35] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-09 08:42:35] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-09 08:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:36] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-09 08:42:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:36] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-09 08:42:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:42:36] [INFO ] [Nat]Added 241 Read/Feed constraints in 110 ms returned sat
[2023-03-09 08:42:37] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 0 ms to minimize.
[2023-03-09 08:42:37] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 0 ms to minimize.
[2023-03-09 08:42:37] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 0 ms to minimize.
[2023-03-09 08:42:38] [INFO ] Deduced a trap composed of 54 places in 312 ms of which 0 ms to minimize.
[2023-03-09 08:42:38] [INFO ] Deduced a trap composed of 83 places in 309 ms of which 1 ms to minimize.
[2023-03-09 08:42:38] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 0 ms to minimize.
[2023-03-09 08:42:39] [INFO ] Deduced a trap composed of 90 places in 306 ms of which 1 ms to minimize.
[2023-03-09 08:42:39] [INFO ] Deduced a trap composed of 47 places in 290 ms of which 0 ms to minimize.
[2023-03-09 08:42:39] [INFO ] Deduced a trap composed of 14 places in 297 ms of which 1 ms to minimize.
[2023-03-09 08:42:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3189 ms
[2023-03-09 08:42:40] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 151 ms.
[2023-03-09 08:42:40] [INFO ] Added : 6 causal constraints over 2 iterations in 420 ms. Result :sat
Minimization took 228 ms.
[2023-03-09 08:42:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:40] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2023-03-09 08:42:41] [INFO ] [Real]Added 241 Read/Feed constraints in 34 ms returned sat
[2023-03-09 08:42:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:41] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2023-03-09 08:42:41] [INFO ] [Nat]Added 241 Read/Feed constraints in 31 ms returned sat
[2023-03-09 08:42:41] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 207 ms.
[2023-03-09 08:42:41] [INFO ] Added : 2 causal constraints over 1 iterations in 364 ms. Result :sat
Minimization took 207 ms.
[2023-03-09 08:42:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:42] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2023-03-09 08:42:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:42] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2023-03-09 08:42:42] [INFO ] [Nat]Added 241 Read/Feed constraints in 35 ms returned sat
[2023-03-09 08:42:43] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 161 ms.
[2023-03-09 08:42:43] [INFO ] Added : 2 causal constraints over 1 iterations in 447 ms. Result :sat
Minimization took 177 ms.
[2023-03-09 08:42:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:44] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2023-03-09 08:42:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:44] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2023-03-09 08:42:44] [INFO ] [Nat]Added 241 Read/Feed constraints in 90 ms returned sat
[2023-03-09 08:42:44] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 0 ms to minimize.
[2023-03-09 08:42:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-09 08:42:45] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 159 ms.
[2023-03-09 08:42:45] [INFO ] Added : 7 causal constraints over 2 iterations in 430 ms. Result :sat
Minimization took 191 ms.
[2023-03-09 08:42:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:46] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2023-03-09 08:42:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:46] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-03-09 08:42:46] [INFO ] [Nat]Added 241 Read/Feed constraints in 102 ms returned sat
[2023-03-09 08:42:46] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 0 ms to minimize.
[2023-03-09 08:42:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2023-03-09 08:42:47] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 208 ms.
[2023-03-09 08:42:47] [INFO ] Added : 3 causal constraints over 1 iterations in 396 ms. Result :sat
Minimization took 3008 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 1, -1] Max seen :[0, 13, 0, 0, 0]
Support contains 5 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 37 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 37 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 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:42:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:42:50] [INFO ] Invariant cache hit.
[2023-03-09 08:42:51] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-09 08:42:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:42:51] [INFO ] Invariant cache hit.
[2023-03-09 08:42:51] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:42:53] [INFO ] Implicit Places using invariants and state equation in 1763 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
[2023-03-09 08:42:53] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-09 08:42:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:42:53] [INFO ] Invariant cache hit.
[2023-03-09 08:42:54] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3376 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-00
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:42:54] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10075 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2518 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-09 08:42:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:42:54] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 08:42:54] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-09 08:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:54] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-09 08:42:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:42:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:42:54] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-09 08:42:54] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:42:55] [INFO ] [Nat]Added 241 Read/Feed constraints in 139 ms returned sat
[2023-03-09 08:42:55] [INFO ] Deduced a trap composed of 10 places in 402 ms of which 1 ms to minimize.
[2023-03-09 08:42:55] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 19 ms to minimize.
[2023-03-09 08:42:56] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 0 ms to minimize.
[2023-03-09 08:42:56] [INFO ] Deduced a trap composed of 54 places in 293 ms of which 1 ms to minimize.
[2023-03-09 08:42:56] [INFO ] Deduced a trap composed of 83 places in 286 ms of which 0 ms to minimize.
[2023-03-09 08:42:57] [INFO ] Deduced a trap composed of 36 places in 312 ms of which 0 ms to minimize.
[2023-03-09 08:42:57] [INFO ] Deduced a trap composed of 90 places in 283 ms of which 1 ms to minimize.
[2023-03-09 08:42:57] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 0 ms to minimize.
[2023-03-09 08:42:58] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 0 ms to minimize.
[2023-03-09 08:42:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3215 ms
[2023-03-09 08:42:58] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2023-03-09 08:42:58] [INFO ] Added : 6 causal constraints over 2 iterations in 480 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 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 37 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 51 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:42:59] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000069 steps, including 2 resets, run finished after 595 ms. (steps per millisecond=1680 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1953 ms. (steps per millisecond=512 ) properties (out of 1) seen :0
[2023-03-09 08:43:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:01] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-09 08:43:01] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-09 08:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:02] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2023-03-09 08:43:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:43:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:02] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2023-03-09 08:43:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:02] [INFO ] [Nat]Added 241 Read/Feed constraints in 134 ms returned sat
[2023-03-09 08:43:03] [INFO ] Deduced a trap composed of 10 places in 378 ms of which 1 ms to minimize.
[2023-03-09 08:43:03] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 1 ms to minimize.
[2023-03-09 08:43:03] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 1 ms to minimize.
[2023-03-09 08:43:04] [INFO ] Deduced a trap composed of 54 places in 299 ms of which 1 ms to minimize.
[2023-03-09 08:43:04] [INFO ] Deduced a trap composed of 83 places in 286 ms of which 0 ms to minimize.
[2023-03-09 08:43:04] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 0 ms to minimize.
[2023-03-09 08:43:05] [INFO ] Deduced a trap composed of 90 places in 293 ms of which 0 ms to minimize.
[2023-03-09 08:43:05] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 1 ms to minimize.
[2023-03-09 08:43:05] [INFO ] Deduced a trap composed of 14 places in 298 ms of which 1 ms to minimize.
[2023-03-09 08:43:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3184 ms
[2023-03-09 08:43:06] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 143 ms.
[2023-03-09 08:43:06] [INFO ] Added : 6 causal constraints over 2 iterations in 393 ms. Result :sat
Minimization took 288 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 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 33 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 34 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:43:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:06] [INFO ] Invariant cache hit.
[2023-03-09 08:43:07] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-09 08:43:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:07] [INFO ] Invariant cache hit.
[2023-03-09 08:43:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:08] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 1965 ms to find 0 implicit places.
[2023-03-09 08:43:08] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-09 08:43:08] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:08] [INFO ] Invariant cache hit.
[2023-03-09 08:43:09] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2782 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-00 in 15517 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-01
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:09] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10158 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2539 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :6
[2023-03-09 08:43:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:09] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-09 08:43:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:09] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-09 08:43:09] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:09] [INFO ] [Real]Added 241 Read/Feed constraints in 32 ms returned sat
[2023-03-09 08:43:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:43:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:10] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-09 08:43:10] [INFO ] [Nat]Added 241 Read/Feed constraints in 30 ms returned sat
[2023-03-09 08:43:10] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2023-03-09 08:43:10] [INFO ] Added : 2 causal constraints over 1 iterations in 296 ms. Result :sat
Minimization took 205 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Support contains 1 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 32 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 33 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:11] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1714 ms. (steps per millisecond=583 ) properties (out of 1) seen :2
[2023-03-09 08:43:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:13] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-09 08:43:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:13] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2023-03-09 08:43:13] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:13] [INFO ] [Real]Added 241 Read/Feed constraints in 30 ms returned sat
[2023-03-09 08:43:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:43:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:13] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2023-03-09 08:43:14] [INFO ] [Nat]Added 241 Read/Feed constraints in 31 ms returned sat
[2023-03-09 08:43:14] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 140 ms.
[2023-03-09 08:43:14] [INFO ] Added : 2 causal constraints over 1 iterations in 294 ms. Result :sat
Minimization took 206 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Support contains 1 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 46 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 47 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 40 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:43:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:14] [INFO ] Invariant cache hit.
[2023-03-09 08:43:14] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-09 08:43:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:15] [INFO ] Invariant cache hit.
[2023-03-09 08:43:15] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:16] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2023-03-09 08:43:16] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-09 08:43:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:16] [INFO ] Invariant cache hit.
[2023-03-09 08:43:17] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2748 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-01 in 7886 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-07
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:17] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10167 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2033 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-09 08:43:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:17] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 08:43:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:17] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2023-03-09 08:43:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:43:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:18] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-09 08:43:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:18] [INFO ] [Nat]Added 241 Read/Feed constraints in 34 ms returned sat
[2023-03-09 08:43:18] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 151 ms.
[2023-03-09 08:43:18] [INFO ] Added : 2 causal constraints over 1 iterations in 318 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 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 33 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 34 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:18] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 1000045 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1666 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
[2023-03-09 08:43:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:21] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-09 08:43:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:21] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-03-09 08:43:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:43:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:21] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-09 08:43:21] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:21] [INFO ] [Nat]Added 241 Read/Feed constraints in 34 ms returned sat
[2023-03-09 08:43:22] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 148 ms.
[2023-03-09 08:43:22] [INFO ] Added : 2 causal constraints over 1 iterations in 373 ms. Result :sat
Minimization took 234 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 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 41 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 42 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 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:43:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:22] [INFO ] Invariant cache hit.
[2023-03-09 08:43:22] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-09 08:43:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:22] [INFO ] Invariant cache hit.
[2023-03-09 08:43:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:24] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
[2023-03-09 08:43:24] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-09 08:43:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:24] [INFO ] Invariant cache hit.
[2023-03-09 08:43:25] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2499 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-07 in 7676 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-14
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:25] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 10077 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
[2023-03-09 08:43:25] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:25] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 08:43:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:25] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2023-03-09 08:43:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:43:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:25] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-09 08:43:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:25] [INFO ] [Nat]Added 241 Read/Feed constraints in 81 ms returned sat
[2023-03-09 08:43:26] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 0 ms to minimize.
[2023-03-09 08:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2023-03-09 08:43:26] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 146 ms.
[2023-03-09 08:43:26] [INFO ] Added : 7 causal constraints over 2 iterations in 373 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 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 30 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 30 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:26] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 1000025 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=1926 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2389 ms. (steps per millisecond=418 ) properties (out of 1) seen :0
[2023-03-09 08:43:29] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:29] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-09 08:43:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 08:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:30] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2023-03-09 08:43:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:43:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:30] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2023-03-09 08:43:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:30] [INFO ] [Nat]Added 241 Read/Feed constraints in 74 ms returned sat
[2023-03-09 08:43:31] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 1 ms to minimize.
[2023-03-09 08:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-09 08:43:31] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 154 ms.
[2023-03-09 08:43:31] [INFO ] Added : 7 causal constraints over 2 iterations in 402 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 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 41 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 41 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 38 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:43:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:32] [INFO ] Invariant cache hit.
[2023-03-09 08:43:32] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-09 08:43:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:32] [INFO ] Invariant cache hit.
[2023-03-09 08:43:32] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:33] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
[2023-03-09 08:43:33] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-09 08:43:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:33] [INFO ] Invariant cache hit.
[2023-03-09 08:43:34] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2900 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-14 in 9752 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-15
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:34] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 10132 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2026 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
[2023-03-09 08:43:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:34] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-09 08:43:34] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:35] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2023-03-09 08:43:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:43:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:35] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2023-03-09 08:43:35] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:35] [INFO ] [Nat]Added 241 Read/Feed constraints in 94 ms returned sat
[2023-03-09 08:43:36] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 0 ms to minimize.
[2023-03-09 08:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-09 08:43:36] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 133 ms.
[2023-03-09 08:43:36] [INFO ] Added : 3 causal constraints over 1 iterations in 365 ms. Result :sat
Minimization took 3003 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 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 49 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 59 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:39] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 1000099 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1583 ms. (steps per millisecond=631 ) properties (out of 1) seen :0
[2023-03-09 08:43:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 08:43:41] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 08:43:41] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 08:43:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:41] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-09 08:43:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:43:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 08:43:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:43:42] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2023-03-09 08:43:42] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:42] [INFO ] [Nat]Added 241 Read/Feed constraints in 96 ms returned sat
[2023-03-09 08:43:42] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 0 ms to minimize.
[2023-03-09 08:43:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-09 08:43:42] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 152 ms.
[2023-03-09 08:43:43] [INFO ] Added : 3 causal constraints over 1 iterations in 375 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 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 66 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 66 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 08:43:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:46] [INFO ] Invariant cache hit.
[2023-03-09 08:43:46] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-09 08:43:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:46] [INFO ] Invariant cache hit.
[2023-03-09 08:43:47] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 08:43:48] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2023-03-09 08:43:48] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-09 08:43:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 08:43:48] [INFO ] Invariant cache hit.
[2023-03-09 08:43:49] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3234 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-15 in 14656 ms.
[2023-03-09 08:43:50] [INFO ] Flatten gal took : 401 ms
[2023-03-09 08:43:50] [INFO ] Applying decomposition
[2023-03-09 08:43:50] [INFO ] Flatten gal took : 164 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14220255717327792930.txt' '-o' '/tmp/graph14220255717327792930.bin' '-w' '/tmp/graph14220255717327792930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14220255717327792930.bin' '-l' '-1' '-v' '-w' '/tmp/graph14220255717327792930.weights' '-q' '0' '-e' '0.001'
[2023-03-09 08:43:51] [INFO ] Decomposing Gal with order
[2023-03-09 08:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 08:43:51] [INFO ] Removed a total of 280 redundant transitions.
[2023-03-09 08:43:52] [INFO ] Flatten gal took : 591 ms
[2023-03-09 08:43:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 26 ms.
[2023-03-09 08:43:52] [INFO ] Time to serialize gal into /tmp/UpperBounds9345609528032394807.gal : 54 ms
[2023-03-09 08:43:52] [INFO ] Time to serialize properties into /tmp/UpperBounds9703604431750377602.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9345609528032394807.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9703604431750377602.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds9703604431750377602.prop.
Detected timeout of ITS tools.
[2023-03-09 09:04:42] [INFO ] Flatten gal took : 616 ms
[2023-03-09 09:04:42] [INFO ] Time to serialize gal into /tmp/UpperBounds17762963311036477335.gal : 95 ms
[2023-03-09 09:04:42] [INFO ] Time to serialize properties into /tmp/UpperBounds5981626555802483602.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17762963311036477335.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5981626555802483602.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds5981626555802483602.prop.
Detected timeout of ITS tools.
[2023-03-09 09:25:27] [INFO ] Flatten gal took : 606 ms
[2023-03-09 09:25:31] [INFO ] Input system was already deterministic with 2747 transitions.
[2023-03-09 09:25:31] [INFO ] Transformed 229 places.
[2023-03-09 09:25:31] [INFO ] Transformed 2747 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 09:25:32] [INFO ] Time to serialize gal into /tmp/UpperBounds7143412718786749740.gal : 32 ms
[2023-03-09 09:25:32] [INFO ] Time to serialize properties into /tmp/UpperBounds9131649332952233262.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7143412718786749740.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9131649332952233262.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9131649332952233262.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 136628 kB
After kill :
MemTotal: 16393340 kB
MemFree: 12339676 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-q3m256"
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-5348"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m256, 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 r037-tajo-167813690300381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m256.tgz
mv BugTracking-PT-q3m256 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;