About the Execution of LTSMin+red for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4051.111 | 511043.00 | 1826362.00 | 493.70 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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-167814481300485.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-50b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481300485
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 127K 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-50b-UpperBounds-00
FORMULA_NAME DES-PT-50b-UpperBounds-01
FORMULA_NAME DES-PT-50b-UpperBounds-02
FORMULA_NAME DES-PT-50b-UpperBounds-03
FORMULA_NAME DES-PT-50b-UpperBounds-04
FORMULA_NAME DES-PT-50b-UpperBounds-05
FORMULA_NAME DES-PT-50b-UpperBounds-06
FORMULA_NAME DES-PT-50b-UpperBounds-07
FORMULA_NAME DES-PT-50b-UpperBounds-08
FORMULA_NAME DES-PT-50b-UpperBounds-09
FORMULA_NAME DES-PT-50b-UpperBounds-10
FORMULA_NAME DES-PT-50b-UpperBounds-11
FORMULA_NAME DES-PT-50b-UpperBounds-12
FORMULA_NAME DES-PT-50b-UpperBounds-13
FORMULA_NAME DES-PT-50b-UpperBounds-14
FORMULA_NAME DES-PT-50b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678310871063
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-50b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 21:27:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 21:27:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:27:52] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-08 21:27:52] [INFO ] Transformed 479 places.
[2023-03-08 21:27:52] [INFO ] Transformed 430 transitions.
[2023-03-08 21:27:52] [INFO ] Found NUPN structural information;
[2023-03-08 21:27:52] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 430 rows 479 cols
[2023-03-08 21:27:52] [INFO ] Computed 65 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 84 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :11
FORMULA DES-PT-50b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 12 resets, run finished after 16 ms. (steps per millisecond=625 ) 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 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
[2023-03-08 21:27:52] [INFO ] Invariant cache hit.
[2023-03-08 21:27:53] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-08 21:27:53] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 21:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:27:53] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2023-03-08 21:27:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:27:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-08 21:27:53] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 21:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:27:53] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-08 21:27:53] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 35 ms.
[2023-03-08 21:27:56] [INFO ] Added : 230 causal constraints over 46 iterations in 2587 ms. Result :sat
Minimization took 228 ms.
[2023-03-08 21:27:56] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-08 21:27:56] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 21:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:27:56] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-08 21:27:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:27:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2023-03-08 21:27:57] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:27:57] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-08 21:27:57] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 4 ms to minimize.
[2023-03-08 21:27:57] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2023-03-08 21:27:57] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2023-03-08 21:27:57] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-03-08 21:27:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 537 ms
[2023-03-08 21:27:57] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 30 ms.
[2023-03-08 21:28:00] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 1 ms to minimize.
[2023-03-08 21:28:00] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2023-03-08 21:28:01] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2023-03-08 21:28:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 470 ms
[2023-03-08 21:28:01] [INFO ] Added : 238 causal constraints over 48 iterations in 3396 ms. Result :sat
Minimization took 785 ms.
[2023-03-08 21:28:02] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-08 21:28:02] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 21:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:02] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-08 21:28:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:02] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-08 21:28:02] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 21:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:02] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-08 21:28:02] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2023-03-08 21:28:02] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2023-03-08 21:28:02] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-08 21:28:03] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 0 ms to minimize.
[2023-03-08 21:28:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 511 ms
[2023-03-08 21:28:03] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 22 ms.
[2023-03-08 21:28:06] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-08 21:28:06] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2023-03-08 21:28:06] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-08 21:28:06] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2023-03-08 21:28:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 520 ms
[2023-03-08 21:28:07] [INFO ] Added : 272 causal constraints over 55 iterations in 4061 ms. Result :sat
Minimization took 171 ms.
[2023-03-08 21:28:07] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-08 21:28:07] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 21:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:07] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2023-03-08 21:28:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-08 21:28:07] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 21:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:07] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-08 21:28:07] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2023-03-08 21:28:08] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 0 ms to minimize.
[2023-03-08 21:28:08] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 0 ms to minimize.
[2023-03-08 21:28:08] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 1 ms to minimize.
[2023-03-08 21:28:08] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 0 ms to minimize.
[2023-03-08 21:28:08] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 1 ms to minimize.
[2023-03-08 21:28:08] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2023-03-08 21:28:08] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2023-03-08 21:28:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 912 ms
[2023-03-08 21:28:08] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 22 ms.
[2023-03-08 21:28:11] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2023-03-08 21:28:12] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2023-03-08 21:28:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2023-03-08 21:28:12] [INFO ] Added : 279 causal constraints over 57 iterations in 3472 ms. Result :sat
Minimization took 388 ms.
[2023-03-08 21:28:12] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-08 21:28:12] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 21:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:12] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-08 21:28:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-08 21:28:13] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 21:28:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:13] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2023-03-08 21:28:13] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2023-03-08 21:28:14] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 0 ms to minimize.
[2023-03-08 21:28:14] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 0 ms to minimize.
[2023-03-08 21:28:14] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 0 ms to minimize.
[2023-03-08 21:28:14] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-03-08 21:28:14] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-08 21:28:14] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2023-03-08 21:28:15] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 0 ms to minimize.
[2023-03-08 21:28:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1677 ms
[2023-03-08 21:28:15] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 27 ms.
[2023-03-08 21:28:17] [INFO ] Added : 205 causal constraints over 41 iterations in 2788 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 468 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 468 transition count 402
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 447 transition count 402
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 447 transition count 393
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 438 transition count 393
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 419 transition count 374
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 419 transition count 374
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 419 transition count 373
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 418 transition count 373
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 403 transition count 358
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 403 transition count 358
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 403 transition count 343
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 401 transition count 342
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 401 transition count 339
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 398 transition count 339
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 321 transition count 262
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 319 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 319 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 318 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 317 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 316 transition count 262
Applied a total of 320 rules in 233 ms. Remains 316 /479 variables (removed 163) and now considering 262/430 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 316/479 places, 262/430 transitions.
// Phase 1: matrix 262 rows 316 cols
[2023-03-08 21:28:18] [INFO ] Computed 60 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 48074 resets, run finished after 2059 ms. (steps per millisecond=485 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9102 resets, run finished after 923 ms. (steps per millisecond=1083 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9060 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9153 resets, run finished after 910 ms. (steps per millisecond=1098 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9249 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9014 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 5) seen :0
[2023-03-08 21:28:25] [INFO ] Invariant cache hit.
[2023-03-08 21:28:25] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:25] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 21:28:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 99 ms returned sat
[2023-03-08 21:28:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:25] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2023-03-08 21:28:25] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 21:28:26] [INFO ] Added : 102 causal constraints over 21 iterations in 393 ms. Result :sat
Minimization took 106 ms.
[2023-03-08 21:28:26] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:26] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-08 21:28:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 101 ms returned sat
[2023-03-08 21:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:27] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-08 21:28:27] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 21:28:27] [INFO ] Added : 111 causal constraints over 23 iterations in 455 ms. Result :sat
Minimization took 136 ms.
[2023-03-08 21:28:27] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:27] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 21:28:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 101 ms returned sat
[2023-03-08 21:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:28] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-08 21:28:28] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 21:28:28] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-08 21:28:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-08 21:28:28] [INFO ] Added : 141 causal constraints over 29 iterations in 698 ms. Result :sat
Minimization took 96 ms.
[2023-03-08 21:28:29] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:29] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-08 21:28:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 103 ms returned sat
[2023-03-08 21:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:29] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-08 21:28:29] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 21:28:30] [INFO ] Added : 109 causal constraints over 22 iterations in 495 ms. Result :sat
Minimization took 144 ms.
[2023-03-08 21:28:30] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:30] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-08 21:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 129 ms returned sat
[2023-03-08 21:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:31] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-08 21:28:31] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
[2023-03-08 21:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-08 21:28:31] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 21:28:31] [INFO ] Added : 123 causal constraints over 25 iterations in 589 ms. Result :sat
Minimization took 152 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 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 21:28:32] [INFO ] Invariant cache hit.
[2023-03-08 21:28:33] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-08 21:28:33] [INFO ] Invariant cache hit.
[2023-03-08 21:28:33] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2023-03-08 21:28:33] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-08 21:28:33] [INFO ] Invariant cache hit.
[2023-03-08 21:28:33] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 771 ms. Remains : 316/316 places, 262/262 transitions.
Starting property specific reduction for DES-PT-50b-UpperBounds-05
[2023-03-08 21:28:33] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 471 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 21:28:33] [INFO ] Invariant cache hit.
[2023-03-08 21:28:33] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:33] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-08 21:28:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 99 ms returned sat
[2023-03-08 21:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:34] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2023-03-08 21:28:34] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 32 ms.
[2023-03-08 21:28:34] [INFO ] Added : 102 causal constraints over 21 iterations in 419 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 21:28:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47972 resets, run finished after 1926 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9147 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 1) seen :0
[2023-03-08 21:28:37] [INFO ] Invariant cache hit.
[2023-03-08 21:28:37] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:37] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-08 21:28:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 100 ms returned sat
[2023-03-08 21:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:38] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2023-03-08 21:28:38] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 21:28:38] [INFO ] Added : 102 causal constraints over 21 iterations in 386 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 21:28:39] [INFO ] Invariant cache hit.
[2023-03-08 21:28:39] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-08 21:28:39] [INFO ] Invariant cache hit.
[2023-03-08 21:28:39] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-08 21:28:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 21:28:39] [INFO ] Invariant cache hit.
[2023-03-08 21:28:39] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 716 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-05 in 6185 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-07
[2023-03-08 21:28:39] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 470 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 90 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-08 21:28:39] [INFO ] Invariant cache hit.
[2023-03-08 21:28:39] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 21:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:39] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-08 21:28:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 101 ms returned sat
[2023-03-08 21:28:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:40] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-03-08 21:28:40] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 20 ms.
[2023-03-08 21:28:40] [INFO ] Added : 111 causal constraints over 23 iterations in 467 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 21:28:41] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47752 resets, run finished after 1933 ms. (steps per millisecond=517 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9122 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties (out of 1) seen :0
[2023-03-08 21:28:44] [INFO ] Invariant cache hit.
[2023-03-08 21:28:44] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:44] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:44] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 21:28:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 100 ms returned sat
[2023-03-08 21:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:44] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2023-03-08 21:28:44] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 21:28:45] [INFO ] Added : 111 causal constraints over 23 iterations in 458 ms. Result :sat
Minimization took 128 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 18 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 21:28:45] [INFO ] Invariant cache hit.
[2023-03-08 21:28:45] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-08 21:28:45] [INFO ] Invariant cache hit.
[2023-03-08 21:28:46] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-08 21:28:46] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 21:28:46] [INFO ] Invariant cache hit.
[2023-03-08 21:28:46] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 758 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-07 in 6428 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-08
[2023-03-08 21:28:46] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 507 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 81 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 21:28:46] [INFO ] Invariant cache hit.
[2023-03-08 21:28:46] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:46] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-08 21:28:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 99 ms returned sat
[2023-03-08 21:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:46] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-08 21:28:46] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 15 ms.
[2023-03-08 21:28:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2023-03-08 21:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-08 21:28:47] [INFO ] Added : 141 causal constraints over 29 iterations in 692 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 18 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 21:28:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47835 resets, run finished after 2054 ms. (steps per millisecond=486 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9134 resets, run finished after 974 ms. (steps per millisecond=1026 ) properties (out of 1) seen :0
[2023-03-08 21:28:51] [INFO ] Invariant cache hit.
[2023-03-08 21:28:51] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:51] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-08 21:28:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:51] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-08 21:28:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 100 ms returned sat
[2023-03-08 21:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:51] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-08 21:28:51] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 27 ms.
[2023-03-08 21:28:52] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2023-03-08 21:28:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 21:28:52] [INFO ] Added : 141 causal constraints over 29 iterations in 660 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 19 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 21:28:52] [INFO ] Invariant cache hit.
[2023-03-08 21:28:53] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 21:28:53] [INFO ] Invariant cache hit.
[2023-03-08 21:28:53] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2023-03-08 21:28:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:28:53] [INFO ] Invariant cache hit.
[2023-03-08 21:28:53] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-08 in 7414 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-09
[2023-03-08 21:28:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 478 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-08 21:28:53] [INFO ] Invariant cache hit.
[2023-03-08 21:28:53] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:53] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 21:28:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 100 ms returned sat
[2023-03-08 21:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:54] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-08 21:28:54] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 21:28:54] [INFO ] Added : 109 causal constraints over 22 iterations in 486 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 21:28:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47697 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9069 resets, run finished after 909 ms. (steps per millisecond=1100 ) properties (out of 1) seen :0
[2023-03-08 21:28:57] [INFO ] Invariant cache hit.
[2023-03-08 21:28:57] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:28:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:28:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:58] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-08 21:28:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:28:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 21:28:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 107 ms returned sat
[2023-03-08 21:28:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:28:58] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-08 21:28:58] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 21:28:59] [INFO ] Added : 109 causal constraints over 22 iterations in 489 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 21:28:59] [INFO ] Invariant cache hit.
[2023-03-08 21:28:59] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-08 21:28:59] [INFO ] Invariant cache hit.
[2023-03-08 21:28:59] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2023-03-08 21:28:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:28:59] [INFO ] Invariant cache hit.
[2023-03-08 21:29:00] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 677 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-09 in 6428 ms.
Starting property specific reduction for DES-PT-50b-UpperBounds-10
[2023-03-08 21:29:00] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 473 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 85 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 21:29:00] [INFO ] Invariant cache hit.
[2023-03-08 21:29:00] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:29:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 21:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:29:00] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-08 21:29:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:29:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:29:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 124 ms returned sat
[2023-03-08 21:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:29:00] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2023-03-08 21:29:00] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2023-03-08 21:29:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-08 21:29:00] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 16 ms.
[2023-03-08 21:29:01] [INFO ] Added : 123 causal constraints over 25 iterations in 568 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 316/316 places, 262/262 transitions.
[2023-03-08 21:29:01] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47739 resets, run finished after 1933 ms. (steps per millisecond=517 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9082 resets, run finished after 959 ms. (steps per millisecond=1042 ) properties (out of 1) seen :0
[2023-03-08 21:29:04] [INFO ] Invariant cache hit.
[2023-03-08 21:29:04] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 21:29:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-08 21:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:29:04] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-08 21:29:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:29:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-08 21:29:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 122 ms returned sat
[2023-03-08 21:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:29:05] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2023-03-08 21:29:05] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-03-08 21:29:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-08 21:29:05] [INFO ] Computed and/alt/rep : 248/440/248 causal constraints (skipped 11 transitions) in 14 ms.
[2023-03-08 21:29:05] [INFO ] Added : 123 causal constraints over 25 iterations in 583 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-08 21:29:06] [INFO ] Invariant cache hit.
[2023-03-08 21:29:06] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 21:29:06] [INFO ] Invariant cache hit.
[2023-03-08 21:29:06] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2023-03-08 21:29:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 21:29:06] [INFO ] Invariant cache hit.
[2023-03-08 21:29:06] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 735 ms. Remains : 316/316 places, 262/262 transitions.
Ending property specific reduction for DES-PT-50b-UpperBounds-10 in 6878 ms.
[2023-03-08 21:29:07] [INFO ] Flatten gal took : 62 ms
[2023-03-08 21:29:07] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 21:29:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 316 places, 262 transitions and 1275 arcs took 2 ms.
Total runtime 74645 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/788/ub_0_ --maxsum=/tmp/788/ub_1_ --maxsum=/tmp/788/ub_2_ --maxsum=/tmp/788/ub_3_ --maxsum=/tmp/788/ub_4_
FORMULA DES-PT-50b-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-50b-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-50b-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-50b-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-50b-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678311382106
--------------------
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-50b-UpperBounds-05
ub formula formula --maxsum=/tmp/788/ub_0_
ub formula name DES-PT-50b-UpperBounds-07
ub formula formula --maxsum=/tmp/788/ub_1_
ub formula name DES-PT-50b-UpperBounds-08
ub formula formula --maxsum=/tmp/788/ub_2_
ub formula name DES-PT-50b-UpperBounds-09
ub formula formula --maxsum=/tmp/788/ub_3_
ub formula name DES-PT-50b-UpperBounds-10
ub formula formula --maxsum=/tmp/788/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 316 places, 262 transitions and 1275 arcs
pnml2lts-sym: Petri net DES_PT_50b 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: 262->253 groups
pnml2lts-sym: Regrouping took 0.060 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 316; there are 253 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 71202065 group checks and 0 next state calls
pnml2lts-sym: reachability took 428.780 real 1668.060 user 45.260 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 1.700 real 6.780 user 0.000 sys
pnml2lts-sym: state space has 68312609047672 states, 3617838 nodes
pnml2lts-sym: Maximum sum of /tmp/788/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/788/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/788/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/788/ub_3_ is: 1
pnml2lts-sym: Maximum sum of /tmp/788/ub_4_ is: 1
pnml2lts-sym: group_next: 2796 nodes total
pnml2lts-sym: group_explored: 2906 nodes, 3528 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-50b"
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-50b, 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-167814481300485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 '
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 ;