Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481300501.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DES-PT-60b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481300501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 139K 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 DES-PT-60b-UpperBounds-00
FORMULA_NAME DES-PT-60b-UpperBounds-01
FORMULA_NAME DES-PT-60b-UpperBounds-02
FORMULA_NAME DES-PT-60b-UpperBounds-03
FORMULA_NAME DES-PT-60b-UpperBounds-04
FORMULA_NAME DES-PT-60b-UpperBounds-05
FORMULA_NAME DES-PT-60b-UpperBounds-06
FORMULA_NAME DES-PT-60b-UpperBounds-07
FORMULA_NAME DES-PT-60b-UpperBounds-08
FORMULA_NAME DES-PT-60b-UpperBounds-09
FORMULA_NAME DES-PT-60b-UpperBounds-10
FORMULA_NAME DES-PT-60b-UpperBounds-11
FORMULA_NAME DES-PT-60b-UpperBounds-12
FORMULA_NAME DES-PT-60b-UpperBounds-13
FORMULA_NAME DES-PT-60b-UpperBounds-14
FORMULA_NAME DES-PT-60b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678315147649

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=DES-PT-60b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 22:39:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 22:39:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:39:09] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-08 22:39:09] [INFO ] Transformed 519 places.
[2023-03-08 22:39:09] [INFO ] Transformed 470 transitions.
[2023-03-08 22:39:09] [INFO ] Found NUPN structural information;
[2023-03-08 22:39:09] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 470 rows 519 cols
[2023-03-08 22:39:09] [INFO ] Computed 65 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 81 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :7
FORMULA DES-PT-60b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
[2023-03-08 22:39:09] [INFO ] Invariant cache hit.
[2023-03-08 22:39:09] [INFO ] [Real]Absence check using 39 positive place invariants in 21 ms returned sat
[2023-03-08 22:39:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 23 ms returned sat
[2023-03-08 22:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:09] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-08 22:39:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:39:10] [INFO ] [Nat]Absence check using 39 positive place invariants in 19 ms returned sat
[2023-03-08 22:39:10] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 534 ms returned sat
[2023-03-08 22:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:11] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2023-03-08 22:39:11] [INFO ] Deduced a trap composed of 36 places in 645 ms of which 5 ms to minimize.
[2023-03-08 22:39:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 701 ms
[2023-03-08 22:39:12] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 33 ms.
[2023-03-08 22:39:15] [INFO ] Added : 10 causal constraints over 2 iterations in 2982 ms. Result :unknown
[2023-03-08 22:39:15] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-08 22:39:15] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-08 22:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:15] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-08 22:39:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:39:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-08 22:39:15] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-08 22:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:15] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2023-03-08 22:39:15] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-08 22:39:16] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-08 22:39:16] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2023-03-08 22:39:16] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2023-03-08 22:39:16] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-08 22:39:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 668 ms
[2023-03-08 22:39:16] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 28 ms.
[2023-03-08 22:39:19] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2023-03-08 22:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-08 22:39:19] [INFO ] Added : 267 causal constraints over 54 iterations in 2724 ms. Result :sat
Minimization took 847 ms.
[2023-03-08 22:39:20] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 22:39:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-08 22:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:20] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-08 22:39:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:39:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-08 22:39:20] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 200 ms returned sat
[2023-03-08 22:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:20] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-03-08 22:39:20] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2023-03-08 22:39:21] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2023-03-08 22:39:21] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2023-03-08 22:39:21] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2023-03-08 22:39:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 509 ms
[2023-03-08 22:39:21] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 30 ms.
[2023-03-08 22:39:24] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2023-03-08 22:39:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-08 22:39:24] [INFO ] Added : 371 causal constraints over 75 iterations in 3347 ms. Result :sat
Minimization took 486 ms.
[2023-03-08 22:39:25] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 22:39:25] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-08 22:39:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:25] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-08 22:39:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:39:25] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 22:39:25] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2023-03-08 22:39:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:25] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-08 22:39:25] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-08 22:39:26] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 1 ms to minimize.
[2023-03-08 22:39:26] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 0 ms to minimize.
[2023-03-08 22:39:26] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 0 ms to minimize.
[2023-03-08 22:39:26] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 0 ms to minimize.
[2023-03-08 22:39:26] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 1 ms to minimize.
[2023-03-08 22:39:26] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 0 ms to minimize.
[2023-03-08 22:39:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 796 ms
[2023-03-08 22:39:26] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 22 ms.
[2023-03-08 22:39:30] [INFO ] Added : 380 causal constraints over 76 iterations in 3859 ms. Result :unknown
[2023-03-08 22:39:30] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-08 22:39:30] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-08 22:39:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:30] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-08 22:39:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:39:30] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 22:39:31] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 460 ms returned sat
[2023-03-08 22:39:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:31] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2023-03-08 22:39:32] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2023-03-08 22:39:33] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-08 22:39:33] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2023-03-08 22:39:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1528 ms
[2023-03-08 22:39:33] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 24 ms.
[2023-03-08 22:39:35] [INFO ] Added : 210 causal constraints over 42 iterations in 2368 ms. Result :unknown
[2023-03-08 22:39:35] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 22:39:35] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-08 22:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:36] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-08 22:39:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:39:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-08 22:39:36] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 490 ms returned sat
[2023-03-08 22:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:37] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2023-03-08 22:39:37] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2023-03-08 22:39:37] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-08 22:39:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2023-03-08 22:39:37] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 27 ms.
[2023-03-08 22:39:40] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2023-03-08 22:39:40] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2023-03-08 22:39:40] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 0 ms to minimize.
[2023-03-08 22:39:40] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2023-03-08 22:39:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 471 ms
[2023-03-08 22:39:40] [INFO ] Added : 291 causal constraints over 59 iterations in 3541 ms. Result :sat
Minimization took 136 ms.
[2023-03-08 22:39:41] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 22:39:41] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-08 22:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:41] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-08 22:39:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:39:41] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-08 22:39:41] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-08 22:39:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:41] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-08 22:39:41] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 26 ms.
[2023-03-08 22:39:44] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-08 22:39:44] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2023-03-08 22:39:45] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-08 22:39:45] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2023-03-08 22:39:45] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2023-03-08 22:39:45] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2023-03-08 22:39:45] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2023-03-08 22:39:45] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2023-03-08 22:39:45] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2023-03-08 22:39:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1336 ms
[2023-03-08 22:39:46] [INFO ] Added : 255 causal constraints over 52 iterations in 4223 ms. Result :sat
Minimization took 259 ms.
[2023-03-08 22:39:46] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 22:39:46] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-08 22:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:46] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-08 22:39:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:39:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-08 22:39:46] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 21 ms returned sat
[2023-03-08 22:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:46] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-08 22:39:47] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2023-03-08 22:39:47] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2023-03-08 22:39:47] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2023-03-08 22:39:47] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2023-03-08 22:39:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 244 ms
[2023-03-08 22:39:47] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 22 ms.
[2023-03-08 22:39:50] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 0 ms to minimize.
[2023-03-08 22:39:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-08 22:39:50] [INFO ] Added : 456 causal constraints over 92 iterations in 3659 ms. Result :sat
Minimization took 168 ms.
[2023-03-08 22:39:51] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 22:39:51] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2023-03-08 22:39:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:51] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2023-03-08 22:39:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:39:51] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-08 22:39:52] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 904 ms returned sat
[2023-03-08 22:39:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:39:53] [INFO ] [Nat]Absence check using state equation in 1030 ms returned sat
[2023-03-08 22:39:53] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2023-03-08 22:39:54] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-08 22:39:54] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2023-03-08 22:39:54] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-08 22:39:54] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2023-03-08 22:39:54] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-08 22:39:54] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2023-03-08 22:39:54] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-03-08 22:39:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1506 ms
[2023-03-08 22:39:54] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 25 ms.
[2023-03-08 22:39:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 470/470 transitions.
Graph (complete) has 1218 edges and 519 vertex of which 513 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 513 transition count 443
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 492 transition count 443
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 492 transition count 434
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 483 transition count 434
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 464 transition count 415
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 464 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 464 transition count 414
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 463 transition count 414
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 448 transition count 399
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 448 transition count 399
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 448 transition count 384
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 446 transition count 383
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 446 transition count 380
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 443 transition count 380
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 366 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 364 transition count 305
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 364 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 363 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 362 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 361 transition count 303
Applied a total of 319 rules in 242 ms. Remains 361 /519 variables (removed 158) and now considering 303/470 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 361/519 places, 303/470 transitions.
// Phase 1: matrix 303 rows 361 cols
[2023-03-08 22:40:04] [INFO ] Computed 64 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 47804 resets, run finished after 2029 ms. (steps per millisecond=492 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9203 resets, run finished after 877 ms. (steps per millisecond=1140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9151 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9161 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9114 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8998 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9173 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9111 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9218 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9085 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 9) seen :0
[2023-03-08 22:40:14] [INFO ] Invariant cache hit.
[2023-03-08 22:40:14] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:14] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:14] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-08 22:40:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-08 22:40:14] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 22:40:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:15] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-08 22:40:15] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:40:15] [INFO ] Added : 70 causal constraints over 14 iterations in 315 ms. Result :sat
Minimization took 54 ms.
[2023-03-08 22:40:15] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:15] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:15] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-08 22:40:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:15] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:40:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:15] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-08 22:40:15] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:40:16] [INFO ] Added : 119 causal constraints over 24 iterations in 595 ms. Result :sat
Minimization took 65 ms.
[2023-03-08 22:40:16] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:16] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 22:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:16] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-08 22:40:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:16] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:16] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 22:40:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:16] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-08 22:40:16] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:40:17] [INFO ] Added : 203 causal constraints over 41 iterations in 939 ms. Result :sat
Minimization took 90 ms.
[2023-03-08 22:40:18] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:18] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:18] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-08 22:40:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 9 ms returned sat
[2023-03-08 22:40:18] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:18] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-08 22:40:18] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:40:18] [INFO ] Added : 81 causal constraints over 17 iterations in 378 ms. Result :sat
Minimization took 135 ms.
[2023-03-08 22:40:18] [INFO ] [Real]Absence check using 39 positive place invariants in 10 ms returned sat
[2023-03-08 22:40:18] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 22:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:19] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-08 22:40:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 9 ms returned sat
[2023-03-08 22:40:19] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:19] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-08 22:40:19] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 22:40:19] [INFO ] Added : 89 causal constraints over 18 iterations in 597 ms. Result :sat
Minimization took 55 ms.
[2023-03-08 22:40:19] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:19] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:20] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-08 22:40:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 10 ms returned sat
[2023-03-08 22:40:20] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:20] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-08 22:40:20] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 22:40:20] [INFO ] Added : 135 causal constraints over 27 iterations in 578 ms. Result :sat
Minimization took 116 ms.
[2023-03-08 22:40:21] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:21] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:21] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 22:40:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:21] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:21] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-08 22:40:21] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 22:40:21] [INFO ] Added : 73 causal constraints over 15 iterations in 328 ms. Result :sat
Minimization took 53 ms.
[2023-03-08 22:40:21] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:21] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 22:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:21] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-03-08 22:40:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:22] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:22] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:22] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-08 22:40:22] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-08 22:40:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-08 22:40:22] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 22:40:23] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-08 22:40:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-08 22:40:23] [INFO ] Added : 288 causal constraints over 58 iterations in 1396 ms. Result :sat
Minimization took 87 ms.
[2023-03-08 22:40:23] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:23] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:23] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-08 22:40:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:23] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:24] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-08 22:40:24] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2023-03-08 22:40:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-08 22:40:24] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:40:24] [INFO ] Added : 156 causal constraints over 32 iterations in 711 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Applied a total of 0 rules in 28 ms. Remains 361 /361 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 361/361 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2023-03-08 22:40:27] [INFO ] Invariant cache hit.
[2023-03-08 22:40:27] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-08 22:40:27] [INFO ] Invariant cache hit.
[2023-03-08 22:40:28] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2023-03-08 22:40:28] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-08 22:40:28] [INFO ] Invariant cache hit.
[2023-03-08 22:40:28] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 877 ms. Remains : 361/361 places, 303/303 transitions.
Starting property specific reduction for DES-PT-60b-UpperBounds-00
[2023-03-08 22:40:28] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 481 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 22:40:28] [INFO ] Invariant cache hit.
[2023-03-08 22:40:28] [INFO ] [Real]Absence check using 39 positive place invariants in 9 ms returned sat
[2023-03-08 22:40:28] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:40:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:28] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-08 22:40:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:28] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 22:40:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:28] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-08 22:40:28] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 22:40:29] [INFO ] Added : 70 causal constraints over 14 iterations in 289 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Graph (complete) has 1257 edges and 361 vertex of which 356 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 24 ms. Remains 356 /361 variables (removed 5) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 356/361 places, 302/303 transitions.
// Phase 1: matrix 302 rows 356 cols
[2023-03-08 22:40:29] [INFO ] Computed 60 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 47692 resets, run finished after 1925 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9056 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 1) seen :0
[2023-03-08 22:40:32] [INFO ] Invariant cache hit.
[2023-03-08 22:40:32] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 22:40:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 22:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:32] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-08 22:40:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:40:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2023-03-08 22:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:32] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2023-03-08 22:40:32] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:40:33] [INFO ] Added : 136 causal constraints over 28 iterations in 741 ms. Result :sat
Minimization took 309 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2023-03-08 22:40:33] [INFO ] Invariant cache hit.
[2023-03-08 22:40:34] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 22:40:34] [INFO ] Invariant cache hit.
[2023-03-08 22:40:34] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2023-03-08 22:40:34] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 22:40:34] [INFO ] Invariant cache hit.
[2023-03-08 22:40:34] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 737 ms. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-00 in 6197 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-02
// Phase 1: matrix 303 rows 361 cols
[2023-03-08 22:40:34] [INFO ] Computed 64 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 447 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-08 22:40:34] [INFO ] Invariant cache hit.
[2023-03-08 22:40:34] [INFO ] [Real]Absence check using 39 positive place invariants in 7 ms returned sat
[2023-03-08 22:40:34] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:34] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-08 22:40:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:34] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:34] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:34] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-08 22:40:35] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 22:40:35] [INFO ] Added : 119 causal constraints over 24 iterations in 561 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Graph (complete) has 1257 edges and 361 vertex of which 356 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 22 ms. Remains 356 /361 variables (removed 5) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 356/361 places, 302/303 transitions.
// Phase 1: matrix 302 rows 356 cols
[2023-03-08 22:40:36] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47938 resets, run finished after 1909 ms. (steps per millisecond=523 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9157 resets, run finished after 883 ms. (steps per millisecond=1132 ) properties (out of 1) seen :0
[2023-03-08 22:40:38] [INFO ] Invariant cache hit.
[2023-03-08 22:40:38] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 22:40:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 22:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:39] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-08 22:40:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 22:40:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 96 ms returned sat
[2023-03-08 22:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:39] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-08 22:40:39] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-08 22:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-08 22:40:39] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 22:40:40] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2023-03-08 22:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-08 22:40:40] [INFO ] Added : 187 causal constraints over 38 iterations in 1019 ms. Result :sat
Minimization took 223 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2023-03-08 22:40:41] [INFO ] Invariant cache hit.
[2023-03-08 22:40:41] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 22:40:41] [INFO ] Invariant cache hit.
[2023-03-08 22:40:41] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2023-03-08 22:40:41] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 22:40:41] [INFO ] Invariant cache hit.
[2023-03-08 22:40:41] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 763 ms. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-02 in 7261 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-03
// Phase 1: matrix 303 rows 361 cols
[2023-03-08 22:40:41] [INFO ] Computed 64 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 470 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 22:40:41] [INFO ] Invariant cache hit.
[2023-03-08 22:40:41] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:41] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 22:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:42] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 22:40:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 9 ms returned sat
[2023-03-08 22:40:42] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 22:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:42] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-08 22:40:42] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 22:40:43] [INFO ] Added : 203 causal constraints over 41 iterations in 888 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Graph (complete) has 1257 edges and 361 vertex of which 356 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 19 ms. Remains 356 /361 variables (removed 5) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 356/361 places, 302/303 transitions.
// Phase 1: matrix 302 rows 356 cols
[2023-03-08 22:40:43] [INFO ] Computed 60 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 47914 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9127 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 1) seen :0
[2023-03-08 22:40:46] [INFO ] Invariant cache hit.
[2023-03-08 22:40:46] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 22:40:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 22:40:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:46] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-08 22:40:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:40:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 22:40:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:47] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2023-03-08 22:40:47] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 22:40:48] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2023-03-08 22:40:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-08 22:40:48] [INFO ] Added : 269 causal constraints over 54 iterations in 1408 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 16 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2023-03-08 22:40:49] [INFO ] Invariant cache hit.
[2023-03-08 22:40:49] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-08 22:40:49] [INFO ] Invariant cache hit.
[2023-03-08 22:40:49] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2023-03-08 22:40:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:40:49] [INFO ] Invariant cache hit.
[2023-03-08 22:40:50] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-03 in 8147 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-05
// Phase 1: matrix 303 rows 361 cols
[2023-03-08 22:40:50] [INFO ] Computed 64 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 476 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 22:40:50] [INFO ] Invariant cache hit.
[2023-03-08 22:40:50] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:50] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:50] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 22:40:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:50] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 22:40:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:50] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-08 22:40:50] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:40:50] [INFO ] Added : 81 causal constraints over 17 iterations in 385 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Graph (complete) has 1257 edges and 361 vertex of which 356 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 17 ms. Remains 356 /361 variables (removed 5) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 356/361 places, 302/303 transitions.
// Phase 1: matrix 302 rows 356 cols
[2023-03-08 22:40:51] [INFO ] Computed 60 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 47803 resets, run finished after 1961 ms. (steps per millisecond=509 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9094 resets, run finished after 897 ms. (steps per millisecond=1114 ) properties (out of 1) seen :0
[2023-03-08 22:40:54] [INFO ] Invariant cache hit.
[2023-03-08 22:40:54] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 22:40:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 22:40:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:54] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-08 22:40:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 22:40:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 97 ms returned sat
[2023-03-08 22:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:54] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2023-03-08 22:40:54] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 18 ms.
[2023-03-08 22:40:55] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 4 ms to minimize.
[2023-03-08 22:40:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-08 22:40:55] [INFO ] Added : 148 causal constraints over 30 iterations in 731 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 16 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 13 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2023-03-08 22:40:55] [INFO ] Invariant cache hit.
[2023-03-08 22:40:56] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 22:40:56] [INFO ] Invariant cache hit.
[2023-03-08 22:40:56] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-08 22:40:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:40:56] [INFO ] Invariant cache hit.
[2023-03-08 22:40:56] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 746 ms. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-05 in 6696 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-07
// Phase 1: matrix 303 rows 361 cols
[2023-03-08 22:40:56] [INFO ] Computed 64 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 483 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 22:40:56] [INFO ] Invariant cache hit.
[2023-03-08 22:40:56] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:56] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:56] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 22:40:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:40:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:40:57] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:40:57] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-08 22:40:57] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 18 ms.
[2023-03-08 22:40:57] [INFO ] Added : 89 causal constraints over 18 iterations in 575 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Graph (complete) has 1257 edges and 361 vertex of which 356 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 18 ms. Remains 356 /361 variables (removed 5) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 356/361 places, 302/303 transitions.
// Phase 1: matrix 302 rows 356 cols
[2023-03-08 22:40:57] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47718 resets, run finished after 1894 ms. (steps per millisecond=527 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9088 resets, run finished after 875 ms. (steps per millisecond=1142 ) properties (out of 1) seen :0
[2023-03-08 22:41:00] [INFO ] Invariant cache hit.
[2023-03-08 22:41:00] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:41:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 22:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:00] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-08 22:41:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:41:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:41:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 147 ms returned sat
[2023-03-08 22:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:01] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2023-03-08 22:41:01] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 22:41:02] [INFO ] Added : 121 causal constraints over 25 iterations in 643 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2023-03-08 22:41:02] [INFO ] Invariant cache hit.
[2023-03-08 22:41:03] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-08 22:41:03] [INFO ] Invariant cache hit.
[2023-03-08 22:41:03] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-08 22:41:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:41:03] [INFO ] Invariant cache hit.
[2023-03-08 22:41:03] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 745 ms. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-07 in 6881 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-08
// Phase 1: matrix 303 rows 361 cols
[2023-03-08 22:41:03] [INFO ] Computed 64 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 481 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 22:41:03] [INFO ] Invariant cache hit.
[2023-03-08 22:41:03] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:41:03] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:03] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 22:41:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:41:03] [INFO ] [Nat]Absence check using 39 positive place invariants in 9 ms returned sat
[2023-03-08 22:41:03] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 22:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:04] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-08 22:41:04] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 22:41:04] [INFO ] Added : 135 causal constraints over 27 iterations in 585 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Graph (complete) has 1257 edges and 361 vertex of which 356 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 22 ms. Remains 356 /361 variables (removed 5) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 356/361 places, 302/303 transitions.
// Phase 1: matrix 302 rows 356 cols
[2023-03-08 22:41:04] [INFO ] Computed 60 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47755 resets, run finished after 1858 ms. (steps per millisecond=538 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9129 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 1) seen :0
[2023-03-08 22:41:07] [INFO ] Invariant cache hit.
[2023-03-08 22:41:07] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-08 22:41:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-08 22:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:07] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-08 22:41:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:41:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:41:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 135 ms returned sat
[2023-03-08 22:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:08] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2023-03-08 22:41:08] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-08 22:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 22:41:08] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 22:41:09] [INFO ] Added : 141 causal constraints over 29 iterations in 637 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2023-03-08 22:41:09] [INFO ] Invariant cache hit.
[2023-03-08 22:41:09] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 22:41:09] [INFO ] Invariant cache hit.
[2023-03-08 22:41:10] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2023-03-08 22:41:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:41:10] [INFO ] Invariant cache hit.
[2023-03-08 22:41:10] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-08 in 6599 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-11
// Phase 1: matrix 303 rows 361 cols
[2023-03-08 22:41:10] [INFO ] Computed 64 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 443 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 22:41:10] [INFO ] Invariant cache hit.
[2023-03-08 22:41:10] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:41:10] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:10] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-08 22:41:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:41:10] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:41:10] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:10] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-08 22:41:10] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 22:41:10] [INFO ] Added : 73 causal constraints over 15 iterations in 317 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Graph (complete) has 1257 edges and 361 vertex of which 356 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 16 ms. Remains 356 /361 variables (removed 5) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 356/361 places, 302/303 transitions.
// Phase 1: matrix 302 rows 356 cols
[2023-03-08 22:41:11] [INFO ] Computed 60 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47751 resets, run finished after 1914 ms. (steps per millisecond=522 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9144 resets, run finished after 881 ms. (steps per millisecond=1135 ) properties (out of 1) seen :0
[2023-03-08 22:41:13] [INFO ] Invariant cache hit.
[2023-03-08 22:41:13] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 22:41:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 22:41:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:14] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-08 22:41:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:41:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 22:41:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 113 ms returned sat
[2023-03-08 22:41:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:14] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-08 22:41:14] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 22:41:15] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2023-03-08 22:41:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 22:41:15] [INFO ] Added : 127 causal constraints over 26 iterations in 601 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 7 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2023-03-08 22:41:15] [INFO ] Invariant cache hit.
[2023-03-08 22:41:15] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 22:41:15] [INFO ] Invariant cache hit.
[2023-03-08 22:41:15] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-08 22:41:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 22:41:15] [INFO ] Invariant cache hit.
[2023-03-08 22:41:16] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 730 ms. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-11 in 5869 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-12
// Phase 1: matrix 303 rows 361 cols
[2023-03-08 22:41:16] [INFO ] Computed 64 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 471 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 22:41:16] [INFO ] Invariant cache hit.
[2023-03-08 22:41:16] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:41:16] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:16] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-08 22:41:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:41:16] [INFO ] [Nat]Absence check using 39 positive place invariants in 7 ms returned sat
[2023-03-08 22:41:16] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:16] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-08 22:41:16] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2023-03-08 22:41:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-08 22:41:16] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:41:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-03-08 22:41:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 22:41:17] [INFO ] Added : 288 causal constraints over 58 iterations in 1276 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 361/361 places, 303/303 transitions.
[2023-03-08 22:41:18] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47764 resets, run finished after 1828 ms. (steps per millisecond=547 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9163 resets, run finished after 831 ms. (steps per millisecond=1203 ) properties (out of 1) seen :0
[2023-03-08 22:41:21] [INFO ] Invariant cache hit.
[2023-03-08 22:41:21] [INFO ] [Real]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:41:21] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:21] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-08 22:41:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:41:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:41:21] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 22:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:21] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-08 22:41:21] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2023-03-08 22:41:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-08 22:41:21] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:41:22] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-08 22:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-08 22:41:22] [INFO ] Added : 288 causal constraints over 58 iterations in 1291 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Applied a total of 0 rules in 8 ms. Remains 361 /361 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 361/361 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Applied a total of 0 rules in 8 ms. Remains 361 /361 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2023-03-08 22:41:23] [INFO ] Invariant cache hit.
[2023-03-08 22:41:23] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 22:41:23] [INFO ] Invariant cache hit.
[2023-03-08 22:41:24] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-08 22:41:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:41:24] [INFO ] Invariant cache hit.
[2023-03-08 22:41:24] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 828 ms. Remains : 361/361 places, 303/303 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-12 in 8191 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-15
[2023-03-08 22:41:24] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 483 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 22:41:24] [INFO ] Invariant cache hit.
[2023-03-08 22:41:24] [INFO ] [Real]Absence check using 39 positive place invariants in 7 ms returned sat
[2023-03-08 22:41:24] [INFO ] [Real]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:24] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 22:41:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:41:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 8 ms returned sat
[2023-03-08 22:41:24] [INFO ] [Nat]Absence check using 39 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 22:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:24] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-08 22:41:24] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2023-03-08 22:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-08 22:41:24] [INFO ] Computed and/alt/rep : 289/502/289 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 22:41:25] [INFO ] Added : 156 causal constraints over 32 iterations in 688 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 303/303 transitions.
Graph (complete) has 1257 edges and 361 vertex of which 356 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 356 transition count 302
Applied a total of 2 rules in 14 ms. Remains 356 /361 variables (removed 5) and now considering 302/303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 356/361 places, 302/303 transitions.
// Phase 1: matrix 302 rows 356 cols
[2023-03-08 22:41:25] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 48022 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9172 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 1) seen :0
[2023-03-08 22:41:28] [INFO ] Invariant cache hit.
[2023-03-08 22:41:28] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:41:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 22:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:28] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-08 22:41:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:41:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 22:41:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 122 ms returned sat
[2023-03-08 22:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:41:29] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-08 22:41:29] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 22:41:29] [INFO ] Added : 158 causal constraints over 32 iterations in 733 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 7 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2023-03-08 22:41:30] [INFO ] Invariant cache hit.
[2023-03-08 22:41:30] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-08 22:41:30] [INFO ] Invariant cache hit.
[2023-03-08 22:41:30] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-08 22:41:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:41:30] [INFO ] Invariant cache hit.
[2023-03-08 22:41:31] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-15 in 6835 ms.
[2023-03-08 22:41:31] [INFO ] Flatten gal took : 64 ms
[2023-03-08 22:41:31] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 22:41:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 361 places, 303 transitions and 1472 arcs took 3 ms.
Total runtime 142226 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/1046/ub_0_ --maxsum=/tmp/1046/ub_1_ --maxsum=/tmp/1046/ub_2_ --maxsum=/tmp/1046/ub_3_ --maxsum=/tmp/1046/ub_4_ --maxsum=/tmp/1046/ub_5_ --maxsum=/tmp/1046/ub_6_ --maxsum=/tmp/1046/ub_7_ --maxsum=/tmp/1046/ub_8_
FORMULA DES-PT-60b-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60b-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60b-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60b-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60b-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60b-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60b-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60b-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60b-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678315378901

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
ub formula name DES-PT-60b-UpperBounds-00
ub formula formula --maxsum=/tmp/1046/ub_0_
ub formula name DES-PT-60b-UpperBounds-02
ub formula formula --maxsum=/tmp/1046/ub_1_
ub formula name DES-PT-60b-UpperBounds-03
ub formula formula --maxsum=/tmp/1046/ub_2_
ub formula name DES-PT-60b-UpperBounds-05
ub formula formula --maxsum=/tmp/1046/ub_3_
ub formula name DES-PT-60b-UpperBounds-07
ub formula formula --maxsum=/tmp/1046/ub_4_
ub formula name DES-PT-60b-UpperBounds-08
ub formula formula --maxsum=/tmp/1046/ub_5_
ub formula name DES-PT-60b-UpperBounds-11
ub formula formula --maxsum=/tmp/1046/ub_6_
ub formula name DES-PT-60b-UpperBounds-12
ub formula formula --maxsum=/tmp/1046/ub_7_
ub formula name DES-PT-60b-UpperBounds-15
ub formula formula --maxsum=/tmp/1046/ub_8_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 361 places, 303 transitions and 1472 arcs
pnml2lts-sym: Petri net DES_PT_60b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 303->297 groups
pnml2lts-sym: Regrouping took 0.070 real 0.070 user 0.010 sys
pnml2lts-sym: state vector length is 361; there are 297 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 26909402 group checks and 0 next state calls
pnml2lts-sym: reachability took 80.610 real 321.500 user 0.720 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.140 real 0.580 user 0.000 sys
pnml2lts-sym: state space has 100560570483806 states, 891225 nodes
pnml2lts-sym: Maximum sum of /tmp/1046/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/1046/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/1046/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/1046/ub_3_ is: 1
pnml2lts-sym: Maximum sum of /tmp/1046/ub_4_ is: 1
pnml2lts-sym: Maximum sum of /tmp/1046/ub_5_ is: 1
pnml2lts-sym: Maximum sum of /tmp/1046/ub_6_ is: 1
pnml2lts-sym: Maximum sum of /tmp/1046/ub_7_ is: 1
pnml2lts-sym: Maximum sum of /tmp/1046/ub_8_ is: 1
pnml2lts-sym: group_next: 3223 nodes total
pnml2lts-sym: group_explored: 3394 nodes, 3995 short vectors total
pnml2lts-sym: max token count: 1

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="DES-PT-60b"
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 DES-PT-60b, 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 r105-tall-167814481300501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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