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.r103-tall-167814478300453.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 lolaxred
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 r103-tall-167814478300453
=====================================================================

--------------------
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 1678252637997

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:17:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 05:17:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:17:19] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-08 05:17:19] [INFO ] Transformed 399 places.
[2023-03-08 05:17:19] [INFO ] Transformed 350 transitions.
[2023-03-08 05:17:19] [INFO ] Found NUPN structural information;
[2023-03-08 05:17:19] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 350 rows 399 cols
[2023-03-08 05:17:19] [INFO ] Computed 65 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 88 resets, run finished after 48 ms. (steps per millisecond=208 ) 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 10001 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 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) 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 4) seen :0
[2023-03-08 05:17:19] [INFO ] Invariant cache hit.
[2023-03-08 05:17:20] [INFO ] [Real]Absence check using 39 positive place invariants in 20 ms returned sat
[2023-03-08 05:17:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 05:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:20] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-08 05:17:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 05:17:20] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 05:17:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:20] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-08 05:17:20] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 6 ms to minimize.
[2023-03-08 05:17:20] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2023-03-08 05:17:21] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2023-03-08 05:17:21] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2023-03-08 05:17:21] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2023-03-08 05:17:21] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2023-03-08 05:17:21] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-08 05:17:21] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2023-03-08 05:17:21] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 0 ms to minimize.
[2023-03-08 05:17:21] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2023-03-08 05:17:21] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2023-03-08 05:17:22] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2023-03-08 05:17:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1363 ms
[2023-03-08 05:17:22] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 28 ms.
[2023-03-08 05:17:24] [INFO ] Added : 311 causal constraints over 63 iterations in 2293 ms. Result :sat
Minimization took 222 ms.
[2023-03-08 05:17:24] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 05:17:24] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 05:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:24] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-08 05:17:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-08 05:17:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 05:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:25] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-08 05:17:25] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2023-03-08 05:17:25] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 0 ms to minimize.
[2023-03-08 05:17:25] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2023-03-08 05:17:25] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2023-03-08 05:17:25] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-03-08 05:17:26] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2023-03-08 05:17:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2023-03-08 05:17:26] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2023-03-08 05:17:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1075 ms
[2023-03-08 05:17:26] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 18 ms.
[2023-03-08 05:17:28] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2023-03-08 05:17:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-08 05:17:28] [INFO ] Added : 327 causal constraints over 66 iterations in 2487 ms. Result :sat
Minimization took 299 ms.
[2023-03-08 05:17:29] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 05:17:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 05:17:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:29] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-08 05:17:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 05:17:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 05:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:29] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-08 05:17:29] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-08 05:17:29] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2023-03-08 05:17:29] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2023-03-08 05:17:29] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2023-03-08 05:17:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 302 ms
[2023-03-08 05:17:29] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 20 ms.
[2023-03-08 05:17:31] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2023-03-08 05:17:31] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2023-03-08 05:17:31] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2023-03-08 05:17:31] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2023-03-08 05:17:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 335 ms
[2023-03-08 05:17:32] [INFO ] Added : 278 causal constraints over 56 iterations in 2332 ms. Result :sat
Minimization took 157 ms.
[2023-03-08 05:17:32] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2023-03-08 05:17:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-08 05:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:32] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-08 05:17:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 05:17:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 296 ms returned sat
[2023-03-08 05:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:34] [INFO ] [Nat]Absence check using state equation in 1943 ms returned sat
[2023-03-08 05:17:34] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2023-03-08 05:17:34] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2023-03-08 05:17:35] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2023-03-08 05:17:35] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-08 05:17:35] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-08 05:17:35] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2023-03-08 05:17:35] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2023-03-08 05:17:35] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-03-08 05:17:35] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2023-03-08 05:17:35] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2023-03-08 05:17:35] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 0 ms to minimize.
[2023-03-08 05:17:36] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2023-03-08 05:17:36] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2023-03-08 05:17:36] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 0 ms to minimize.
[2023-03-08 05:17:36] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 0 ms to minimize.
[2023-03-08 05:17:36] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2023-03-08 05:17:36] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1655 ms
[2023-03-08 05:17:36] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-08 05:17:37] [INFO ] Added : 195 causal constraints over 39 iterations in 1025 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.1 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 2 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 1 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 1 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 144 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 144 ms. Remains : 240/399 places, 183/350 transitions.
// Phase 1: matrix 183 rows 240 cols
[2023-03-08 05:17:39] [INFO ] Computed 63 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 47869 resets, run finished after 1741 ms. (steps per millisecond=574 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9083 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9241 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9206 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9162 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 4) seen :0
[2023-03-08 05:17:44] [INFO ] Invariant cache hit.
[2023-03-08 05:17:45] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 05:17:45] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 05:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:45] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 05:17:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 05:17:45] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 05:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:45] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-08 05:17:45] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2023-03-08 05:17:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-08 05:17:45] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 05:17:45] [INFO ] Added : 149 causal constraints over 30 iterations in 471 ms. Result :sat
Minimization took 50 ms.
[2023-03-08 05:17:45] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:45] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:45] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 05:17:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:17:45] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:46] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-08 05:17:46] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2023-03-08 05:17:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-08 05:17:46] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 05:17:46] [INFO ] Added : 116 causal constraints over 24 iterations in 337 ms. Result :sat
Minimization took 44 ms.
[2023-03-08 05:17:46] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:46] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:46] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-08 05:17:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:46] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:46] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-08 05:17:46] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 05:17:47] [INFO ] Added : 94 causal constraints over 19 iterations in 284 ms. Result :sat
Minimization took 47 ms.
[2023-03-08 05:17:47] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:47] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:47] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-08 05:17:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:47] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:47] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-08 05:17:47] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 05:17:47] [INFO ] Added : 101 causal constraints over 21 iterations in 271 ms. Result :sat
Minimization took 39 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 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.
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 05:17:48] [INFO ] Invariant cache hit.
[2023-03-08 05:17:48] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 05:17:48] [INFO ] Invariant cache hit.
[2023-03-08 05:17:48] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-08 05:17:48] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 05:17:48] [INFO ] Invariant cache hit.
[2023-03-08 05:17:48] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 240/240 places, 183/183 transitions.
Starting property specific reduction for DES-PT-30b-UpperBounds-04
[2023-03-08 05:17:48] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 469 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 05:17:48] [INFO ] Invariant cache hit.
[2023-03-08 05:17:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:17:48] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:48] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-08 05:17:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:17:49] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:49] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-08 05:17:49] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-08 05:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-08 05:17:49] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 05:17:49] [INFO ] Added : 149 causal constraints over 30 iterations in 464 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 19 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 19 ms. Remains : 240/240 places, 183/183 transitions.
[2023-03-08 05:17:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47701 resets, run finished after 1722 ms. (steps per millisecond=580 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9061 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 1) seen :0
[2023-03-08 05:17:52] [INFO ] Invariant cache hit.
[2023-03-08 05:17:52] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:17:52] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:52] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-08 05:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:52] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-08 05:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:52] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-08 05:17:52] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-08 05:17:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-08 05:17:52] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 05:17:53] [INFO ] Added : 149 causal constraints over 30 iterations in 442 ms. Result :sat
Minimization took 53 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 7 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 7 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 05:17:53] [INFO ] Invariant cache hit.
[2023-03-08 05:17:53] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-08 05:17:53] [INFO ] Invariant cache hit.
[2023-03-08 05:17:53] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-03-08 05:17:53] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 05:17:53] [INFO ] Invariant cache hit.
[2023-03-08 05:17:54] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 542 ms. Remains : 240/240 places, 183/183 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-04 in 5237 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-07
[2023-03-08 05:17:54] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 472 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 05:17:54] [INFO ] Invariant cache hit.
[2023-03-08 05:17:54] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:54] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:54] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-08 05:17:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:54] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:54] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-08 05:17:54] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-08 05:17:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-08 05:17:54] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-08 05:17:54] [INFO ] Added : 116 causal constraints over 24 iterations in 335 ms. Result :sat
Minimization took 44 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 05:17:54] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47692 resets, run finished after 1648 ms. (steps per millisecond=606 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9199 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 1) seen :0
[2023-03-08 05:17:57] [INFO ] Invariant cache hit.
[2023-03-08 05:17:57] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 05:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:57] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-08 05:17:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:17:57] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 53 ms returned sat
[2023-03-08 05:17:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:57] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-08 05:17:57] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 05:17:57] [INFO ] Added : 119 causal constraints over 24 iterations in 323 ms. Result :sat
Minimization took 58 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 05:17:58] [INFO ] Invariant cache hit.
[2023-03-08 05:17:58] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 05:17:58] [INFO ] Invariant cache hit.
[2023-03-08 05:17:58] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-08 05:17:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:17:58] [INFO ] Invariant cache hit.
[2023-03-08 05:17:58] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-07 in 4606 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-14
// Phase 1: matrix 183 rows 240 cols
[2023-03-08 05:17:58] [INFO ] Computed 63 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 475 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 05:17:58] [INFO ] Invariant cache hit.
[2023-03-08 05:17:58] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:17:58] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:58] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-08 05:17:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:17:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:17:58] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:17:58] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-08 05:17:58] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 05:17:59] [INFO ] Added : 94 causal constraints over 19 iterations in 288 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.
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 24 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 24 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 05:17:59] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47742 resets, run finished after 1654 ms. (steps per millisecond=604 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9133 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 1) seen :0
[2023-03-08 05:18:01] [INFO ] Invariant cache hit.
[2023-03-08 05:18:01] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 05:18:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 05:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:18:02] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-08 05:18:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:18:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:18:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-08 05:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:18:02] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-08 05:18:02] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 05:18:02] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2023-03-08 05:18:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-08 05:18:02] [INFO ] Added : 119 causal constraints over 24 iterations in 398 ms. Result :sat
Minimization took 62 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 5 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 05:18:02] [INFO ] Invariant cache hit.
[2023-03-08 05:18:03] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-08 05:18:03] [INFO ] Invariant cache hit.
[2023-03-08 05:18:03] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-08 05:18:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:18:03] [INFO ] Invariant cache hit.
[2023-03-08 05:18:03] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-14 in 4717 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-15
// Phase 1: matrix 183 rows 240 cols
[2023-03-08 05:18:03] [INFO ] Computed 63 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 454 resets, run finished after 17 ms. (steps per millisecond=588 ) 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 05:18:03] [INFO ] Invariant cache hit.
[2023-03-08 05:18:03] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:18:03] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 19 ms returned sat
[2023-03-08 05:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:18:03] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-08 05:18:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:18:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:18:03] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:18:03] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-08 05:18:03] [INFO ] Computed and/alt/rep : 169/322/169 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 05:18:03] [INFO ] Added : 101 causal constraints over 21 iterations in 287 ms. Result :sat
Minimization took 42 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 11 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 11 ms. Remains : 236/240 places, 182/183 transitions.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 05:18:04] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 47712 resets, run finished after 1641 ms. (steps per millisecond=609 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9060 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 1) seen :0
[2023-03-08 05:18:06] [INFO ] Invariant cache hit.
[2023-03-08 05:18:06] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:18:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 05:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:18:06] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-08 05:18:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:18:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:18:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2023-03-08 05:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:18:06] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-08 05:18:06] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2023-03-08 05:18:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-08 05:18:06] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 05:18:07] [INFO ] Added : 111 causal constraints over 23 iterations in 330 ms. Result :sat
Minimization took 51 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 5 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 5 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 5 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 05:18:07] [INFO ] Invariant cache hit.
[2023-03-08 05:18:07] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-08 05:18:07] [INFO ] Invariant cache hit.
[2023-03-08 05:18:07] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-08 05:18:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:18:07] [INFO ] Invariant cache hit.
[2023-03-08 05:18:08] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-15 in 4691 ms.
[2023-03-08 05:18:08] [INFO ] Flatten gal took : 50 ms
[2023-03-08 05:18:08] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 05:18:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 240 places, 183 transitions and 901 arcs took 1 ms.
Total runtime 48873 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-30b
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
Upper Bounds

