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.r101-tall-167814475400469.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 itstools
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 r101-tall-167814475400469
=====================================================================

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

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 11:32:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 11:32:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:32:58] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-08 11:32:58] [INFO ] Transformed 439 places.
[2023-03-08 11:32:58] [INFO ] Transformed 390 transitions.
[2023-03-08 11:32:58] [INFO ] Found NUPN structural information;
[2023-03-08 11:32:58] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 390 rows 439 cols
[2023-03-08 11:32:58] [INFO ] Computed 65 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 85 resets, run finished after 44 ms. (steps per millisecond=227 ) 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 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 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 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
[2023-03-08 11:32:58] [INFO ] Invariant cache hit.
[2023-03-08 11:32:59] [INFO ] [Real]Absence check using 39 positive place invariants in 24 ms returned sat
[2023-03-08 11:32:59] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-08 11:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:32:59] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-08 11:32:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:32:59] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-08 11:32:59] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 128 ms returned sat
[2023-03-08 11:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:00] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-08 11:33:00] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
[2023-03-08 11:33:00] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2023-03-08 11:33:00] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-08 11:33:00] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2023-03-08 11:33:00] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2023-03-08 11:33:00] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2023-03-08 11:33:01] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-08 11:33:01] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 0 ms to minimize.
[2023-03-08 11:33:01] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2023-03-08 11:33:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2023-03-08 11:33:01] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-08 11:33:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1301 ms
[2023-03-08 11:33:01] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 33 ms.
[2023-03-08 11:33:04] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2023-03-08 11:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-08 11:33:04] [INFO ] Added : 286 causal constraints over 58 iterations in 2948 ms. Result :sat
Minimization took 161 ms.
[2023-03-08 11:33:04] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 11:33:04] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 11:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:04] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-08 11:33:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:04] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 11:33:04] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2023-03-08 11:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:05] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2023-03-08 11:33:05] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2023-03-08 11:33:05] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-03-08 11:33:05] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2023-03-08 11:33:05] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 0 ms to minimize.
[2023-03-08 11:33:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 493 ms
[2023-03-08 11:33:05] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 22 ms.
[2023-03-08 11:33:08] [INFO ] Added : 362 causal constraints over 73 iterations in 2996 ms. Result :sat
Minimization took 315 ms.
[2023-03-08 11:33:09] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 11:33:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 11:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:09] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-08 11:33:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:09] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 11:33:09] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 89 ms returned sat
[2023-03-08 11:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:09] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-08 11:33:09] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2023-03-08 11:33:09] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2023-03-08 11:33:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2023-03-08 11:33:10] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 25 ms.
[2023-03-08 11:33:12] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2023-03-08 11:33:12] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2023-03-08 11:33:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2023-03-08 11:33:12] [INFO ] Added : 275 causal constraints over 56 iterations in 2637 ms. Result :sat
Minimization took 272 ms.
[2023-03-08 11:33:12] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 11:33:13] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 11:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:13] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-08 11:33:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:13] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 11:33:13] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 137 ms returned sat
[2023-03-08 11:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:13] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2023-03-08 11:33:13] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2023-03-08 11:33:13] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2023-03-08 11:33:13] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2023-03-08 11:33:14] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-08 11:33:14] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2023-03-08 11:33:14] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-08 11:33:14] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2023-03-08 11:33:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 825 ms
[2023-03-08 11:33:14] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 21 ms.
[2023-03-08 11:33:16] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2023-03-08 11:33:16] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 0 ms to minimize.
[2023-03-08 11:33:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-03-08 11:33:16] [INFO ] Added : 241 causal constraints over 49 iterations in 1995 ms. Result :sat
Minimization took 278 ms.
[2023-03-08 11:33:16] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-08 11:33:16] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 11:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:16] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-08 11:33:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:17] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-08 11:33:17] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 89 ms returned sat
[2023-03-08 11:33:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:17] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2023-03-08 11:33:17] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2023-03-08 11:33:17] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 0 ms to minimize.
[2023-03-08 11:33:17] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2023-03-08 11:33:17] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2023-03-08 11:33:18] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 3 ms to minimize.
[2023-03-08 11:33:18] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 3 ms to minimize.
[2023-03-08 11:33:18] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2023-03-08 11:33:18] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2023-03-08 11:33:18] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2023-03-08 11:33:18] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2023-03-08 11:33:18] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2023-03-08 11:33:18] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1012 ms
[2023-03-08 11:33:18] [INFO ] Computed and/alt/rep : 384/813/384 causal constraints (skipped 5 transitions) in 20 ms.
[2023-03-08 11:33:20] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 0 ms to minimize.
[2023-03-08 11:33:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-08 11:33:20] [INFO ] Added : 296 causal constraints over 60 iterations in 2361 ms. Result :sat
Minimization took 356 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.3 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 170 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 171 ms. Remains : 280/439 places, 223/390 transitions.
// Phase 1: matrix 223 rows 280 cols
[2023-03-08 11:33:23] [INFO ] Computed 63 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 47893 resets, run finished after 1951 ms. (steps per millisecond=512 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9097 resets, run finished after 862 ms. (steps per millisecond=1160 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9126 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9140 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9210 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9199 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 5) seen :0
[2023-03-08 11:33:30] [INFO ] Invariant cache hit.
[2023-03-08 11:33:30] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 11:33:30] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 11:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:30] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 11:33:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 11:33:30] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 44 ms returned sat
[2023-03-08 11:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:30] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-08 11:33:30] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-08 11:33:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-08 11:33:30] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:31] [INFO ] Added : 114 causal constraints over 23 iterations in 422 ms. Result :sat
Minimization took 49 ms.
[2023-03-08 11:33:31] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:31] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-08 11:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:31] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-08 11:33:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:31] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 27 ms returned sat
[2023-03-08 11:33:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:31] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-08 11:33:31] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 11:33:32] [INFO ] Added : 170 causal constraints over 34 iterations in 568 ms. Result :sat
Minimization took 64 ms.
[2023-03-08 11:33:32] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:32] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 16 ms returned sat
[2023-03-08 11:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:32] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2023-03-08 11:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:32] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-08 11:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:32] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-08 11:33:32] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 11:33:32] [INFO ] Added : 106 causal constraints over 22 iterations in 341 ms. Result :sat
Minimization took 50 ms.
[2023-03-08 11:33:33] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:33] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 11:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:33] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-08 11:33:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 11:33:33] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 40 ms returned sat
[2023-03-08 11:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:33] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-08 11:33:33] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-08 11:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-08 11:33:33] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:33] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2023-03-08 11:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-08 11:33:33] [INFO ] Added : 64 causal constraints over 13 iterations in 348 ms. Result :sat
Minimization took 37 ms.
[2023-03-08 11:33:33] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:33] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 11:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:34] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-08 11:33:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:34] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 26 ms returned sat
[2023-03-08 11:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:34] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-08 11:33:34] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2023-03-08 11:33:34] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2023-03-08 11:33:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-03-08 11:33:34] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:34] [INFO ] Added : 123 causal constraints over 25 iterations in 401 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 11 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 9 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-08 11:33:35] [INFO ] Invariant cache hit.
[2023-03-08 11:33:36] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-08 11:33:36] [INFO ] Invariant cache hit.
[2023-03-08 11:33:36] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-08 11:33:36] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 11:33:36] [INFO ] Invariant cache hit.
[2023-03-08 11:33:36] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 ms. Remains : 280/280 places, 223/223 transitions.
Starting property specific reduction for DES-PT-40b-UpperBounds-02
[2023-03-08 11:33:36] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 489 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 97 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 11:33:36] [INFO ] Invariant cache hit.
[2023-03-08 11:33:36] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:36] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 11:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:36] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-08 11:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 11:33:36] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 41 ms returned sat
[2023-03-08 11:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:37] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-08 11:33:37] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2023-03-08 11:33:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 11:33:37] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 13 ms.
[2023-03-08 11:33:37] [INFO ] Added : 114 causal constraints over 23 iterations in 429 ms. Result :sat
Minimization took 49 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 17 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 11:33:37] [INFO ] Computed 60 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 47819 resets, run finished after 1839 ms. (steps per millisecond=543 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9095 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 1) seen :0
[2023-03-08 11:33:40] [INFO ] Invariant cache hit.
[2023-03-08 11:33:40] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 11:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:40] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-08 11:33:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-08 11:33:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2023-03-08 11:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:41] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-08 11:33:41] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-08 11:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-08 11:33:41] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:41] [INFO ] Added : 144 causal constraints over 29 iterations in 496 ms. Result :sat
Minimization took 82 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 9 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 11:33:42] [INFO ] Invariant cache hit.
[2023-03-08 11:33:42] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 11:33:42] [INFO ] Invariant cache hit.
[2023-03-08 11:33:42] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2023-03-08 11:33:42] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 11:33:42] [INFO ] Invariant cache hit.
[2023-03-08 11:33:42] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-02 in 6001 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-05
// Phase 1: matrix 223 rows 280 cols
[2023-03-08 11:33:42] [INFO ] Computed 63 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 481 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 11:33:42] [INFO ] Invariant cache hit.
[2023-03-08 11:33:42] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:42] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 15 ms returned sat
[2023-03-08 11:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:42] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-08 11:33:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:42] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 27 ms returned sat
[2023-03-08 11:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:42] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-08 11:33:43] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:43] [INFO ] Added : 170 causal constraints over 34 iterations in 569 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 7 ms. Remains : 280/280 places, 223/223 transitions.
[2023-03-08 11:33:44] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47635 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 9090 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 1) seen :0
[2023-03-08 11:33:46] [INFO ] Invariant cache hit.
[2023-03-08 11:33:46] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:46] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 11:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:46] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-08 11:33:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:47] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 26 ms returned sat
[2023-03-08 11:33:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:47] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-08 11:33:47] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:47] [INFO ] Added : 170 causal constraints over 34 iterations in 569 ms. Result :sat
Minimization took 61 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 6 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-08 11:33:48] [INFO ] Invariant cache hit.
[2023-03-08 11:33:48] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 11:33:48] [INFO ] Invariant cache hit.
[2023-03-08 11:33:48] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-08 11:33:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 11:33:48] [INFO ] Invariant cache hit.
[2023-03-08 11:33:48] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 280/280 places, 223/223 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-05 in 6130 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-06
[2023-03-08 11:33:48] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 458 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 100 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 11:33:48] [INFO ] Invariant cache hit.
[2023-03-08 11:33:48] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 11:33:48] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 11:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:48] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-08 11:33:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:49] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-08 11:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:49] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-08 11:33:49] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:49] [INFO ] Added : 106 causal constraints over 22 iterations in 355 ms. Result :sat
Minimization took 51 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 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 14 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-08 11:33:49] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 47497 resets, run finished after 1857 ms. (steps per millisecond=538 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9120 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 1) seen :0
[2023-03-08 11:33:52] [INFO ] Invariant cache hit.
[2023-03-08 11:33:52] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 11:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:52] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 11:33:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2023-03-08 11:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:52] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-08 11:33:52] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:53] [INFO ] Added : 127 causal constraints over 26 iterations in 478 ms. Result :sat
Minimization took 70 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 7 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 11:33:53] [INFO ] Invariant cache hit.
[2023-03-08 11:33:53] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 11:33:53] [INFO ] Invariant cache hit.
[2023-03-08 11:33:54] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-08 11:33:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:33:54] [INFO ] Invariant cache hit.
[2023-03-08 11:33:54] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-06 in 5557 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-08
// Phase 1: matrix 223 rows 280 cols
[2023-03-08 11:33:54] [INFO ] Computed 63 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 494 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 101 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 11:33:54] [INFO ] Invariant cache hit.
[2023-03-08 11:33:54] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:54] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-08 11:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:54] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 11:33:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:54] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 41 ms returned sat
[2023-03-08 11:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:54] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-08 11:33:54] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2023-03-08 11:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 11:33:54] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:55] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-08 11:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 11:33:55] [INFO ] Added : 64 causal constraints over 13 iterations in 335 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 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 14 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-08 11:33:55] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 47567 resets, run finished after 1874 ms. (steps per millisecond=533 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9186 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 1) seen :0
[2023-03-08 11:33:58] [INFO ] Invariant cache hit.
[2023-03-08 11:33:58] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 11:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:58] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 11:33:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2023-03-08 11:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:58] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-08 11:33:58] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:33:58] [INFO ] Added : 78 causal constraints over 16 iterations in 265 ms. Result :sat
Minimization took 61 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 7 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 11:33:58] [INFO ] Invariant cache hit.
[2023-03-08 11:33:59] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 11:33:59] [INFO ] Invariant cache hit.
[2023-03-08 11:33:59] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-08 11:33:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:33:59] [INFO ] Invariant cache hit.
[2023-03-08 11:33:59] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 614 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-08 in 5161 ms.
Starting property specific reduction for DES-PT-40b-UpperBounds-10
// Phase 1: matrix 223 rows 280 cols
[2023-03-08 11:33:59] [INFO ] Computed 63 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 492 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 11:33:59] [INFO ] Invariant cache hit.
[2023-03-08 11:33:59] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:59] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 13 ms returned sat
[2023-03-08 11:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:59] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-08 11:33:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:33:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:33:59] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 27 ms returned sat
[2023-03-08 11:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:33:59] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-08 11:33:59] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-08 11:34:00] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-08 11:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-03-08 11:34:00] [INFO ] Computed and/alt/rep : 209/382/209 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:34:00] [INFO ] Added : 123 causal constraints over 25 iterations in 417 ms. Result :sat
Minimization took 48 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 12 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 12 ms. Remains : 276/280 places, 222/223 transitions.
// Phase 1: matrix 222 rows 276 cols
[2023-03-08 11:34:00] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47728 resets, run finished after 1820 ms. (steps per millisecond=549 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9236 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 1) seen :0
[2023-03-08 11:34:03] [INFO ] Invariant cache hit.
[2023-03-08 11:34:03] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:34:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 11:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:03] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-08 11:34:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:34:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 68 ms returned sat
[2023-03-08 11:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:03] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-08 11:34:03] [INFO ] Computed and/alt/rep : 208/380/208 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 11:34:04] [INFO ] Added : 150 causal constraints over 30 iterations in 545 ms. Result :sat
Minimization took 70 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 6 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-08 11:34:04] [INFO ] Invariant cache hit.
[2023-03-08 11:34:04] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 11:34:04] [INFO ] Invariant cache hit.
[2023-03-08 11:34:05] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-08 11:34:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:34:05] [INFO ] Invariant cache hit.
[2023-03-08 11:34:05] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 585 ms. Remains : 276/276 places, 222/222 transitions.
Ending property specific reduction for DES-PT-40b-UpperBounds-10 in 5911 ms.
[2023-03-08 11:34:05] [INFO ] Flatten gal took : 66 ms
[2023-03-08 11:34:05] [INFO ] Applying decomposition
[2023-03-08 11:34:05] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10324917703374731965.txt' '-o' '/tmp/graph10324917703374731965.bin' '-w' '/tmp/graph10324917703374731965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10324917703374731965.bin' '-l' '-1' '-v' '-w' '/tmp/graph10324917703374731965.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:34:05] [INFO ] Decomposing Gal with order
[2023-03-08 11:34:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:34:05] [INFO ] Removed a total of 45 redundant transitions.
[2023-03-08 11:34:06] [INFO ] Flatten gal took : 78 ms
[2023-03-08 11:34:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 8 ms.
[2023-03-08 11:34:06] [INFO ] Time to serialize gal into /tmp/UpperBounds13604481517275138720.gal : 6 ms
[2023-03-08 11:34:06] [INFO ] Time to serialize properties into /tmp/UpperBounds4449222590033162592.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13604481517275138720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4449222590033162592.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds4449222590033162592.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.33949e+13,58.6797,1331792,36280,6655,1.51064e+06,13394,300,1.06524e+07,355,152901,0
Total reachable state count : 43394917410046

Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40b-UpperBounds-02 :0 <= u13.p23 <= 1
FORMULA DES-PT-40b-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40b-UpperBounds-02,0,102.939,1364532,1,0,1.51064e+06,13394,480,1.53948e+07,460,249243,1691
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40b-UpperBounds-05 :0 <= u2.p128 <= 1
FORMULA DES-PT-40b-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40b-UpperBounds-05,0,106.589,1430796,1,0,1.51064e+06,13394,509,1.60434e+07,548,253812,2747
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40b-UpperBounds-06 :0 <= u2.p148 <= 1
FORMULA DES-PT-40b-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40b-UpperBounds-06,0,108.436,1525308,1,0,1.51064e+06,13394,532,1.71131e+07,593,254014,2784
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40b-UpperBounds-08 :0 <= u13.p40 <= 1
FORMULA DES-PT-40b-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40b-UpperBounds-08,0,111.772,1595796,1,0,1.51064e+06,13394,557,1.78798e+07,602,257031,2999
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40b-UpperBounds-10 :0 <= u48.p60 <= 1
FORMULA DES-PT-40b-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40b-UpperBounds-10,0,121.466,1848180,1,0,1.51064e+06,13394,582,2.08365e+07,669,264116,3143
Total runtime 189448 ms.

BK_STOP 1678275368911

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r101-tall-167814475400469"
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 ;