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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 115K 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-40b-UpperBounds-00
FORMULA_NAME DES-PT-40b-UpperBounds-01
FORMULA_NAME DES-PT-40b-UpperBounds-02
FORMULA_NAME DES-PT-40b-UpperBounds-03
FORMULA_NAME DES-PT-40b-UpperBounds-04
FORMULA_NAME DES-PT-40b-UpperBounds-05
FORMULA_NAME DES-PT-40b-UpperBounds-06
FORMULA_NAME DES-PT-40b-UpperBounds-07
FORMULA_NAME DES-PT-40b-UpperBounds-08
FORMULA_NAME DES-PT-40b-UpperBounds-09
FORMULA_NAME DES-PT-40b-UpperBounds-10
FORMULA_NAME DES-PT-40b-UpperBounds-11
FORMULA_NAME DES-PT-40b-UpperBounds-12
FORMULA_NAME DES-PT-40b-UpperBounds-13
FORMULA_NAME DES-PT-40b-UpperBounds-14
FORMULA_NAME DES-PT-40b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678305287035

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-40b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:54:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 19:54:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:54:48] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-08 19:54:48] [INFO ] Transformed 439 places.
[2023-03-08 19:54:48] [INFO ] Transformed 390 transitions.
[2023-03-08 19:54:48] [INFO ] Found NUPN structural information;
[2023-03-08 19:54:48] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 390 rows 439 cols
[2023-03-08 19:54:48] [INFO ] Computed 65 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 83 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :11
FORMULA DES-PT-40b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
[2023-03-08 19:54:49] [INFO ] Invariant cache hit.
[2023-03-08 19:54:49] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 19:54:49] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-08 19:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:54:49] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2023-03-08 19:54:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:54:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-08 19:54:49] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 140 ms returned sat
[2023-03-08 19:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:54:50] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2023-03-08 19:54:50] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2023-03-08 19:54:50] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2023-03-08 19:54:50] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-08 19:54:50] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2023-03-08 19:54:50] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2023-03-08 19:54:51] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2023-03-08 19:54:51] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2023-03-08 19:54:51] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2023-03-08 19:54:51] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-08 19:54:51] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2023-03-08 19:54:51] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-08 19:54:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1324 ms
[2023-03-08 19:54:51] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 57 ms.
[2023-03-08 19:54:54] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2023-03-08 19:54:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-08 19:54:54] [INFO ] Added : 286 causal constraints over 58 iterations in 2947 ms. Result :sat
Minimization took 136 ms.
[2023-03-08 19:54:54] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-08 19:54:54] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-08 19:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:54:54] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-08 19:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:54:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 19:54:54] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 43 ms returned sat
[2023-03-08 19:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:54:55] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2023-03-08 19:54:55] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2023-03-08 19:54:55] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-08 19:54:55] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2023-03-08 19:54:55] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 0 ms to minimize.
[2023-03-08 19:54:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 533 ms
[2023-03-08 19:54:55] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 23 ms.
[2023-03-08 19:54:58] [INFO ] Added : 362 causal constraints over 73 iterations in 2938 ms. Result :sat
Minimization took 322 ms.
[2023-03-08 19:54:59] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 19:54:59] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 19:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:54:59] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-08 19:54:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:54:59] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 19:54:59] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 93 ms returned sat
[2023-03-08 19:54:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:54:59] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2023-03-08 19:54:59] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2023-03-08 19:55:00] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2023-03-08 19:55:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-03-08 19:55:00] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 24 ms.
[2023-03-08 19:55:02] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-03-08 19:55:02] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2023-03-08 19:55:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-03-08 19:55:02] [INFO ] Added : 275 causal constraints over 56 iterations in 2567 ms. Result :sat
Minimization took 285 ms.
[2023-03-08 19:55:02] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 19:55:03] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 19:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:03] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-08 19:55:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:03] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-08 19:55:03] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 138 ms returned sat
[2023-03-08 19:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:03] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2023-03-08 19:55:03] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-08 19:55:03] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2023-03-08 19:55:03] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2023-03-08 19:55:04] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2023-03-08 19:55:04] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-08 19:55:04] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2023-03-08 19:55:04] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2023-03-08 19:55:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 853 ms
[2023-03-08 19:55:04] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 24 ms.
[2023-03-08 19:55:06] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 0 ms to minimize.
[2023-03-08 19:55:06] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2023-03-08 19:55:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-08 19:55:06] [INFO ] Added : 241 causal constraints over 49 iterations in 2080 ms. Result :sat
Minimization took 293 ms.
[2023-03-08 19:55:06] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 19:55:06] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 19:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:07] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-08 19:55:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-08 19:55:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 95 ms returned sat
[2023-03-08 19:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:07] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2023-03-08 19:55:07] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2023-03-08 19:55:07] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 0 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 0 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2023-03-08 19:55:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 998 ms
[2023-03-08 19:55:08] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-08 19:55:10] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2023-03-08 19:55:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-08 19:55:11] [INFO ] Added : 296 causal constraints over 60 iterations in 2366 ms. Result :sat
Minimization took 364 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 432 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 432 transition count 363
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 411 transition count 363
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 411 transition count 354
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 402 transition count 354
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 383 transition count 335
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 383 transition count 335
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 383 transition count 334
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 382 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 367 transition count 319
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 367 transition count 319
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 367 transition count 304
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 365 transition count 303
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 365 transition count 300
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 362 transition count 300
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 285 transition count 223
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 283 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 283 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 282 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 281 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 280 transition count 223
Applied a total of 319 rules in 176 ms. Remains 280 /439 variables (removed 159) and now considering 223/390 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 280/439 places, 223/390 transitions.
// Phase 1: matrix 223 rows 280 cols
[2023-03-08 19:55:14] [INFO ] Computed 63 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47776 resets, run finished after 2039 ms. (steps per millisecond=490 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9205 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9120 resets, run finished after 886 ms. (steps per millisecond=1128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9077 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9188 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9051 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 5) seen :0
[2023-03-08 19:55:20] [INFO ] Invariant cache hit.
[2023-03-08 19:55:20] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:20] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-08 19:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:20] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-08 19:55:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 19:55:20] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 43 ms returned sat
[2023-03-08 19:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:21] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-08 19:55:21] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-08 19:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-08 19:55:21] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 19:55:21] [INFO ] Added : 114 causal constraints over 23 iterations in 419 ms. Result :sat
Minimization took 52 ms.
[2023-03-08 19:55:21] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:21] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 24 ms returned sat
[2023-03-08 19:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:21] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-08 19:55:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:21] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 27 ms returned sat
[2023-03-08 19:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:21] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-08 19:55:21] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 17 ms.
[2023-03-08 19:55:22] [INFO ] Added : 170 causal constraints over 34 iterations in 553 ms. Result :sat
Minimization took 64 ms.
[2023-03-08 19:55:22] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:55:22] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-08 19:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:22] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-08 19:55:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2023-03-08 19:55:22] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-08 19:55:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:22] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-08 19:55:22] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 19:55:23] [INFO ] Added : 106 causal constraints over 22 iterations in 343 ms. Result :sat
Minimization took 55 ms.
[2023-03-08 19:55:23] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:23] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 19:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:23] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-08 19:55:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:23] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 41 ms returned sat
[2023-03-08 19:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:23] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-08 19:55:23] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-03-08 19:55:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 19:55:23] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:55:24] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2023-03-08 19:55:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-08 19:55:24] [INFO ] Added : 64 causal constraints over 13 iterations in 330 ms. Result :sat
Minimization took 36 ms.
[2023-03-08 19:55:24] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:24] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 19:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:24] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-08 19:55:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 19:55:24] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 27 ms returned sat
[2023-03-08 19:55:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:24] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-08 19:55:24] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2023-03-08 19:55:24] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2023-03-08 19:55:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-08 19:55:24] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 19:55:25] [INFO ] Added : 123 causal constraints over 25 iterations in 373 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 280/280 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-08 19:55:26] [INFO ] Invariant cache hit.
[2023-03-08 19:55:26] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-08 19:55:26] [INFO ] Invariant cache hit.
[2023-03-08 19:55:26] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-08 19:55:26] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 19:55:26] [INFO ] Invariant cache hit.
[2023-03-08 19:55:26] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 697 ms. Remains : 280/280 places, 223/223 transitions.
Starting property specific reduction for DES-PT-40b-UpperBounds-02
[2023-03-08 19:55:26] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 503 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 99 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 19:55:26] [INFO ] Invariant cache hit.
[2023-03-08 19:55:27] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:27] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-08 19:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:27] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-08 19:55:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:27] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 42 ms returned sat
[2023-03-08 19:55:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:27] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-08 19:55:27] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-03-08 19:55:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-08 19:55:27] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 10 ms.
[2023-03-08 19:55:27] [INFO ] Added : 114 causal constraints over 23 iterations in 405 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Graph (complete) has 953 edges and 280 vertex of which 276 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 276 transition count 222
Applied a total of 2 rules in 18 ms. Remains 276 /280 variables (removed 4) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-08 19:55:28] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47590 resets, run finished after 1876 ms. (steps per millisecond=533 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9134 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 1) seen :0
[2023-03-08 19:55:30] [INFO ] Invariant cache hit.
[2023-03-08 19:55:30] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 19:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:31] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 19:55:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2023-03-08 19:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:31] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-08 19:55:31] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-08 19:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-08 19:55:31] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 19:55:31] [INFO ] Added : 144 causal constraints over 29 iterations in 494 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-08 19:55:32] [INFO ] Invariant cache hit.
[2023-03-08 19:55:32] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-08 19:55:32] [INFO ] Invariant cache hit.
[2023-03-08 19:55:32] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2023-03-08 19:55:32] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 19:55:32] [INFO ] Invariant cache hit.
[2023-03-08 19:55:33] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-02 in 6054 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-05
// Phase 1: matrix 223 rows 280 cols
[2023-03-08 19:55:33] [INFO ] Computed 63 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 480 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 19:55:33] [INFO ] Invariant cache hit.
[2023-03-08 19:55:33] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:33] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-08 19:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:33] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-08 19:55:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:33] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 28 ms returned sat
[2023-03-08 19:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:33] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-08 19:55:33] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 19:55:33] [INFO ] Added : 170 causal constraints over 34 iterations in 545 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 280/280 places, 223/223 transitions.
[2023-03-08 19:55:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47799 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9182 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
[2023-03-08 19:55:37] [INFO ] Invariant cache hit.
[2023-03-08 19:55:37] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:37] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 16 ms returned sat
[2023-03-08 19:55:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:37] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-08 19:55:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:37] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 29 ms returned sat
[2023-03-08 19:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:37] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-08 19:55:37] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 19:55:38] [INFO ] Added : 170 causal constraints over 34 iterations in 534 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 280/280 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-08 19:55:38] [INFO ] Invariant cache hit.
[2023-03-08 19:55:38] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 19:55:38] [INFO ] Invariant cache hit.
[2023-03-08 19:55:38] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-08 19:55:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 19:55:38] [INFO ] Invariant cache hit.
[2023-03-08 19:55:39] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 280/280 places, 223/223 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-05 in 6108 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-06
[2023-03-08 19:55:39] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 479 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 95 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 19:55:39] [INFO ] Invariant cache hit.
[2023-03-08 19:55:39] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:39] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 21 ms returned sat
[2023-03-08 19:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:39] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-08 19:55:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:39] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-08 19:55:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:39] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-08 19:55:39] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 19:55:39] [INFO ] Added : 106 causal constraints over 22 iterations in 337 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Graph (complete) has 953 edges and 280 vertex of which 276 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 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 276 transition count 222
Applied a total of 2 rules in 25 ms. Remains 276 /280 variables (removed 4) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-08 19:55:40] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47868 resets, run finished after 1874 ms. (steps per millisecond=533 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9129 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
[2023-03-08 19:55:42] [INFO ] Invariant cache hit.
[2023-03-08 19:55:42] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 19:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:42] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-08 19:55:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-08 19:55:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 89 ms returned sat
[2023-03-08 19:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:43] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2023-03-08 19:55:43] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 19:55:43] [INFO ] Added : 127 causal constraints over 26 iterations in 478 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-08 19:55:44] [INFO ] Invariant cache hit.
[2023-03-08 19:55:44] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 19:55:44] [INFO ] Invariant cache hit.
[2023-03-08 19:55:44] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-08 19:55:44] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 19:55:44] [INFO ] Invariant cache hit.
[2023-03-08 19:55:44] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-06 in 5620 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-08
// Phase 1: matrix 223 rows 280 cols
[2023-03-08 19:55:44] [INFO ] Computed 63 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 462 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 19:55:44] [INFO ] Invariant cache hit.
[2023-03-08 19:55:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:44] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 19:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:44] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-08 19:55:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:45] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 43 ms returned sat
[2023-03-08 19:55:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:45] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-08 19:55:45] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2023-03-08 19:55:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 19:55:45] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:55:45] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2023-03-08 19:55:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 19:55:45] [INFO ] Added : 64 causal constraints over 13 iterations in 334 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Graph (complete) has 953 edges and 280 vertex of which 276 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 276 transition count 222
Applied a total of 2 rules in 14 ms. Remains 276 /280 variables (removed 4) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-08 19:55:45] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47629 resets, run finished after 1877 ms. (steps per millisecond=532 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9194 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 1) seen :0
[2023-03-08 19:55:48] [INFO ] Invariant cache hit.
[2023-03-08 19:55:48] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-08 19:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:48] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-08 19:55:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 84 ms returned sat
[2023-03-08 19:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:48] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-08 19:55:48] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:55:49] [INFO ] Added : 78 causal constraints over 16 iterations in 297 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-08 19:55:49] [INFO ] Invariant cache hit.
[2023-03-08 19:55:49] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 19:55:49] [INFO ] Invariant cache hit.
[2023-03-08 19:55:49] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-08 19:55:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 19:55:49] [INFO ] Invariant cache hit.
[2023-03-08 19:55:49] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-08 in 5180 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-10
// Phase 1: matrix 223 rows 280 cols
[2023-03-08 19:55:49] [INFO ] Computed 63 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 460 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 19:55:49] [INFO ] Invariant cache hit.
[2023-03-08 19:55:50] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:55:50] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 19:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:50] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-08 19:55:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:55:50] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 27 ms returned sat
[2023-03-08 19:55:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:50] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-08 19:55:50] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-08 19:55:50] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2023-03-08 19:55:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-08 19:55:50] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 19:55:50] [INFO ] Added : 123 causal constraints over 25 iterations in 387 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Graph (complete) has 953 edges and 280 vertex of which 276 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 276 transition count 222
Applied a total of 2 rules in 13 ms. Remains 276 /280 variables (removed 4) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-08 19:55:51] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 47642 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9163 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties (out of 1) seen :0
[2023-03-08 19:55:53] [INFO ] Invariant cache hit.
[2023-03-08 19:55:53] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 19:55:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 19:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:54] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-08 19:55:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:55:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 19:55:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 71 ms returned sat
[2023-03-08 19:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:55:54] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-08 19:55:54] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 19:55:54] [INFO ] Added : 150 causal constraints over 30 iterations in 504 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-08 19:55:55] [INFO ] Invariant cache hit.
[2023-03-08 19:55:55] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 19:55:55] [INFO ] Invariant cache hit.
[2023-03-08 19:55:55] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-08 19:55:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:55:55] [INFO ] Invariant cache hit.
[2023-03-08 19:55:55] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-10 in 5842 ms.
[2023-03-08 19:55:55] [INFO ] Flatten gal took : 58 ms
[2023-03-08 19:55:55] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-08 19:55:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 280 places, 223 transitions and 1091 arcs took 2 ms.
Total runtime 67476 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/838/ub_0_ --maxsum=/tmp/838/ub_1_ --maxsum=/tmp/838/ub_2_ --maxsum=/tmp/838/ub_3_ --maxsum=/tmp/838/ub_4_
FORMULA DES-PT-40b-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-40b-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-40b-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-40b-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-40b-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678307374569

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DES-PT-40b-UpperBounds-02
ub formula formula --maxsum=/tmp/838/ub_0_
ub formula name DES-PT-40b-UpperBounds-05
ub formula formula --maxsum=/tmp/838/ub_1_
ub formula name DES-PT-40b-UpperBounds-06
ub formula formula --maxsum=/tmp/838/ub_2_
ub formula name DES-PT-40b-UpperBounds-08
ub formula formula --maxsum=/tmp/838/ub_3_
ub formula name DES-PT-40b-UpperBounds-10
ub formula formula --maxsum=/tmp/838/ub_4_
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 280 places, 223 transitions and 1091 arcs
pnml2lts-sym: Petri net DES_PT_40b 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: 223->217 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 280; there are 217 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 174706167 group checks and 0 next state calls
pnml2lts-sym: reachability took 2012.690 real 7843.090 user 187.020 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 1.600 real 6.430 user 0.000 sys
pnml2lts-sym: state space has 43394917410046 states, 22109896 nodes
pnml2lts-sym: Maximum sum of /tmp/838/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/838/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/838/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/838/ub_3_ is: 1
pnml2lts-sym: Maximum sum of /tmp/838/ub_4_ is: 1
pnml2lts-sym: group_next: 2333 nodes total
pnml2lts-sym: group_explored: 2499 nodes, 3154 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-40b"
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-40b, 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-167814481200469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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