FORMULA DES-PT-30b-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-UpperBounds-04 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678252693351

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 15 (type EXCL) for 3 DES-PT-30b-UpperBounds-07
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 DES-PT-30b-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 DES-PT-30b-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type FNDP) for 0 DES-PT-30b-UpperBounds-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: try reading problem file /home/mcc/execution/374/UpperBounds-14.sara.
lola: REPORT NUM
lola: FINISHED task # 15 (type EXCL) for DES-PT-30b-UpperBounds-07
lola: markings : 4823
lola: fired transitions : 4860
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for DES-PT-30b-UpperBounds-07 (obsolete)
lola: CANCELED task # 14 (type EQUN) for DES-PT-30b-UpperBounds-07 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 0 DES-PT-30b-UpperBounds-04
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 18 (type FNDP) for 9 DES-PT-30b-UpperBounds-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 9 DES-PT-30b-UpperBounds-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/374/UpperBounds-19.sara.
lola: REPORT NUM
lola: FINISHED task # 17 (type EXCL) for DES-PT-30b-UpperBounds-04
lola: markings : 6919
lola: fired transitions : 6972
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for DES-PT-30b-UpperBounds-04 (obsolete)
lola: LAUNCH task # 23 (type EXCL) for 6 DES-PT-30b-UpperBounds-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 6 DES-PT-30b-UpperBounds-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
sara: place or transition ordering is non-deterministic

