About the Execution of LTSMin+red for DES-PT-40a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7701.867 | 502387.00 | 1864753.00 | 490.20 | 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-167814481200461.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-40a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200461
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 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:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 83K 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-40a-UpperBounds-00
FORMULA_NAME DES-PT-40a-UpperBounds-01
FORMULA_NAME DES-PT-40a-UpperBounds-02
FORMULA_NAME DES-PT-40a-UpperBounds-03
FORMULA_NAME DES-PT-40a-UpperBounds-04
FORMULA_NAME DES-PT-40a-UpperBounds-05
FORMULA_NAME DES-PT-40a-UpperBounds-06
FORMULA_NAME DES-PT-40a-UpperBounds-07
FORMULA_NAME DES-PT-40a-UpperBounds-08
FORMULA_NAME DES-PT-40a-UpperBounds-09
FORMULA_NAME DES-PT-40a-UpperBounds-10
FORMULA_NAME DES-PT-40a-UpperBounds-11
FORMULA_NAME DES-PT-40a-UpperBounds-12
FORMULA_NAME DES-PT-40a-UpperBounds-13
FORMULA_NAME DES-PT-40a-UpperBounds-14
FORMULA_NAME DES-PT-40a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678304052548
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-40a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:34:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 19:34:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:34:14] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-08 19:34:14] [INFO ] Transformed 274 places.
[2023-03-08 19:34:14] [INFO ] Transformed 231 transitions.
[2023-03-08 19:34:14] [INFO ] Found NUPN structural information;
[2023-03-08 19:34:14] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 217 rows 274 cols
[2023-03-08 19:34:14] [INFO ] Computed 59 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 227 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 16) seen :7
FORMULA DES-PT-40a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
[2023-03-08 19:34:14] [INFO ] Invariant cache hit.
[2023-03-08 19:34:14] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-08 19:34:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 19:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:15] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-03-08 19:34:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-08 19:34:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 103 ms returned sat
[2023-03-08 19:34:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:15] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2023-03-08 19:34:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:34:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 109 ms returned sat
[2023-03-08 19:34:15] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 21 ms.
[2023-03-08 19:34:16] [INFO ] Added : 84 causal constraints over 17 iterations in 518 ms. Result :sat
Minimization took 364 ms.
[2023-03-08 19:34:16] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-08 19:34:16] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 19:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:16] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-08 19:34:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-08 19:34:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-08 19:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:17] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2023-03-08 19:34:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2023-03-08 19:34:17] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 3 ms to minimize.
[2023-03-08 19:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-08 19:34:17] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 31 ms.
[2023-03-08 19:34:18] [INFO ] Added : 97 causal constraints over 20 iterations in 828 ms. Result :sat
Minimization took 97 ms.
[2023-03-08 19:34:18] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 19:34:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 19:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:19] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-08 19:34:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 19:34:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 19:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:19] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-08 19:34:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 362 ms returned sat
[2023-03-08 19:34:19] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2023-03-08 19:34:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-03-08 19:34:20] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 40 ms.
[2023-03-08 19:34:20] [INFO ] Added : 69 causal constraints over 14 iterations in 692 ms. Result :sat
Minimization took 137 ms.
[2023-03-08 19:34:21] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 19:34:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 19:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:21] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-08 19:34:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 19:34:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 19:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:21] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-08 19:34:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 102 ms returned sat
[2023-03-08 19:34:21] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-08 19:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 19:34:21] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-08 19:34:22] [INFO ] Added : 171 causal constraints over 35 iterations in 846 ms. Result :sat
Minimization took 103 ms.
[2023-03-08 19:34:22] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 19:34:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 19:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:22] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-08 19:34:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 19:34:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 155 ms returned sat
[2023-03-08 19:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:23] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-08 19:34:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 119 ms returned sat
[2023-03-08 19:34:23] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2023-03-08 19:34:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 19:34:23] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-08 19:34:24] [INFO ] Added : 108 causal constraints over 22 iterations in 568 ms. Result :sat
Minimization took 106 ms.
[2023-03-08 19:34:24] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 19:34:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 19:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:24] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-08 19:34:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 19:34:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 160 ms returned sat
[2023-03-08 19:34:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:26] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2023-03-08 19:34:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-08 19:34:26] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-08 19:34:26] [INFO ] Added : 148 causal constraints over 30 iterations in 710 ms. Result :sat
Minimization took 128 ms.
[2023-03-08 19:34:27] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 19:34:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 19:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:27] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-08 19:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 19:34:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-08 19:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:27] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-08 19:34:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 152 ms returned sat
[2023-03-08 19:34:28] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-08 19:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-08 19:34:28] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-08 19:34:28] [INFO ] Added : 68 causal constraints over 14 iterations in 404 ms. Result :sat
Minimization took 85 ms.
[2023-03-08 19:34:28] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 19:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:28] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 19:34:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 19:34:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 97 ms returned sat
[2023-03-08 19:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:30] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2023-03-08 19:34:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 404 ms returned sat
[2023-03-08 19:34:30] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 19 ms.
[2023-03-08 19:34:31] [INFO ] Added : 149 causal constraints over 30 iterations in 804 ms. Result :sat
Minimization took 204 ms.
[2023-03-08 19:34:31] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 19:34:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 19:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:31] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-08 19:34:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 19:34:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 80 ms returned sat
[2023-03-08 19:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:32] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2023-03-08 19:34:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-08 19:34:32] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 12 ms.
[2023-03-08 19:34:33] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2023-03-08 19:34:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-08 19:34:33] [INFO ] Added : 153 causal constraints over 31 iterations in 933 ms. Result :sat
Minimization took 122 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-40a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 273 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 273 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 272 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 271 transition count 213
Applied a total of 12 rules in 84 ms. Remains 271 /274 variables (removed 3) and now considering 213/217 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 271/274 places, 213/217 transitions.
// Phase 1: matrix 213 rows 271 cols
[2023-03-08 19:34:36] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 13707 resets, run finished after 2114 ms. (steps per millisecond=473 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2281 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2246 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2236 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2319 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2295 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 5) seen :0
[2023-03-08 19:34:43] [INFO ] Invariant cache hit.
[2023-03-08 19:34:43] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 19:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:43] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-08 19:34:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:34:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 19:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:43] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-08 19:34:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:34:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 19:34:43] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 19:34:44] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2023-03-08 19:34:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-08 19:34:44] [INFO ] Added : 196 causal constraints over 41 iterations in 948 ms. Result :sat
Minimization took 88 ms.
[2023-03-08 19:34:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 19:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:44] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-08 19:34:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 67 ms returned sat
[2023-03-08 19:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:44] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-08 19:34:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 19:34:45] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2023-03-08 19:34:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 19:34:45] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 19:34:45] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-08 19:34:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-08 19:34:45] [INFO ] Added : 85 causal constraints over 17 iterations in 379 ms. Result :sat
Minimization took 89 ms.
[2023-03-08 19:34:45] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 19:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:45] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-08 19:34:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-08 19:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:46] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-03-08 19:34:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2023-03-08 19:34:46] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 19:34:46] [INFO ] Added : 155 causal constraints over 31 iterations in 532 ms. Result :sat
Minimization took 98 ms.
[2023-03-08 19:34:46] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:34:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 19:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:46] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-08 19:34:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 19:34:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-08 19:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:47] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2023-03-08 19:34:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2023-03-08 19:34:47] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2023-03-08 19:34:47] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-03-08 19:34:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-03-08 19:34:47] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-08 19:34:47] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2023-03-08 19:34:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 19:34:48] [INFO ] Added : 179 causal constraints over 37 iterations in 678 ms. Result :sat
Minimization took 70 ms.
[2023-03-08 19:34:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 19:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:48] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-08 19:34:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 124 ms returned sat
[2023-03-08 19:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:48] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2023-03-08 19:34:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2023-03-08 19:34:48] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 19:34:49] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2023-03-08 19:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-08 19:34:49] [INFO ] Added : 183 causal constraints over 37 iterations in 701 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA DES-PT-40a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-08 19:34:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13554 resets, run finished after 2075 ms. (steps per millisecond=481 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2298 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 1) seen :0
[2023-03-08 19:34:54] [INFO ] Invariant cache hit.
[2023-03-08 19:34:54] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 19:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:54] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 19:34:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:34:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 19:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:54] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-08 19:34:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:34:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-08 19:34:54] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 19:34:55] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2023-03-08 19:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-08 19:34:55] [INFO ] Added : 196 causal constraints over 41 iterations in 674 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 19:34:55] [INFO ] Invariant cache hit.
[2023-03-08 19:34:56] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 19:34:56] [INFO ] Invariant cache hit.
[2023-03-08 19:34:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:34:56] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-08 19:34:56] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 19:34:56] [INFO ] Invariant cache hit.
[2023-03-08 19:34:56] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 666 ms. Remains : 271/271 places, 213/213 transitions.
Starting property specific reduction for DES-PT-40a-UpperBounds-08
[2023-03-08 19:34:56] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-08 19:34:56] [INFO ] Invariant cache hit.
[2023-03-08 19:34:56] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 19:34:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 19:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:56] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-08 19:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:34:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 19:34:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 19:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:34:56] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-08 19:34:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:34:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 19:34:56] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 19:34:57] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2023-03-08 19:34:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-08 19:34:57] [INFO ] Added : 196 causal constraints over 41 iterations in 725 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 271/271 places, 213/213 transitions.
[2023-03-08 19:34:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13706 resets, run finished after 2018 ms. (steps per millisecond=495 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2265 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 1) seen :0
[2023-03-08 19:35:01] [INFO ] Invariant cache hit.
[2023-03-08 19:35:01] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 19:35:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 19:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:35:01] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-08 19:35:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:35:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 19:35:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 19:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:35:01] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-08 19:35:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:35:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 19:35:01] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 19:35:02] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2023-03-08 19:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-08 19:35:02] [INFO ] Added : 196 causal constraints over 41 iterations in 712 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-08 19:35:02] [INFO ] Invariant cache hit.
[2023-03-08 19:35:02] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 19:35:02] [INFO ] Invariant cache hit.
[2023-03-08 19:35:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 19:35:03] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-08 19:35:03] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-08 19:35:03] [INFO ] Invariant cache hit.
[2023-03-08 19:35:03] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 700 ms. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-08 in 6794 ms.
[2023-03-08 19:35:03] [INFO ] Flatten gal took : 55 ms
[2023-03-08 19:35:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 19:35:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 213 transitions and 1029 arcs took 2 ms.
Total runtime 49230 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/643/ub_0_
FORMULA DES-PT-40a-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678304554935
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DES-PT-40a-UpperBounds-08
ub formula formula --maxsum=/tmp/643/ub_0_
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 271 places, 213 transitions and 1029 arcs
pnml2lts-sym: Petri net DES_PT_40a analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 213->208 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 271; there are 208 groups
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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 68574930 group checks and 0 next state calls
pnml2lts-sym: reachability took 446.170 real 1770.410 user 13.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.940 real 3.760 user 0.000 sys
pnml2lts-sym: state space has 17733739550780 states, 3777510 nodes
pnml2lts-sym: Maximum sum of /tmp/643/ub_0_ is: 1
pnml2lts-sym: group_next: 2316 nodes total
pnml2lts-sym: group_explored: 2424 nodes, 3136 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-40a"
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-40a, 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-167814481200461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;