Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694700421.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q8m032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Feb 26 06:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 06:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 07:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 07:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678635894699

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m032
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:44:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 15:44:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:44:57] [INFO ] Load time of PNML (sax parser for PT used): 693 ms
[2023-03-12 15:44:57] [INFO ] Transformed 754 places.
[2023-03-12 15:44:57] [INFO ] Transformed 27370 transitions.
[2023-03-12 15:44:57] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 908 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 474 places in 105 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-12 15:44:57] [INFO ] Computed 10 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :1
FORMULA BugTracking-PT-q8m032-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
[2023-03-12 15:44:57] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-12 15:44:57] [INFO ] Computed 10 place invariants in 51 ms
[2023-03-12 15:44:58] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-12 15:44:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:44:59] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2023-03-12 15:44:59] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 15:44:59] [INFO ] [Real]Added 303 Read/Feed constraints in 52 ms returned sat
[2023-03-12 15:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:44:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 15:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:44:59] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2023-03-12 15:45:00] [INFO ] [Nat]Added 303 Read/Feed constraints in 158 ms returned sat
[2023-03-12 15:45:00] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 298 ms.
[2023-03-12 15:45:01] [INFO ] Added : 11 causal constraints over 3 iterations in 1120 ms. Result :sat
[2023-03-12 15:45:01] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 15:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:02] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2023-03-12 15:45:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:45:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 15:45:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:02] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2023-03-12 15:45:02] [INFO ] [Nat]Added 303 Read/Feed constraints in 48 ms returned sat
[2023-03-12 15:45:03] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 476 ms.
[2023-03-12 15:45:03] [INFO ] Added : 2 causal constraints over 1 iterations in 863 ms. Result :sat
[2023-03-12 15:45:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 15:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:04] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2023-03-12 15:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:45:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-12 15:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:04] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2023-03-12 15:45:05] [INFO ] [Nat]Added 303 Read/Feed constraints in 189 ms returned sat
[2023-03-12 15:45:05] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 301 ms.
[2023-03-12 15:45:06] [INFO ] Deduced a trap composed of 12 places in 476 ms of which 5 ms to minimize.
[2023-03-12 15:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 701 ms
[2023-03-12 15:45:07] [INFO ] Added : 13 causal constraints over 3 iterations in 1835 ms. Result :sat
[2023-03-12 15:45:07] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 15:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:07] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2023-03-12 15:45:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:45:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 15:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:08] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2023-03-12 15:45:08] [INFO ] [Nat]Added 303 Read/Feed constraints in 395 ms returned sat
[2023-03-12 15:45:09] [INFO ] Deduced a trap composed of 24 places in 394 ms of which 1 ms to minimize.
[2023-03-12 15:45:09] [INFO ] Deduced a trap composed of 30 places in 437 ms of which 1 ms to minimize.
[2023-03-12 15:45:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1071 ms
[2023-03-12 15:45:10] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 301 ms.
[2023-03-12 15:45:10] [INFO ] Added : 8 causal constraints over 2 iterations in 855 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1] Max seen :[1, 0, 0, 0]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 381 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:45:11] [INFO ] Computed 8 place invariants in 25 ms
Incomplete random walk after 1000017 steps, including 2 resets, run finished after 1909 ms. (steps per millisecond=523 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1860 ms. (steps per millisecond=537 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1980 ms. (steps per millisecond=505 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2012 ms. (steps per millisecond=497 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1710 ms. (steps per millisecond=584 ) properties (out of 4) seen :1
[2023-03-12 15:45:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:45:21] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 15:45:21] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-12 15:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:22] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2023-03-12 15:45:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:45:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:45:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:22] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-12 15:45:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:45:22] [INFO ] [Nat]Added 283 Read/Feed constraints in 168 ms returned sat
[2023-03-12 15:45:23] [INFO ] Deduced a trap composed of 36 places in 477 ms of which 2 ms to minimize.
[2023-03-12 15:45:24] [INFO ] Deduced a trap composed of 15 places in 693 ms of which 2 ms to minimize.
[2023-03-12 15:45:24] [INFO ] Deduced a trap composed of 52 places in 438 ms of which 1 ms to minimize.
[2023-03-12 15:45:25] [INFO ] Deduced a trap composed of 54 places in 367 ms of which 0 ms to minimize.
[2023-03-12 15:45:25] [INFO ] Deduced a trap composed of 7 places in 380 ms of which 1 ms to minimize.
[2023-03-12 15:45:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2762 ms
[2023-03-12 15:45:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 235 ms.
[2023-03-12 15:45:26] [INFO ] Added : 1 causal constraints over 1 iterations in 634 ms. Result :sat
[2023-03-12 15:45:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:45:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:27] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2023-03-12 15:45:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:45:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:27] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2023-03-12 15:45:27] [INFO ] [Nat]Added 283 Read/Feed constraints in 44 ms returned sat
[2023-03-12 15:45:28] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 278 ms.
[2023-03-12 15:45:28] [INFO ] Added : 2 causal constraints over 1 iterations in 665 ms. Result :sat
[2023-03-12 15:45:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:29] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2023-03-12 15:45:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:45:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-12 15:45:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:29] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2023-03-12 15:45:30] [INFO ] [Nat]Added 283 Read/Feed constraints in 118 ms returned sat
[2023-03-12 15:45:30] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 0 ms to minimize.
[2023-03-12 15:45:30] [INFO ] Deduced a trap composed of 40 places in 239 ms of which 1 ms to minimize.
[2023-03-12 15:45:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 860 ms
[2023-03-12 15:45:31] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 246 ms.
[2023-03-12 15:45:32] [INFO ] Deduced a trap composed of 52 places in 335 ms of which 1 ms to minimize.
[2023-03-12 15:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 564 ms
[2023-03-12 15:45:32] [INFO ] Added : 9 causal constraints over 2 iterations in 1466 ms. Result :sat
[2023-03-12 15:45:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:45:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:33] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2023-03-12 15:45:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:45:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:33] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2023-03-12 15:45:33] [INFO ] [Nat]Added 283 Read/Feed constraints in 250 ms returned sat
[2023-03-12 15:45:34] [INFO ] Deduced a trap composed of 43 places in 341 ms of which 1 ms to minimize.
[2023-03-12 15:45:34] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 1 ms to minimize.
[2023-03-12 15:45:35] [INFO ] Deduced a trap composed of 59 places in 297 ms of which 1 ms to minimize.
[2023-03-12 15:45:35] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 1 ms to minimize.
[2023-03-12 15:45:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1591 ms
[2023-03-12 15:45:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 238 ms.
[2023-03-12 15:45:36] [INFO ] Added : 9 causal constraints over 3 iterations in 820 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1] Max seen :[1, 0, 0, 0]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 74 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:45:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:45:36] [INFO ] Invariant cache hit.
[2023-03-12 15:45:37] [INFO ] Implicit Places using invariants in 529 ms returned []
[2023-03-12 15:45:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:45:37] [INFO ] Invariant cache hit.
[2023-03-12 15:45:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:45:39] [INFO ] Implicit Places using invariants and state equation in 2071 ms returned []
Implicit Place search using SMT with State Equation took 2620 ms to find 0 implicit places.
[2023-03-12 15:45:39] [INFO ] Redundant transitions in 327 ms returned []
[2023-03-12 15:45:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:45:39] [INFO ] Invariant cache hit.
[2023-03-12 15:45:40] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4169 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-00
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:45:41] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10022 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :1
[2023-03-12 15:45:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:45:41] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 15:45:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:45:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:41] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2023-03-12 15:45:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:45:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:45:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:42] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2023-03-12 15:45:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:45:42] [INFO ] [Nat]Added 283 Read/Feed constraints in 182 ms returned sat
[2023-03-12 15:45:43] [INFO ] Deduced a trap composed of 36 places in 488 ms of which 0 ms to minimize.
[2023-03-12 15:45:43] [INFO ] Deduced a trap composed of 15 places in 430 ms of which 0 ms to minimize.
[2023-03-12 15:45:44] [INFO ] Deduced a trap composed of 52 places in 376 ms of which 0 ms to minimize.
[2023-03-12 15:45:44] [INFO ] Deduced a trap composed of 54 places in 465 ms of which 0 ms to minimize.
[2023-03-12 15:45:45] [INFO ] Deduced a trap composed of 7 places in 405 ms of which 0 ms to minimize.
[2023-03-12 15:45:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2643 ms
[2023-03-12 15:45:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 298 ms.
[2023-03-12 15:45:45] [INFO ] Added : 1 causal constraints over 1 iterations in 603 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:45:46] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000024 steps, including 2 resets, run finished after 1420 ms. (steps per millisecond=704 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2117 ms. (steps per millisecond=472 ) properties (out of 1) seen :2
[2023-03-12 15:45:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:45:49] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 15:45:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:50] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2023-03-12 15:45:50] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:45:50] [INFO ] [Real]Added 283 Read/Feed constraints in 34 ms returned sat
[2023-03-12 15:45:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:45:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:45:50] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2023-03-12 15:45:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 153 ms returned sat
[2023-03-12 15:45:51] [INFO ] Deduced a trap composed of 19 places in 335 ms of which 0 ms to minimize.
[2023-03-12 15:45:51] [INFO ] Deduced a trap composed of 53 places in 359 ms of which 1 ms to minimize.
[2023-03-12 15:45:52] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 0 ms to minimize.
[2023-03-12 15:45:52] [INFO ] Deduced a trap composed of 7 places in 353 ms of which 1 ms to minimize.
[2023-03-12 15:45:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1703 ms
[2023-03-12 15:45:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 274 ms.
[2023-03-12 15:45:53] [INFO ] Added : 1 causal constraints over 1 iterations in 609 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:45:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:45:53] [INFO ] Invariant cache hit.
[2023-03-12 15:45:53] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-12 15:45:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:45:53] [INFO ] Invariant cache hit.
[2023-03-12 15:45:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:45:55] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2023-03-12 15:45:55] [INFO ] Redundant transitions in 163 ms returned []
[2023-03-12 15:45:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:45:55] [INFO ] Invariant cache hit.
[2023-03-12 15:45:57] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3569 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:45:57] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 1731 ms. (steps per millisecond=577 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1855 ms. (steps per millisecond=539 ) properties (out of 1) seen :1
[2023-03-12 15:46:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:00] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-12 15:46:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:01] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2023-03-12 15:46:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:01] [INFO ] [Real]Added 283 Read/Feed constraints in 46 ms returned sat
[2023-03-12 15:46:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:46:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:02] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2023-03-12 15:46:02] [INFO ] [Nat]Added 283 Read/Feed constraints in 156 ms returned sat
[2023-03-12 15:46:02] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2023-03-12 15:46:02] [INFO ] Deduced a trap composed of 53 places in 325 ms of which 16 ms to minimize.
[2023-03-12 15:46:03] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 0 ms to minimize.
[2023-03-12 15:46:03] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 0 ms to minimize.
[2023-03-12 15:46:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1690 ms
[2023-03-12 15:46:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 263 ms.
[2023-03-12 15:46:04] [INFO ] Added : 1 causal constraints over 1 iterations in 618 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:46:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:04] [INFO ] Invariant cache hit.
[2023-03-12 15:46:05] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-12 15:46:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:05] [INFO ] Invariant cache hit.
[2023-03-12 15:46:05] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:06] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2023-03-12 15:46:06] [INFO ] Redundant transitions in 100 ms returned []
[2023-03-12 15:46:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:06] [INFO ] Invariant cache hit.
[2023-03-12 15:46:07] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3258 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-00 in 26972 ms.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:08] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2023-03-12 15:46:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:08] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:46:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:08] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2023-03-12 15:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:46:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:09] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2023-03-12 15:46:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 43 ms returned sat
[2023-03-12 15:46:09] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 249 ms.
[2023-03-12 15:46:09] [INFO ] Added : 2 causal constraints over 1 iterations in 500 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:09] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000017 steps, including 2 resets, run finished after 1760 ms. (steps per millisecond=568 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1815 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
[2023-03-12 15:46:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:13] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-12 15:46:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:14] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2023-03-12 15:46:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:46:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:14] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2023-03-12 15:46:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 39 ms returned sat
[2023-03-12 15:46:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 255 ms.
[2023-03-12 15:46:15] [INFO ] Added : 2 causal constraints over 1 iterations in 668 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:46:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:15] [INFO ] Invariant cache hit.
[2023-03-12 15:46:16] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-12 15:46:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:16] [INFO ] Invariant cache hit.
[2023-03-12 15:46:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:17] [INFO ] Implicit Places using invariants and state equation in 1731 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2023-03-12 15:46:17] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-12 15:46:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:17] [INFO ] Invariant cache hit.
[2023-03-12 15:46:18] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3298 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-08 in 10918 ms.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:18] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10011 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-12 15:46:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:18] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 15:46:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:19] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2023-03-12 15:46:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:46:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:20] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2023-03-12 15:46:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 116 ms returned sat
[2023-03-12 15:46:20] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 0 ms to minimize.
[2023-03-12 15:46:20] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 1 ms to minimize.
[2023-03-12 15:46:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 828 ms
[2023-03-12 15:46:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 283 ms.
[2023-03-12 15:46:21] [INFO ] Deduced a trap composed of 52 places in 264 ms of which 0 ms to minimize.
[2023-03-12 15:46:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-12 15:46:22] [INFO ] Added : 9 causal constraints over 2 iterations in 1170 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:22] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000010 steps, including 2 resets, run finished after 1632 ms. (steps per millisecond=612 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1742 ms. (steps per millisecond=574 ) properties (out of 1) seen :0
[2023-03-12 15:46:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:25] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-12 15:46:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:26] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2023-03-12 15:46:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:46:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:26] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2023-03-12 15:46:26] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:26] [INFO ] [Nat]Added 283 Read/Feed constraints in 110 ms returned sat
[2023-03-12 15:46:27] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 1 ms to minimize.
[2023-03-12 15:46:27] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 0 ms to minimize.
[2023-03-12 15:46:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 741 ms
[2023-03-12 15:46:27] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 234 ms.
[2023-03-12 15:46:28] [INFO ] Deduced a trap composed of 52 places in 280 ms of which 1 ms to minimize.
[2023-03-12 15:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
[2023-03-12 15:46:29] [INFO ] Added : 9 causal constraints over 2 iterations in 1342 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 82 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:46:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:29] [INFO ] Invariant cache hit.
[2023-03-12 15:46:29] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-12 15:46:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:29] [INFO ] Invariant cache hit.
[2023-03-12 15:46:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:31] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2023-03-12 15:46:31] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-12 15:46:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:31] [INFO ] Invariant cache hit.
[2023-03-12 15:46:32] [INFO ] Dead Transitions using invariants and state equation in 1257 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3662 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-13 in 14037 ms.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-14
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:32] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10022 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-12 15:46:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:33] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 15:46:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:33] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2023-03-12 15:46:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:46:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:34] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2023-03-12 15:46:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:34] [INFO ] [Nat]Added 283 Read/Feed constraints in 208 ms returned sat
[2023-03-12 15:46:34] [INFO ] Deduced a trap composed of 43 places in 309 ms of which 4 ms to minimize.
[2023-03-12 15:46:34] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-12 15:46:35] [INFO ] Deduced a trap composed of 59 places in 280 ms of which 0 ms to minimize.
[2023-03-12 15:46:35] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 0 ms to minimize.
[2023-03-12 15:46:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1379 ms
[2023-03-12 15:46:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 311 ms.
[2023-03-12 15:46:36] [INFO ] Added : 9 causal constraints over 3 iterations in 857 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 81 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:36] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000027 steps, including 2 resets, run finished after 1449 ms. (steps per millisecond=690 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1781 ms. (steps per millisecond=561 ) properties (out of 1) seen :0
[2023-03-12 15:46:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:46:40] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-12 15:46:40] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:40] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2023-03-12 15:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:46:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:46:41] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-12 15:46:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:41] [INFO ] [Nat]Added 283 Read/Feed constraints in 208 ms returned sat
[2023-03-12 15:46:41] [INFO ] Deduced a trap composed of 43 places in 350 ms of which 1 ms to minimize.
[2023-03-12 15:46:42] [INFO ] Deduced a trap composed of 18 places in 297 ms of which 1 ms to minimize.
[2023-03-12 15:46:42] [INFO ] Deduced a trap composed of 59 places in 300 ms of which 13 ms to minimize.
[2023-03-12 15:46:42] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 0 ms to minimize.
[2023-03-12 15:46:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1588 ms
[2023-03-12 15:46:43] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 236 ms.
[2023-03-12 15:46:43] [INFO ] Added : 9 causal constraints over 3 iterations in 821 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 100 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:46:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:44] [INFO ] Invariant cache hit.
[2023-03-12 15:46:44] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-12 15:46:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:44] [INFO ] Invariant cache hit.
[2023-03-12 15:46:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:46:46] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2455 ms to find 0 implicit places.
[2023-03-12 15:46:46] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-12 15:46:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:46:46] [INFO ] Invariant cache hit.
[2023-03-12 15:46:47] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3827 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-14 in 14926 ms.
[2023-03-12 15:46:48] [INFO ] Flatten gal took : 360 ms
[2023-03-12 15:46:48] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 15:46:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 19 ms.
Total runtime 112081 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/811/ub_0_ --maxsum=/tmp/811/ub_1_ --maxsum=/tmp/811/ub_2_ --maxsum=/tmp/811/ub_3_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15687148 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16079364 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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-q8m032"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q8m032, 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 r041-tajo-167813694700421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m032.tgz
mv BugTracking-PT-q8m032 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;