lola: REPORT NUM
lola: FINISHED task # 14 (type EQUN) for DES-PT-30b-UpperBounds-07
lola: time used : 0.000000
lola: REPORT NUM
lola: FINISHED task # 23 (type EXCL) for DES-PT-30b-UpperBounds-14
lola: markings : 1712443
lola: fired transitions : 1866433
lola: time used : 3.000000
lola: memory pages used : 8
lola: CANCELED task # 21 (type FNDP) for DES-PT-30b-UpperBounds-14 (obsolete)
lola: LAUNCH task # 20 (type EXCL) for 9 DES-PT-30b-UpperBounds-15
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 20 (type EXCL) for DES-PT-30b-UpperBounds-15
lola: markings : 181105
lola: fired transitions : 216991
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for DES-PT-30b-UpperBounds-15 (obsolete)
lola: CANCELED task # 19 (type EQUN) for DES-PT-30b-UpperBounds-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30b-UpperBounds-04: BOUND 1 state space
DES-PT-30b-UpperBounds-07: BOUND 1 state space
DES-PT-30b-UpperBounds-14: BOUND 1 state space
DES-PT-30b-UpperBounds-15: BOUND 1 state space


Time elapsed: 4 secs. Pages in use: 8

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="lolaxred"
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 lolaxred"
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 r103-tall-167814478300453"
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 ;