About the Execution of 2023-gold for BugTracking-PT-q3m008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.707 | 3600000.00 | 3665798.00 | 71735.30 | ? ? ? ? ? 0 0 ? 0 ? 0 8 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/mcc2024-input.r065-tajo-171620414600211.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BugTracking-PT-q3m008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414600211
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716640852779
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m008
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 12:40:54] [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]
[2024-05-25 12:40:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:40:56] [INFO ] Load time of PNML (sax parser for PT used): 1209 ms
[2024-05-25 12:40:56] [INFO ] Transformed 754 places.
[2024-05-25 12:40:56] [INFO ] Transformed 27370 transitions.
[2024-05-25 12:40:56] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1522 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 514 places in 174 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2024-05-25 12:40:56] [INFO ] Computed 10 invariants in 53 ms
FORMULA BugTracking-PT-q3m008-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 70 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 8) seen :1
FORMULA BugTracking-PT-q3m008-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
[2024-05-25 12:40:57] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-05-25 12:40:57] [INFO ] Computed 10 invariants in 28 ms
[2024-05-25 12:40:57] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-25 12:40:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:40:58] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2024-05-25 12:40:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:40:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 12:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:40:58] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2024-05-25 12:40:58] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 12:40:58] [INFO ] [Nat]Added 255 Read/Feed constraints in 246 ms returned sat
[2024-05-25 12:40:59] [INFO ] Deduced a trap composed of 58 places in 346 ms of which 4 ms to minimize.
[2024-05-25 12:40:59] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 1 ms to minimize.
[2024-05-25 12:41:00] [INFO ] Deduced a trap composed of 55 places in 335 ms of which 1 ms to minimize.
[2024-05-25 12:41:00] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 1 ms to minimize.
[2024-05-25 12:41:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1561 ms
[2024-05-25 12:41:00] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 286 ms.
[2024-05-25 12:41:01] [INFO ] Added : 14 causal constraints over 3 iterations in 755 ms. Result :sat
Minimization took 537 ms.
[2024-05-25 12:41:01] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 12:41:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:02] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2024-05-25 12:41:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 12:41:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:02] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2024-05-25 12:41:03] [INFO ] [Nat]Added 255 Read/Feed constraints in 123 ms returned sat
[2024-05-25 12:41:03] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 1 ms to minimize.
[2024-05-25 12:41:03] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 0 ms to minimize.
[2024-05-25 12:41:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 706 ms
[2024-05-25 12:41:03] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 166 ms.
[2024-05-25 12:41:04] [INFO ] Added : 5 causal constraints over 1 iterations in 424 ms. Result :sat
Minimization took 361 ms.
[2024-05-25 12:41:04] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 12:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:05] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2024-05-25 12:41:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 12:41:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:05] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2024-05-25 12:41:05] [INFO ] [Nat]Added 255 Read/Feed constraints in 103 ms returned sat
[2024-05-25 12:41:06] [INFO ] Deduced a trap composed of 52 places in 325 ms of which 1 ms to minimize.
[2024-05-25 12:41:06] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 1 ms to minimize.
[2024-05-25 12:41:06] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 0 ms to minimize.
[2024-05-25 12:41:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1284 ms
[2024-05-25 12:41:07] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 236 ms.
[2024-05-25 12:41:07] [INFO ] Added : 7 causal constraints over 2 iterations in 714 ms. Result :sat
Minimization took 363 ms.
[2024-05-25 12:41:08] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 12:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:08] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2024-05-25 12:41:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 12:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:09] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2024-05-25 12:41:09] [INFO ] [Nat]Added 255 Read/Feed constraints in 103 ms returned sat
[2024-05-25 12:41:09] [INFO ] Deduced a trap composed of 14 places in 328 ms of which 1 ms to minimize.
[2024-05-25 12:41:10] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 0 ms to minimize.
[2024-05-25 12:41:10] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 1 ms to minimize.
[2024-05-25 12:41:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1095 ms
[2024-05-25 12:41:10] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 191 ms.
[2024-05-25 12:41:10] [INFO ] Added : 5 causal constraints over 1 iterations in 371 ms. Result :sat
Minimization took 219 ms.
[2024-05-25 12:41:11] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 12:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:11] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2024-05-25 12:41:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 12:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:11] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2024-05-25 12:41:12] [INFO ] [Nat]Added 255 Read/Feed constraints in 39 ms returned sat
[2024-05-25 12:41:12] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 189 ms.
[2024-05-25 12:41:12] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2024-05-25 12:41:13] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2024-05-25 12:41:13] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-25 12:41:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 673 ms
[2024-05-25 12:41:13] [INFO ] Added : 9 causal constraints over 4 iterations in 1590 ms. Result :sat
Minimization took 306 ms.
[2024-05-25 12:41:14] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 12:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:14] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-05-25 12:41:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 12:41:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:14] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2024-05-25 12:41:14] [INFO ] [Nat]Added 255 Read/Feed constraints in 92 ms returned sat
[2024-05-25 12:41:15] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 0 ms to minimize.
[2024-05-25 12:41:15] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 0 ms to minimize.
[2024-05-25 12:41:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 594 ms
[2024-05-25 12:41:15] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 160 ms.
[2024-05-25 12:41:16] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2024-05-25 12:41:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2024-05-25 12:41:16] [INFO ] Added : 7 causal constraints over 2 iterations in 956 ms. Result :sat
Minimization took 344 ms.
[2024-05-25 12:41:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 12:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:17] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2024-05-25 12:41:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 12:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:17] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2024-05-25 12:41:17] [INFO ] [Nat]Added 255 Read/Feed constraints in 130 ms returned sat
[2024-05-25 12:41:18] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 1 ms to minimize.
[2024-05-25 12:41:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2024-05-25 12:41:18] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 154 ms.
[2024-05-25 12:41:18] [INFO ] Added : 5 causal constraints over 1 iterations in 419 ms. Result :sat
Minimization took 228 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, -1, 1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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 5 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 265 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 266 ms. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:41:19] [INFO ] Computed 8 invariants in 17 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6070 ms. (steps per millisecond=164 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2073 ms. (steps per millisecond=482 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2039 ms. (steps per millisecond=490 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2035 ms. (steps per millisecond=491 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2027 ms. (steps per millisecond=493 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1986 ms. (steps per millisecond=503 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2024 ms. (steps per millisecond=494 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2040 ms. (steps per millisecond=490 ) properties (out of 7) seen :0
[2024-05-25 12:41:39] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:41:39] [INFO ] Computed 8 invariants in 34 ms
[2024-05-25 12:41:39] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-25 12:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:40] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2024-05-25 12:41:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 12:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:40] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2024-05-25 12:41:40] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:41:41] [INFO ] [Nat]Added 241 Read/Feed constraints in 174 ms returned sat
[2024-05-25 12:41:41] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 3 ms to minimize.
[2024-05-25 12:41:41] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 0 ms to minimize.
[2024-05-25 12:41:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2024-05-25 12:41:42] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 205 ms.
[2024-05-25 12:41:42] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 1 ms to minimize.
[2024-05-25 12:41:43] [INFO ] Deduced a trap composed of 48 places in 243 ms of which 0 ms to minimize.
[2024-05-25 12:41:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 819 ms
[2024-05-25 12:41:43] [INFO ] Added : 9 causal constraints over 3 iterations in 1894 ms. Result :sat
Minimization took 458 ms.
[2024-05-25 12:41:44] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 12:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:44] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-05-25 12:41:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 12:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:45] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2024-05-25 12:41:45] [INFO ] [Nat]Added 241 Read/Feed constraints in 108 ms returned sat
[2024-05-25 12:41:45] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 0 ms to minimize.
[2024-05-25 12:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2024-05-25 12:41:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 231 ms.
[2024-05-25 12:41:46] [INFO ] Added : 3 causal constraints over 1 iterations in 576 ms. Result :sat
Minimization took 426 ms.
[2024-05-25 12:41:47] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 12:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:47] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2024-05-25 12:41:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:41:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:47] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-05-25 12:41:48] [INFO ] [Nat]Added 241 Read/Feed constraints in 123 ms returned sat
[2024-05-25 12:41:48] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 0 ms to minimize.
[2024-05-25 12:41:48] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 0 ms to minimize.
[2024-05-25 12:41:48] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 0 ms to minimize.
[2024-05-25 12:41:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 922 ms
[2024-05-25 12:41:49] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 169 ms.
[2024-05-25 12:41:49] [INFO ] Added : 4 causal constraints over 1 iterations in 506 ms. Result :sat
Minimization took 393 ms.
[2024-05-25 12:41:50] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 12:41:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:50] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2024-05-25 12:41:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:41:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:50] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-05-25 12:41:51] [INFO ] [Nat]Added 241 Read/Feed constraints in 77 ms returned sat
[2024-05-25 12:41:51] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 0 ms to minimize.
[2024-05-25 12:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2024-05-25 12:41:51] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 256 ms.
[2024-05-25 12:41:51] [INFO ] Added : 3 causal constraints over 1 iterations in 575 ms. Result :sat
Minimization took 385 ms.
[2024-05-25 12:41:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 12:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:52] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2024-05-25 12:41:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:41:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:53] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2024-05-25 12:41:53] [INFO ] [Nat]Added 241 Read/Feed constraints in 53 ms returned sat
[2024-05-25 12:41:53] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 0 ms to minimize.
[2024-05-25 12:41:54] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 1 ms to minimize.
[2024-05-25 12:41:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 667 ms
[2024-05-25 12:41:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 171 ms.
[2024-05-25 12:41:54] [INFO ] Deduced a trap composed of 49 places in 274 ms of which 1 ms to minimize.
[2024-05-25 12:41:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2024-05-25 12:41:55] [INFO ] Added : 7 causal constraints over 2 iterations in 998 ms. Result :sat
Minimization took 284 ms.
[2024-05-25 12:41:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:55] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2024-05-25 12:41:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 12:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:56] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2024-05-25 12:41:56] [INFO ] [Nat]Added 241 Read/Feed constraints in 124 ms returned sat
[2024-05-25 12:41:57] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 337 ms.
[2024-05-25 12:41:57] [INFO ] Added : 4 causal constraints over 1 iterations in 692 ms. Result :sat
Minimization took 252 ms.
[2024-05-25 12:41:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:58] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-25 12:41:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:41:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:41:58] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2024-05-25 12:41:58] [INFO ] [Nat]Added 241 Read/Feed constraints in 185 ms returned sat
[2024-05-25 12:41:59] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 0 ms to minimize.
[2024-05-25 12:41:59] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 0 ms to minimize.
[2024-05-25 12:41:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 758 ms
[2024-05-25 12:41:59] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 205 ms.
[2024-05-25 12:42:00] [INFO ] Added : 3 causal constraints over 1 iterations in 507 ms. Result :sat
Minimization took 407 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, -1, 1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 65 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 65 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 49 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 12:42:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:01] [INFO ] Invariant cache hit.
[2024-05-25 12:42:01] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-25 12:42:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:01] [INFO ] Invariant cache hit.
[2024-05-25 12:42:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:02] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2024-05-25 12:42:02] [INFO ] Redundant transitions in 237 ms returned []
[2024-05-25 12:42:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:02] [INFO ] Invariant cache hit.
[2024-05-25 12:42:03] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2723 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-00
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:03] [INFO ] Computed 8 invariants in 8 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2024-05-25 12:42:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:04] [INFO ] Computed 8 invariants in 8 ms
[2024-05-25 12:42:04] [INFO ] [Real]Absence check using 8 positive place invariants in 44 ms returned sat
[2024-05-25 12:42:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:04] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-05-25 12:42:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:42:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 12:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:05] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2024-05-25 12:42:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:05] [INFO ] [Nat]Added 241 Read/Feed constraints in 169 ms returned sat
[2024-05-25 12:42:05] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2024-05-25 12:42:05] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 0 ms to minimize.
[2024-05-25 12:42:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 537 ms
[2024-05-25 12:42:06] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 181 ms.
[2024-05-25 12:42:06] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 1 ms to minimize.
[2024-05-25 12:42:07] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 1 ms to minimize.
[2024-05-25 12:42:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 745 ms
[2024-05-25 12:42:07] [INFO ] Added : 9 causal constraints over 3 iterations in 1610 ms. Result :sat
Minimization took 399 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 60 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 61 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:08] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4783 ms. (steps per millisecond=209 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2088 ms. (steps per millisecond=478 ) properties (out of 1) seen :0
[2024-05-25 12:42:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:14] [INFO ] Computed 8 invariants in 19 ms
[2024-05-25 12:42:15] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:15] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-25 12:42:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:42:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 12:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:15] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-05-25 12:42:15] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:16] [INFO ] [Nat]Added 241 Read/Feed constraints in 166 ms returned sat
[2024-05-25 12:42:16] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 1 ms to minimize.
[2024-05-25 12:42:16] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 1 ms to minimize.
[2024-05-25 12:42:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 690 ms
[2024-05-25 12:42:17] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 197 ms.
[2024-05-25 12:42:17] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 0 ms to minimize.
[2024-05-25 12:42:18] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 0 ms to minimize.
[2024-05-25 12:42:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 794 ms
[2024-05-25 12:42:18] [INFO ] Added : 9 causal constraints over 3 iterations in 1678 ms. Result :sat
Minimization took 395 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 50 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 75 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 12:42:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:19] [INFO ] Invariant cache hit.
[2024-05-25 12:42:19] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-25 12:42:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:19] [INFO ] Invariant cache hit.
[2024-05-25 12:42:19] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:21] [INFO ] Implicit Places using invariants and state equation in 2016 ms returned []
Implicit Place search using SMT with State Equation took 2461 ms to find 0 implicit places.
[2024-05-25 12:42:21] [INFO ] Redundant transitions in 150 ms returned []
[2024-05-25 12:42:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:21] [INFO ] Invariant cache hit.
[2024-05-25 12:42:22] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3474 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-00 in 18643 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-01
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:22] [INFO ] Computed 8 invariants in 8 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
[2024-05-25 12:42:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:22] [INFO ] Computed 8 invariants in 7 ms
[2024-05-25 12:42:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 12:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:23] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-25 12:42:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:42:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:23] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2024-05-25 12:42:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:23] [INFO ] [Nat]Added 241 Read/Feed constraints in 82 ms returned sat
[2024-05-25 12:42:23] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 0 ms to minimize.
[2024-05-25 12:42:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2024-05-25 12:42:24] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 207 ms.
[2024-05-25 12:42:24] [INFO ] Added : 3 causal constraints over 1 iterations in 407 ms. Result :sat
Minimization took 274 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 43 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 44 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:24] [INFO ] Computed 8 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 6496 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2185 ms. (steps per millisecond=457 ) properties (out of 1) seen :0
[2024-05-25 12:42:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:33] [INFO ] Computed 8 invariants in 18 ms
[2024-05-25 12:42:33] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:34] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-25 12:42:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:42:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 12:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:34] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2024-05-25 12:42:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 105 ms returned sat
[2024-05-25 12:42:35] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 2 ms to minimize.
[2024-05-25 12:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2024-05-25 12:42:35] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 149 ms.
[2024-05-25 12:42:35] [INFO ] Added : 3 causal constraints over 1 iterations in 323 ms. Result :sat
Minimization took 264 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 34 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 36 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.
[2024-05-25 12:42:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:35] [INFO ] Invariant cache hit.
[2024-05-25 12:42:36] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-25 12:42:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:36] [INFO ] Invariant cache hit.
[2024-05-25 12:42:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:37] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2024-05-25 12:42:38] [INFO ] Redundant transitions in 84 ms returned []
[2024-05-25 12:42:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:38] [INFO ] Invariant cache hit.
[2024-05-25 12:42:38] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3060 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-01 in 16413 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-02
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:39] [INFO ] Computed 8 invariants in 11 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2024-05-25 12:42:39] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:39] [INFO ] Computed 8 invariants in 7 ms
[2024-05-25 12:42:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:39] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2024-05-25 12:42:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:42:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:42:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:39] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2024-05-25 12:42:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:40] [INFO ] [Nat]Added 241 Read/Feed constraints in 130 ms returned sat
[2024-05-25 12:42:40] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2024-05-25 12:42:40] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 0 ms to minimize.
[2024-05-25 12:42:40] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 1 ms to minimize.
[2024-05-25 12:42:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 713 ms
[2024-05-25 12:42:40] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 148 ms.
[2024-05-25 12:42:41] [INFO ] Added : 4 causal constraints over 1 iterations in 355 ms. Result :sat
Minimization took 274 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 35 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 36 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:41] [INFO ] Computed 8 invariants in 8 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 4284 ms. (steps per millisecond=233 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties (out of 1) seen :0
[2024-05-25 12:42:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:48] [INFO ] Computed 8 invariants in 16 ms
[2024-05-25 12:42:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:42:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:48] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2024-05-25 12:42:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:42:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:49] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2024-05-25 12:42:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:49] [INFO ] [Nat]Added 241 Read/Feed constraints in 130 ms returned sat
[2024-05-25 12:42:49] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 0 ms to minimize.
[2024-05-25 12:42:49] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 0 ms to minimize.
[2024-05-25 12:42:49] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2024-05-25 12:42:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 727 ms
[2024-05-25 12:42:50] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 159 ms.
[2024-05-25 12:42:50] [INFO ] Added : 4 causal constraints over 1 iterations in 338 ms. Result :sat
Minimization took 274 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 38 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 38 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 32 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 12:42:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:50] [INFO ] Invariant cache hit.
[2024-05-25 12:42:51] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-25 12:42:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:51] [INFO ] Invariant cache hit.
[2024-05-25 12:42:51] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:52] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
[2024-05-25 12:42:52] [INFO ] Redundant transitions in 58 ms returned []
[2024-05-25 12:42:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:42:52] [INFO ] Invariant cache hit.
[2024-05-25 12:42:53] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2675 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-02 in 14387 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-03
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:53] [INFO ] Computed 8 invariants in 18 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
[2024-05-25 12:42:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:42:53] [INFO ] Computed 8 invariants in 8 ms
[2024-05-25 12:42:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:42:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:53] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-05-25 12:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:42:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 12:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:42:54] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2024-05-25 12:42:54] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:42:54] [INFO ] [Nat]Added 241 Read/Feed constraints in 75 ms returned sat
[2024-05-25 12:42:54] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 0 ms to minimize.
[2024-05-25 12:42:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2024-05-25 12:42:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 149 ms.
[2024-05-25 12:42:55] [INFO ] Added : 3 causal constraints over 1 iterations in 356 ms. Result :sat
Minimization took 247 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 34 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
[2024-05-25 12:42:55] [INFO ] Computed 8 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5069 ms. (steps per millisecond=197 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2228 ms. (steps per millisecond=448 ) properties (out of 1) seen :0
[2024-05-25 12:43:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:02] [INFO ] Computed 8 invariants in 20 ms
[2024-05-25 12:43:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:03] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2024-05-25 12:43:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:43:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:03] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-05-25 12:43:03] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:03] [INFO ] [Nat]Added 241 Read/Feed constraints in 70 ms returned sat
[2024-05-25 12:43:03] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 2 ms to minimize.
[2024-05-25 12:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2024-05-25 12:43:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 167 ms.
[2024-05-25 12:43:04] [INFO ] Added : 3 causal constraints over 1 iterations in 390 ms. Result :sat
Minimization took 237 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 31 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 31 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 30 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 12:43:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:04] [INFO ] Invariant cache hit.
[2024-05-25 12:43:05] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-25 12:43:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:05] [INFO ] Invariant cache hit.
[2024-05-25 12:43:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:06] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
[2024-05-25 12:43:06] [INFO ] Redundant transitions in 58 ms returned []
[2024-05-25 12:43:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:06] [INFO ] Invariant cache hit.
[2024-05-25 12:43:07] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2721 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-03 in 14177 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-04
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:07] [INFO ] Computed 8 invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2024-05-25 12:43:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:07] [INFO ] Computed 8 invariants in 15 ms
[2024-05-25 12:43:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:08] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-25 12:43:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:43:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 12:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:08] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2024-05-25 12:43:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:08] [INFO ] [Nat]Added 241 Read/Feed constraints in 41 ms returned sat
[2024-05-25 12:43:08] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 0 ms to minimize.
[2024-05-25 12:43:09] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 0 ms to minimize.
[2024-05-25 12:43:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 647 ms
[2024-05-25 12:43:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 149 ms.
[2024-05-25 12:43:09] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 1 ms to minimize.
[2024-05-25 12:43:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-05-25 12:43:10] [INFO ] Added : 7 causal constraints over 2 iterations in 784 ms. Result :sat
Minimization took 204 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 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
[2024-05-25 12:43:10] [INFO ] Computed 8 invariants in 17 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 4846 ms. (steps per millisecond=206 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2113 ms. (steps per millisecond=473 ) properties (out of 1) seen :0
[2024-05-25 12:43:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:17] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 12:43:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 12:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:17] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-05-25 12:43:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:43:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:18] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2024-05-25 12:43:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:18] [INFO ] [Nat]Added 241 Read/Feed constraints in 43 ms returned sat
[2024-05-25 12:43:18] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 1 ms to minimize.
[2024-05-25 12:43:18] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 0 ms to minimize.
[2024-05-25 12:43:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2024-05-25 12:43:18] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 146 ms.
[2024-05-25 12:43:19] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 14 ms to minimize.
[2024-05-25 12:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2024-05-25 12:43:19] [INFO ] Added : 7 causal constraints over 2 iterations in 818 ms. Result :sat
Minimization took 207 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 33 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 86 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 12:43:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:20] [INFO ] Invariant cache hit.
[2024-05-25 12:43:20] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-25 12:43:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:20] [INFO ] Invariant cache hit.
[2024-05-25 12:43:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:22] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2027 ms to find 0 implicit places.
[2024-05-25 12:43:22] [INFO ] Redundant transitions in 83 ms returned []
[2024-05-25 12:43:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:22] [INFO ] Invariant cache hit.
[2024-05-25 12:43:23] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3059 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-04 in 15494 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-07
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:23] [INFO ] Computed 8 invariants in 7 ms
Incomplete random walk after 10002 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2024-05-25 12:43:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:23] [INFO ] Computed 8 invariants in 6 ms
[2024-05-25 12:43:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:23] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-05-25 12:43:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:43:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:23] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2024-05-25 12:43:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:23] [INFO ] [Nat]Added 241 Read/Feed constraints in 91 ms returned sat
[2024-05-25 12:43:24] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 166 ms.
[2024-05-25 12:43:24] [INFO ] Added : 4 causal constraints over 1 iterations in 353 ms. Result :sat
Minimization took 218 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 39 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.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:24] [INFO ] Computed 8 invariants in 17 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6650 ms. (steps per millisecond=150 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2046 ms. (steps per millisecond=488 ) properties (out of 1) seen :0
[2024-05-25 12:43:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:33] [INFO ] Computed 8 invariants in 15 ms
[2024-05-25 12:43:33] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:33] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-05-25 12:43:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:43:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:34] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2024-05-25 12:43:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 102 ms returned sat
[2024-05-25 12:43:34] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 189 ms.
[2024-05-25 12:43:35] [INFO ] Added : 4 causal constraints over 1 iterations in 444 ms. Result :sat
Minimization took 243 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 59 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 55 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 12:43:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:35] [INFO ] Invariant cache hit.
[2024-05-25 12:43:35] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-25 12:43:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:35] [INFO ] Invariant cache hit.
[2024-05-25 12:43:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:37] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
[2024-05-25 12:43:37] [INFO ] Redundant transitions in 59 ms returned []
[2024-05-25 12:43:37] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:37] [INFO ] Invariant cache hit.
[2024-05-25 12:43:38] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2822 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-07 in 15239 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-09
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:38] [INFO ] Computed 8 invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2024-05-25 12:43:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:38] [INFO ] Computed 8 invariants in 14 ms
[2024-05-25 12:43:38] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:38] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-05-25 12:43:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:43:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:43:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:39] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-05-25 12:43:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:39] [INFO ] [Nat]Added 241 Read/Feed constraints in 125 ms returned sat
[2024-05-25 12:43:39] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 1 ms to minimize.
[2024-05-25 12:43:39] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 0 ms to minimize.
[2024-05-25 12:43:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 676 ms
[2024-05-25 12:43:40] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 215 ms.
[2024-05-25 12:43:40] [INFO ] Added : 3 causal constraints over 1 iterations in 532 ms. Result :sat
Minimization took 409 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 52 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 53 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:41] [INFO ] Computed 8 invariants in 11 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 4936 ms. (steps per millisecond=202 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2409 ms. (steps per millisecond=415 ) properties (out of 1) seen :0
[2024-05-25 12:43:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 12:43:48] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 12:43:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 12:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:49] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2024-05-25 12:43:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:43:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 12:43:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:43:49] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2024-05-25 12:43:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:49] [INFO ] [Nat]Added 241 Read/Feed constraints in 120 ms returned sat
[2024-05-25 12:43:49] [INFO ] Deduced a trap composed of 16 places in 297 ms of which 1 ms to minimize.
[2024-05-25 12:43:50] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2024-05-25 12:43:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 684 ms
[2024-05-25 12:43:50] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 167 ms.
[2024-05-25 12:43:50] [INFO ] Added : 3 causal constraints over 1 iterations in 458 ms. Result :sat
Minimization took 377 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 38 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 38 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.
[2024-05-25 12:43:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:51] [INFO ] Invariant cache hit.
[2024-05-25 12:43:51] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-25 12:43:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:51] [INFO ] Invariant cache hit.
[2024-05-25 12:43:52] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 12:43:53] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2024-05-25 12:43:53] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-25 12:43:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 12:43:53] [INFO ] Invariant cache hit.
[2024-05-25 12:43:54] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2958 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-09 in 15992 ms.
[2024-05-25 12:43:54] [INFO ] Flatten gal took : 261 ms
[2024-05-25 12:43:54] [INFO ] Applying decomposition
[2024-05-25 12:43:55] [INFO ] Flatten gal took : 167 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17408372387237533622.txt' '-o' '/tmp/graph17408372387237533622.bin' '-w' '/tmp/graph17408372387237533622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17408372387237533622.bin' '-l' '-1' '-v' '-w' '/tmp/graph17408372387237533622.weights' '-q' '0' '-e' '0.001'
[2024-05-25 12:43:55] [INFO ] Decomposing Gal with order
[2024-05-25 12:43:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 12:43:56] [INFO ] Removed a total of 280 redundant transitions.
[2024-05-25 12:43:56] [INFO ] Flatten gal took : 416 ms
[2024-05-25 12:43:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 28 ms.
[2024-05-25 12:43:56] [INFO ] Time to serialize gal into /tmp/UpperBounds9995522221782139228.gal : 49 ms
[2024-05-25 12:43:56] [INFO ] Time to serialize properties into /tmp/UpperBounds4067317831705437562.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9995522221782139228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4067317831705437562.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds4067317831705437562.prop.
Detected timeout of ITS tools.
[2024-05-25 13:05:02] [INFO ] Flatten gal took : 1021 ms
[2024-05-25 13:05:02] [INFO ] Time to serialize gal into /tmp/UpperBounds8837558959773633211.gal : 139 ms
[2024-05-25 13:05:02] [INFO ] Time to serialize properties into /tmp/UpperBounds8470747181587399134.prop : 2 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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8837558959773633211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8470747181587399134.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds8470747181587399134.prop.
Detected timeout of ITS tools.
[2024-05-25 13:26:03] [INFO ] Flatten gal took : 1041 ms
[2024-05-25 13:26:06] [INFO ] Input system was already deterministic with 2747 transitions.
[2024-05-25 13:26:06] [INFO ] Transformed 229 places.
[2024-05-25 13:26:06] [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
[2024-05-25 13:26:07] [INFO ] Time to serialize gal into /tmp/UpperBounds16559354507377074340.gal : 21 ms
[2024-05-25 13:26:07] [INFO ] Time to serialize properties into /tmp/UpperBounds17762147954518579612.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16559354507377074340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17762147954518579612.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17762147954518579612.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10645904 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16125028 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-q3m008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BugTracking-PT-q3m008, 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 r065-tajo-171620414600211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m008.tgz
mv BugTracking-PT-q3m008 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 ;