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.r107-tall-167814484200421.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 smartxred
Input is DES-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484200421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 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 79K 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-10b-UpperBounds-00
FORMULA_NAME DES-PT-10b-UpperBounds-01
FORMULA_NAME DES-PT-10b-UpperBounds-02
FORMULA_NAME DES-PT-10b-UpperBounds-03
FORMULA_NAME DES-PT-10b-UpperBounds-04
FORMULA_NAME DES-PT-10b-UpperBounds-05
FORMULA_NAME DES-PT-10b-UpperBounds-06
FORMULA_NAME DES-PT-10b-UpperBounds-07
FORMULA_NAME DES-PT-10b-UpperBounds-08
FORMULA_NAME DES-PT-10b-UpperBounds-09
FORMULA_NAME DES-PT-10b-UpperBounds-10
FORMULA_NAME DES-PT-10b-UpperBounds-11
FORMULA_NAME DES-PT-10b-UpperBounds-12
FORMULA_NAME DES-PT-10b-UpperBounds-13
FORMULA_NAME DES-PT-10b-UpperBounds-14
FORMULA_NAME DES-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678368429123

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 13:27:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 13:27:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:27:10] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-09 13:27:10] [INFO ] Transformed 320 places.
[2023-03-09 13:27:10] [INFO ] Transformed 271 transitions.
[2023-03-09 13:27:10] [INFO ] Found NUPN structural information;
[2023-03-09 13:27:10] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 271 rows 320 cols
[2023-03-09 13:27:10] [INFO ] Computed 65 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 81 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :14
FORMULA DES-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
[2023-03-09 13:27:11] [INFO ] Invariant cache hit.
[2023-03-09 13:27:11] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-09 13:27:11] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-09 13:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:11] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-09 13:27:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:27:11] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-09 13:27:11] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-09 13:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:11] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-09 13:27:11] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2023-03-09 13:27:11] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-09 13:27:11] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2023-03-09 13:27:12] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2023-03-09 13:27:12] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2023-03-09 13:27:12] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2023-03-09 13:27:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 919 ms
[2023-03-09 13:27:12] [INFO ] Computed and/alt/rep : 265/485/265 causal constraints (skipped 5 transitions) in 23 ms.
[2023-03-09 13:27:13] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 0 ms to minimize.
[2023-03-09 13:27:13] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2023-03-09 13:27:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2023-03-09 13:27:13] [INFO ] Added : 243 causal constraints over 49 iterations in 1466 ms. Result :sat
Minimization took 135 ms.
[2023-03-09 13:27:14] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 13:27:14] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-09 13:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:14] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-09 13:27:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:27:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 10 ms returned sat
[2023-03-09 13:27:14] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 10 ms returned sat
[2023-03-09 13:27:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:14] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-09 13:27:14] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-09 13:27:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2023-03-09 13:27:14] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-03-09 13:27:14] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2023-03-09 13:27:14] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-03-09 13:27:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 329 ms
[2023-03-09 13:27:14] [INFO ] Computed and/alt/rep : 265/485/265 causal constraints (skipped 5 transitions) in 23 ms.
[2023-03-09 13:27:16] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-03-09 13:27:16] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2023-03-09 13:27:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2023-03-09 13:27:16] [INFO ] Added : 245 causal constraints over 50 iterations in 1461 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 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 309 transition count 243
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 288 transition count 243
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 288 transition count 234
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 279 transition count 234
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 260 transition count 215
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 260 transition count 215
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 260 transition count 214
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 259 transition count 214
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 244 transition count 199
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 244 transition count 199
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 244 transition count 184
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 242 transition count 183
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 242 transition count 180
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 239 transition count 180
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 162 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 160 transition count 105
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 160 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 159 transition count 104
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 159 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 158 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 157 transition count 103
Applied a total of 320 rules in 114 ms. Remains 157 /320 variables (removed 163) and now considering 103/271 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 157/320 places, 103/271 transitions.
// Phase 1: matrix 103 rows 157 cols
[2023-03-09 13:27:17] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47759 resets, run finished after 1724 ms. (steps per millisecond=580 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9093 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9073 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 2) seen :0
[2023-03-09 13:27:20] [INFO ] Invariant cache hit.
[2023-03-09 13:27:20] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:27:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-09 13:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:20] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-09 13:27:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:27:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-09 13:27:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 87 ms returned sat
[2023-03-09 13:27:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:20] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-09 13:27:20] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-09 13:27:20] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2023-03-09 13:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-09 13:27:20] [INFO ] Added : 77 causal constraints over 16 iterations in 190 ms. Result :sat
Minimization took 28 ms.
[2023-03-09 13:27:20] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:27:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 13:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:20] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-09 13:27:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:27:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:27:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 89 ms returned sat
[2023-03-09 13:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:21] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-09 13:27:21] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 7 ms.
[2023-03-09 13:27:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2023-03-09 13:27:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-09 13:27:21] [INFO ] Added : 83 causal constraints over 18 iterations in 237 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-09 13:27:21] [INFO ] Invariant cache hit.
[2023-03-09 13:27:21] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-09 13:27:21] [INFO ] Invariant cache hit.
[2023-03-09 13:27:21] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-09 13:27:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 13:27:21] [INFO ] Invariant cache hit.
[2023-03-09 13:27:21] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 157/157 places, 103/103 transitions.
Starting property specific reduction for DES-PT-10b-UpperBounds-05
[2023-03-09 13:27:21] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 454 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 13:27:22] [INFO ] Invariant cache hit.
[2023-03-09 13:27:22] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:27:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 13:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:22] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-09 13:27:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:27:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:27:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 89 ms returned sat
[2023-03-09 13:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:22] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-09 13:27:22] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-09 13:27:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2023-03-09 13:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-09 13:27:22] [INFO ] Added : 77 causal constraints over 16 iterations in 222 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 103/103 transitions.
[2023-03-09 13:27:22] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 48006 resets, run finished after 1746 ms. (steps per millisecond=572 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9187 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 1) seen :0
[2023-03-09 13:27:25] [INFO ] Invariant cache hit.
[2023-03-09 13:27:25] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:27:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-09 13:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:25] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-09 13:27:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:27:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 13:27:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 87 ms returned sat
[2023-03-09 13:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:25] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 13:27:25] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 5 ms.
[2023-03-09 13:27:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2023-03-09 13:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-09 13:27:25] [INFO ] Added : 77 causal constraints over 16 iterations in 203 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-09 13:27:25] [INFO ] Invariant cache hit.
[2023-03-09 13:27:25] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 13:27:25] [INFO ] Invariant cache hit.
[2023-03-09 13:27:26] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-09 13:27:26] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 13:27:26] [INFO ] Invariant cache hit.
[2023-03-09 13:27:26] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 157/157 places, 103/103 transitions.
Ending property specific reduction for DES-PT-10b-UpperBounds-05 in 4170 ms.
Starting property specific reduction for DES-PT-10b-UpperBounds-07
[2023-03-09 13:27:26] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 503 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 87 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 13:27:26] [INFO ] Invariant cache hit.
[2023-03-09 13:27:26] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:27:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 13:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:26] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-09 13:27:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:27:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 13:27:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 88 ms returned sat
[2023-03-09 13:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:26] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-09 13:27:26] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-09 13:27:26] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-09 13:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-09 13:27:26] [INFO ] Added : 83 causal constraints over 18 iterations in 244 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 103/103 transitions.
[2023-03-09 13:27:26] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 47755 resets, run finished after 1647 ms. (steps per millisecond=607 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9199 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 1) seen :0
[2023-03-09 13:27:29] [INFO ] Invariant cache hit.
[2023-03-09 13:27:29] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 13:27:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 13:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-09 13:27:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:27:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 13:27:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 86 ms returned sat
[2023-03-09 13:27:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:27:29] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 13:27:29] [INFO ] Computed and/alt/rep : 89/203/89 causal constraints (skipped 11 transitions) in 6 ms.
[2023-03-09 13:27:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2023-03-09 13:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 13:27:29] [INFO ] Added : 83 causal constraints over 18 iterations in 220 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-09 13:27:29] [INFO ] Invariant cache hit.
[2023-03-09 13:27:29] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-09 13:27:30] [INFO ] Invariant cache hit.
[2023-03-09 13:27:30] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-09 13:27:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 13:27:30] [INFO ] Invariant cache hit.
[2023-03-09 13:27:30] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 157/157 places, 103/103 transitions.
Ending property specific reduction for DES-PT-10b-UpperBounds-07 in 4070 ms.
[2023-03-09 13:27:30] [INFO ] Flatten gal took : 39 ms
[2023-03-09 13:27:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 13:27:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 103 transitions and 521 arcs took 2 ms.
Total runtime 19831 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 10b
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 157 places, 103 transitions, 521 arcs.
Final Score: 1629.2
Took : 4 seconds
Bounds file is: UpperBounds.xml
FORMULA DES-PT-10b-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DES-PT-10b-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678368582389

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

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-10b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is DES-PT-10b, 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 r107-tall-167814484200421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;