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-167814483900229.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 DBSingleClientW-PT-d0m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814483900229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678347683911

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=DBSingleClientW-PT-d0m10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 07:41:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 07:41:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:41:25] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-09 07:41:25] [INFO ] Transformed 553 places.
[2023-03-09 07:41:25] [INFO ] Transformed 150 transitions.
[2023-03-09 07:41:25] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-09 07:41:25] [INFO ] Computed 6 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 2264 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 1060 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 983 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 965 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
[2023-03-09 07:41:25] [INFO ] Invariant cache hit.
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-09 07:41:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:41:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:26] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-09 07:41:26] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-09 07:41:26] [INFO ] [Nat]Added 74 Read/Feed constraints in 12 ms returned sat
[2023-03-09 07:41:26] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 3 ms to minimize.
[2023-03-09 07:41:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-09 07:41:26] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 39 ms.
[2023-03-09 07:41:26] [INFO ] Added : 6 causal constraints over 2 iterations in 83 ms. Result :sat
Minimization took 24 ms.
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned unsat
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:26] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-09 07:41:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:41:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:26] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-09 07:41:26] [INFO ] [Nat]Added 74 Read/Feed constraints in 10 ms returned sat
[2023-03-09 07:41:26] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 19 ms.
[2023-03-09 07:41:26] [INFO ] Added : 7 causal constraints over 2 iterations in 53 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [10, 1, 1, 10] Max seen :[0, 1, 1, 0]
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 36 place count 79 transition count 99
Iterating global reduction 1 with 22 rules applied. Total rules applied 58 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 79 transition count 98
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 69 place count 69 transition count 88
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 66 transition count 80
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 90 place count 64 transition count 76
Iterating global reduction 4 with 2 rules applied. Total rules applied 92 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 62 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 99 place count 61 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 61 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 102 place count 61 transition count 69
Applied a total of 102 rules in 52 ms. Remains 61 /109 variables (removed 48) and now considering 69/150 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 61/109 places, 69/150 transitions.
// Phase 1: matrix 69 rows 61 cols
[2023-03-09 07:41:26] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229388 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 102776 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 102101 resets, run finished after 334 ms. (steps per millisecond=2994 ) properties (out of 2) seen :1
[2023-03-09 07:41:28] [INFO ] Invariant cache hit.
[2023-03-09 07:41:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:28] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2023-03-09 07:41:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:28] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 07:41:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:41:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-09 07:41:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:28] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-09 07:41:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 07:41:28] [INFO ] [Nat]Added 24 Read/Feed constraints in 11 ms returned sat
[2023-03-09 07:41:28] [INFO ] Computed and/alt/rep : 19/35/19 causal constraints (skipped 49 transitions) in 9 ms.
[2023-03-09 07:41:28] [INFO ] Added : 6 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1, 10] Max seen :[1, 0]
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 69/69 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 59 transition count 67
Applied a total of 4 rules in 11 ms. Remains 59 /61 variables (removed 2) and now considering 67/69 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 59/61 places, 67/69 transitions.
// Phase 1: matrix 67 rows 59 cols
[2023-03-09 07:41:28] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229443 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 101377 resets, run finished after 311 ms. (steps per millisecond=3215 ) properties (out of 1) seen :0
[2023-03-09 07:41:29] [INFO ] Invariant cache hit.
[2023-03-09 07:41:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 07:41:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:41:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-09 07:41:29] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-09 07:41:29] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2023-03-09 07:41:29] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 48 transitions) in 5 ms.
[2023-03-09 07:41:29] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-09 07:41:29] [INFO ] Invariant cache hit.
[2023-03-09 07:41:29] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 07:41:29] [INFO ] Invariant cache hit.
[2023-03-09 07:41:29] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-09 07:41:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-09 07:41:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 07:41:29] [INFO ] Invariant cache hit.
[2023-03-09 07:41:29] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 59/59 places, 67/67 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-13
[2023-03-09 07:41:29] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1063 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-09 07:41:29] [INFO ] Invariant cache hit.
[2023-03-09 07:41:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-09 07:41:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:41:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 07:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-09 07:41:30] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-09 07:41:30] [INFO ] [Nat]Added 23 Read/Feed constraints in 5 ms returned sat
[2023-03-09 07:41:30] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 48 transitions) in 10 ms.
[2023-03-09 07:41:30] [INFO ] Added : 8 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 59/59 places, 67/67 transitions.
[2023-03-09 07:41:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229371 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 101532 resets, run finished after 334 ms. (steps per millisecond=2994 ) properties (out of 1) seen :1
[2023-03-09 07:41:31] [INFO ] Invariant cache hit.
[2023-03-09 07:41:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 07:41:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-09 07:41:31] [INFO ] [Real]Added 23 Read/Feed constraints in 4 ms returned sat
[2023-03-09 07:41:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:41:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:31] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-09 07:41:31] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2023-03-09 07:41:31] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 48 transitions) in 6 ms.
[2023-03-09 07:41:31] [INFO ] Added : 6 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-09 07:41:31] [INFO ] Invariant cache hit.
[2023-03-09 07:41:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 07:41:31] [INFO ] Invariant cache hit.
[2023-03-09 07:41:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-09 07:41:31] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-09 07:41:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:41:31] [INFO ] Invariant cache hit.
[2023-03-09 07:41:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 59/59 places, 67/67 transitions.
[2023-03-09 07:41:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229711 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 101839 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 1) seen :0
[2023-03-09 07:41:32] [INFO ] Invariant cache hit.
[2023-03-09 07:41:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:32] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 07:41:32] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-09 07:41:32] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2023-03-09 07:41:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:41:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 07:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:41:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-09 07:41:32] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2023-03-09 07:41:32] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 48 transitions) in 5 ms.
[2023-03-09 07:41:32] [INFO ] Added : 6 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2023-03-09 07:41:32] [INFO ] Invariant cache hit.
[2023-03-09 07:41:32] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 07:41:32] [INFO ] Invariant cache hit.
[2023-03-09 07:41:32] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-09 07:41:32] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-09 07:41:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 07:41:32] [INFO ] Invariant cache hit.
[2023-03-09 07:41:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 59/59 places, 67/67 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-13 in 2779 ms.
[2023-03-09 07:41:32] [INFO ] Flatten gal took : 53 ms
[2023-03-09 07:41:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 07:41:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 67 transitions and 263 arcs took 2 ms.
Total runtime 7561 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DBSingleClientW (PT), instance d0m10
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: 59 places, 67 transitions, 263 arcs.
Final Score: 642.921
Took : 3 seconds
Bounds file is: UpperBounds.xml
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-13 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678347699788

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

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="DBSingleClientW-PT-d0m10"
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 DBSingleClientW-PT-d0m10, 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-167814483900229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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