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-167814481200453.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-30b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 103K 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-30b-UpperBounds-00
FORMULA_NAME DES-PT-30b-UpperBounds-01
FORMULA_NAME DES-PT-30b-UpperBounds-02
FORMULA_NAME DES-PT-30b-UpperBounds-03
FORMULA_NAME DES-PT-30b-UpperBounds-04
FORMULA_NAME DES-PT-30b-UpperBounds-05
FORMULA_NAME DES-PT-30b-UpperBounds-06
FORMULA_NAME DES-PT-30b-UpperBounds-07
FORMULA_NAME DES-PT-30b-UpperBounds-08
FORMULA_NAME DES-PT-30b-UpperBounds-09
FORMULA_NAME DES-PT-30b-UpperBounds-10
FORMULA_NAME DES-PT-30b-UpperBounds-11
FORMULA_NAME DES-PT-30b-UpperBounds-12
FORMULA_NAME DES-PT-30b-UpperBounds-13
FORMULA_NAME DES-PT-30b-UpperBounds-14
FORMULA_NAME DES-PT-30b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678303025964

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-30b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:17:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 19:17:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:17:07] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-08 19:17:07] [INFO ] Transformed 399 places.
[2023-03-08 19:17:07] [INFO ] Transformed 350 transitions.
[2023-03-08 19:17:07] [INFO ] Found NUPN structural information;
[2023-03-08 19:17:07] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 350 rows 399 cols
[2023-03-08 19:17:07] [INFO ] Computed 65 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 84 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :12
FORMULA DES-PT-30b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
[2023-03-08 19:17:07] [INFO ] Invariant cache hit.
[2023-03-08 19:17:08] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 19:17:08] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 19:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:08] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-08 19:17:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-08 19:17:08] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 19:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:08] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2023-03-08 19:17:09] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2023-03-08 19:17:09] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2023-03-08 19:17:09] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2023-03-08 19:17:09] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2023-03-08 19:17:09] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2023-03-08 19:17:09] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2023-03-08 19:17:09] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-08 19:17:09] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-08 19:17:10] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2023-03-08 19:17:10] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2023-03-08 19:17:10] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2023-03-08 19:17:10] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2023-03-08 19:17:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1432 ms
[2023-03-08 19:17:10] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 27 ms.
[2023-03-08 19:17:12] [INFO ] Added : 311 causal constraints over 63 iterations in 2386 ms. Result :sat
Minimization took 243 ms.
[2023-03-08 19:17:13] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 19:17:13] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 19:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:13] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-08 19:17:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:13] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 19:17:13] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 19:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:13] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-08 19:17:13] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2023-03-08 19:17:13] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2023-03-08 19:17:13] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 0 ms to minimize.
[2023-03-08 19:17:14] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2023-03-08 19:17:14] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-08 19:17:14] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-08 19:17:14] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2023-03-08 19:17:14] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2023-03-08 19:17:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1181 ms
[2023-03-08 19:17:14] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 20 ms.
[2023-03-08 19:17:17] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2023-03-08 19:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-08 19:17:17] [INFO ] Added : 327 causal constraints over 66 iterations in 2651 ms. Result :sat
Minimization took 315 ms.
[2023-03-08 19:17:17] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-08 19:17:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 19:17:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:17] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-08 19:17:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:18] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 19:17:18] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 19:17:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:18] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-08 19:17:18] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-08 19:17:18] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2023-03-08 19:17:18] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-08 19:17:18] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2023-03-08 19:17:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 341 ms
[2023-03-08 19:17:18] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 20 ms.
[2023-03-08 19:17:20] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-03-08 19:17:20] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2023-03-08 19:17:20] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2023-03-08 19:17:20] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2023-03-08 19:17:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 389 ms
[2023-03-08 19:17:21] [INFO ] Added : 278 causal constraints over 56 iterations in 2507 ms. Result :sat
Minimization took 166 ms.
[2023-03-08 19:17:21] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 19:17:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 19:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:21] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-08 19:17:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 19:17:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 312 ms returned sat
[2023-03-08 19:17:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:23] [INFO ] [Nat]Absence check using state equation in 2053 ms returned sat
[2023-03-08 19:17:24] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-08 19:17:24] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2023-03-08 19:17:24] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2023-03-08 19:17:24] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-08 19:17:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-08 19:17:24] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 4 ms to minimize.
[2023-03-08 19:17:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2023-03-08 19:17:24] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2023-03-08 19:17:25] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2023-03-08 19:17:25] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 0 ms to minimize.
[2023-03-08 19:17:25] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 0 ms to minimize.
[2023-03-08 19:17:25] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 0 ms to minimize.
[2023-03-08 19:17:25] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 0 ms to minimize.
[2023-03-08 19:17:25] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2023-03-08 19:17:25] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2023-03-08 19:17:25] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 0 ms to minimize.
[2023-03-08 19:17:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1705 ms
[2023-03-08 19:17:25] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-08 19:17:26] [INFO ] Added : 160 causal constraints over 32 iterations in 846 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 392 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 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 392 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 371 transition count 323
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 371 transition count 314
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 362 transition count 314
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 343 transition count 295
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 343 transition count 295
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 343 transition count 294
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 342 transition count 294
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 327 transition count 279
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 327 transition count 279
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 327 transition count 264
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 325 transition count 263
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 325 transition count 260
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 322 transition count 260
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 245 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 243 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 243 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 242 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 241 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 240 transition count 183
Applied a total of 319 rules in 150 ms. Remains 240 /399 variables (removed 159) and now considering 183/350 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 240/399 places, 183/350 transitions.
// Phase 1: matrix 183 rows 240 cols
[2023-03-08 19:17:29] [INFO ] Computed 63 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47578 resets, run finished after 1831 ms. (steps per millisecond=546 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9025 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9268 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9135 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9039 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 4) seen :0
[2023-03-08 19:17:34] [INFO ] Invariant cache hit.
[2023-03-08 19:17:34] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:34] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:34] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-08 19:17:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:34] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:34] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-08 19:17:34] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-08 19:17:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-08 19:17:34] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:17:35] [INFO ] Added : 149 causal constraints over 30 iterations in 474 ms. Result :sat
Minimization took 59 ms.
[2023-03-08 19:17:35] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:17:35] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:35] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-08 19:17:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:35] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:35] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-08 19:17:35] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2023-03-08 19:17:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-08 19:17:35] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:17:36] [INFO ] Added : 116 causal constraints over 24 iterations in 346 ms. Result :sat
Minimization took 47 ms.
[2023-03-08 19:17:36] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:36] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-08 19:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:36] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-08 19:17:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:36] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-08 19:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:36] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-08 19:17:36] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 19:17:36] [INFO ] Added : 94 causal constraints over 19 iterations in 298 ms. Result :sat
Minimization took 48 ms.
[2023-03-08 19:17:36] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:36] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:36] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-08 19:17:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:17:36] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 20 ms returned sat
[2023-03-08 19:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:36] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-08 19:17:36] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:17:37] [INFO ] Added : 101 causal constraints over 21 iterations in 280 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 11 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 240/240 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 9 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-08 19:17:38] [INFO ] Invariant cache hit.
[2023-03-08 19:17:38] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 19:17:38] [INFO ] Invariant cache hit.
[2023-03-08 19:17:38] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-08 19:17:38] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 19:17:38] [INFO ] Invariant cache hit.
[2023-03-08 19:17:38] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 240/240 places, 183/183 transitions.
Starting property specific reduction for DES-PT-30b-UpperBounds-04
[2023-03-08 19:17:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 467 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-08 19:17:38] [INFO ] Invariant cache hit.
[2023-03-08 19:17:38] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:17:38] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:38] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-08 19:17:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:17:38] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 19:17:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:38] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-08 19:17:39] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2023-03-08 19:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-08 19:17:39] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 19:17:39] [INFO ] Added : 149 causal constraints over 30 iterations in 468 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 9 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 240/240 places, 183/183 transitions.
[2023-03-08 19:17:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47636 resets, run finished after 1858 ms. (steps per millisecond=538 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9061 resets, run finished after 910 ms. (steps per millisecond=1098 ) properties (out of 1) seen :0
[2023-03-08 19:17:42] [INFO ] Invariant cache hit.
[2023-03-08 19:17:42] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:42] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:42] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-08 19:17:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:17:42] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 19:17:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:42] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-08 19:17:42] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-08 19:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-08 19:17:42] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:17:43] [INFO ] Added : 149 causal constraints over 30 iterations in 473 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 8 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 240/240 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-08 19:17:43] [INFO ] Invariant cache hit.
[2023-03-08 19:17:43] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 19:17:43] [INFO ] Invariant cache hit.
[2023-03-08 19:17:44] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-03-08 19:17:44] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 19:17:44] [INFO ] Invariant cache hit.
[2023-03-08 19:17:44] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 543 ms. Remains : 240/240 places, 183/183 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-04 in 5590 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-07
[2023-03-08 19:17:44] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 461 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-08 19:17:44] [INFO ] Invariant cache hit.
[2023-03-08 19:17:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:44] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-08 19:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:44] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-08 19:17:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:44] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:44] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-08 19:17:44] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2023-03-08 19:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-08 19:17:44] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 19:17:44] [INFO ] Added : 116 causal constraints over 24 iterations in 331 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Graph (complete) has 803 edges and 240 vertex of which 236 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 236 transition count 182
Applied a total of 2 rules in 13 ms. Remains 236 /240 variables (removed 4) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 19:17:45] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 47870 resets, run finished after 1830 ms. (steps per millisecond=546 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9163 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties (out of 1) seen :0
[2023-03-08 19:17:47] [INFO ] Invariant cache hit.
[2023-03-08 19:17:47] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 19:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:48] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-08 19:17:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-08 19:17:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:48] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-08 19:17:48] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:17:48] [INFO ] Added : 119 causal constraints over 24 iterations in 323 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 19:17:48] [INFO ] Invariant cache hit.
[2023-03-08 19:17:48] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 19:17:48] [INFO ] Invariant cache hit.
[2023-03-08 19:17:49] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-08 19:17:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:17:49] [INFO ] Invariant cache hit.
[2023-03-08 19:17:49] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-07 in 5056 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-14
// Phase 1: matrix 183 rows 240 cols
[2023-03-08 19:17:49] [INFO ] Computed 63 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 489 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 91 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-08 19:17:49] [INFO ] Invariant cache hit.
[2023-03-08 19:17:49] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:49] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:49] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-08 19:17:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:49] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:49] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-08 19:17:49] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:17:49] [INFO ] Added : 94 causal constraints over 19 iterations in 293 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Graph (complete) has 803 edges and 240 vertex of which 236 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 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 236 transition count 182
Applied a total of 2 rules in 12 ms. Remains 236 /240 variables (removed 4) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 19:17:50] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47575 resets, run finished after 1801 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8918 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 1) seen :0
[2023-03-08 19:17:52] [INFO ] Invariant cache hit.
[2023-03-08 19:17:52] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 19:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:52] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 19:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2023-03-08 19:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:53] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-08 19:17:53] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 19:17:53] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 2 ms to minimize.
[2023-03-08 19:17:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-08 19:17:53] [INFO ] Added : 119 causal constraints over 24 iterations in 418 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 19:17:53] [INFO ] Invariant cache hit.
[2023-03-08 19:17:54] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 19:17:54] [INFO ] Invariant cache hit.
[2023-03-08 19:17:54] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-08 19:17:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:17:54] [INFO ] Invariant cache hit.
[2023-03-08 19:17:54] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-14 in 5082 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-15
// Phase 1: matrix 183 rows 240 cols
[2023-03-08 19:17:54] [INFO ] Computed 63 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 491 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-08 19:17:54] [INFO ] Invariant cache hit.
[2023-03-08 19:17:54] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:54] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:54] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-08 19:17:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:17:54] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 19:17:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:54] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-08 19:17:54] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 19:17:54] [INFO ] Added : 101 causal constraints over 21 iterations in 291 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 183/183 transitions.
Graph (complete) has 803 edges and 240 vertex of which 236 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 236 transition count 182
Applied a total of 2 rules in 12 ms. Remains 236 /240 variables (removed 4) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 19:17:55] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 47952 resets, run finished after 1832 ms. (steps per millisecond=545 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9110 resets, run finished after 907 ms. (steps per millisecond=1102 ) properties (out of 1) seen :0
[2023-03-08 19:17:57] [INFO ] Invariant cache hit.
[2023-03-08 19:17:57] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:17:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 19:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:58] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-08 19:17:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:17:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:17:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2023-03-08 19:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:17:58] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-08 19:17:58] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-08 19:17:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-08 19:17:58] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 19:17:58] [INFO ] Added : 111 causal constraints over 23 iterations in 350 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 19:17:58] [INFO ] Invariant cache hit.
[2023-03-08 19:17:59] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 19:17:59] [INFO ] Invariant cache hit.
[2023-03-08 19:17:59] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-08 19:17:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:17:59] [INFO ] Invariant cache hit.
[2023-03-08 19:17:59] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-15 in 5055 ms.
[2023-03-08 19:17:59] [INFO ] Flatten gal took : 49 ms
[2023-03-08 19:17:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 19:17:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 240 places, 183 transitions and 901 arcs took 2 ms.
Total runtime 52212 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/794/ub_0_ --maxsum=/tmp/794/ub_1_ --maxsum=/tmp/794/ub_2_ --maxsum=/tmp/794/ub_3_
FORMULA DES-PT-30b-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-30b-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678304464119

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DES-PT-30b-UpperBounds-04
ub formula formula --maxsum=/tmp/794/ub_0_
ub formula name DES-PT-30b-UpperBounds-07
ub formula formula --maxsum=/tmp/794/ub_1_
ub formula name DES-PT-30b-UpperBounds-14
ub formula formula --maxsum=/tmp/794/ub_2_
ub formula name DES-PT-30b-UpperBounds-15
ub formula formula --maxsum=/tmp/794/ub_3_
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 240 places, 183 transitions and 901 arcs
pnml2lts-sym: Petri net DES_PT_30b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 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: 183->177 groups
pnml2lts-sym: Regrouping took 0.030 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 240; there are 177 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: 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: 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 135076282 group checks and 0 next state calls
pnml2lts-sym: reachability took 1375.700 real 5494.540 user 4.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 1.080 real 4.320 user 0.000 sys
pnml2lts-sym: state space has 23688949534766 states, 14671946 nodes
pnml2lts-sym: Maximum sum of /tmp/794/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/794/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/794/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/794/ub_3_ is: 1
pnml2lts-sym: group_next: 1913 nodes total
pnml2lts-sym: group_explored: 2049 nodes, 2734 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-30b"
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-30b, 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-167814481200453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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