Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475100213.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DBSingleClientW-PT-d0m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475100213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 26 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:34 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-d0m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678238198221

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 01:16:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 01:16:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:16:39] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-08 01:16:39] [INFO ] Transformed 553 places.
[2023-03-08 01:16:39] [INFO ] Transformed 150 transitions.
[2023-03-08 01:16:39] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 304 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-d0m08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-08 01:16:40] [INFO ] Computed 6 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 1035 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 1031 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
[2023-03-08 01:16:40] [INFO ] Invariant cache hit.
[2023-03-08 01:16:40] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:16:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned unsat
[2023-03-08 01:16:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 01:16:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 01:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:40] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 01:16:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:16:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 01:16:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 01:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:40] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 01:16:40] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 01:16:40] [INFO ] [Nat]Added 74 Read/Feed constraints in 11 ms returned sat
[2023-03-08 01:16:40] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2023-03-08 01:16:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-08 01:16:40] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 16 ms.
[2023-03-08 01:16:40] [INFO ] Added : 6 causal constraints over 2 iterations in 52 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1, 56] Max seen :[1, 0]
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 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.1 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 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 38 place count 77 transition count 95
Iterating global reduction 1 with 24 rules applied. Total rules applied 62 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 77 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 65 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 65 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 62 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 60 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 58 transition count 68
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 58 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 106 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 57 transition count 65
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 57 transition count 63
Applied a total of 110 rules in 41 ms. Remains 57 /109 variables (removed 52) and now considering 63/150 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 57/109 places, 63/150 transitions.
// Phase 1: matrix 63 rows 57 cols
[2023-03-08 01:16:40] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229035 resets, run finished after 677 ms. (steps per millisecond=1477 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 101580 resets, run finished after 341 ms. (steps per millisecond=2932 ) properties (out of 1) seen :1
[2023-03-08 01:16:41] [INFO ] Invariant cache hit.
[2023-03-08 01:16:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:41] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 01:16:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:16:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:41] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-08 01:16:41] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 01:16:41] [INFO ] [Nat]Added 19 Read/Feed constraints in 12 ms returned sat
[2023-03-08 01:16:41] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-08 01:16:42] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2023-03-08 01:16:42] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-08 01:16:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2023-03-08 01:16:42] [INFO ] Added : 7 causal constraints over 3 iterations in 195 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [56] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-08 01:16:42] [INFO ] Invariant cache hit.
[2023-03-08 01:16:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 01:16:42] [INFO ] Invariant cache hit.
[2023-03-08 01:16:42] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 01:16:42] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 01:16:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:16:42] [INFO ] Invariant cache hit.
[2023-03-08 01:16:42] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 57/57 places, 63/63 transitions.
[2023-03-08 01:16:42] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 228830 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 101686 resets, run finished after 302 ms. (steps per millisecond=3311 ) properties (out of 1) seen :1
[2023-03-08 01:16:43] [INFO ] Invariant cache hit.
[2023-03-08 01:16:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:43] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-08 01:16:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:16:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:43] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-08 01:16:43] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 01:16:43] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-08 01:16:43] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-08 01:16:43] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2023-03-08 01:16:43] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2023-03-08 01:16:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2023-03-08 01:16:43] [INFO ] Added : 7 causal constraints over 3 iterations in 112 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [56] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-08 01:16:43] [INFO ] Invariant cache hit.
[2023-03-08 01:16:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 01:16:43] [INFO ] Invariant cache hit.
[2023-03-08 01:16:43] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 01:16:43] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-08 01:16:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:16:43] [INFO ] Invariant cache hit.
[2023-03-08 01:16:43] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 57/57 places, 63/63 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-08
[2023-03-08 01:16:43] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1011 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
[2023-03-08 01:16:43] [INFO ] Invariant cache hit.
[2023-03-08 01:16:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 01:16:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:16:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:43] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:16:43] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 01:16:43] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-08 01:16:43] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 6 ms.
[2023-03-08 01:16:43] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2023-03-08 01:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-08 01:16:43] [INFO ] Added : 5 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 57/57 places, 63/63 transitions.
[2023-03-08 01:16:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229211 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 101568 resets, run finished after 294 ms. (steps per millisecond=3401 ) properties (out of 1) seen :1
[2023-03-08 01:16:44] [INFO ] Invariant cache hit.
[2023-03-08 01:16:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:44] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 01:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:16:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:44] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 01:16:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 01:16:44] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-08 01:16:44] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-08 01:16:44] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-08 01:16:44] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-08 01:16:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2023-03-08 01:16:44] [INFO ] Added : 7 causal constraints over 3 iterations in 116 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-08 01:16:45] [INFO ] Invariant cache hit.
[2023-03-08 01:16:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 01:16:45] [INFO ] Invariant cache hit.
[2023-03-08 01:16:45] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 01:16:45] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-08 01:16:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 01:16:45] [INFO ] Invariant cache hit.
[2023-03-08 01:16:45] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 57/57 places, 63/63 transitions.
[2023-03-08 01:16:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229040 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 102123 resets, run finished after 293 ms. (steps per millisecond=3412 ) properties (out of 1) seen :1
[2023-03-08 01:16:45] [INFO ] Invariant cache hit.
[2023-03-08 01:16:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:46] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 01:16:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:16:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:16:46] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-08 01:16:46] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 01:16:46] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-08 01:16:46] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 4 ms.
[2023-03-08 01:16:46] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-08 01:16:46] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-08 01:16:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-08 01:16:46] [INFO ] Added : 7 causal constraints over 3 iterations in 130 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-08 01:16:46] [INFO ] Invariant cache hit.
[2023-03-08 01:16:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 01:16:46] [INFO ] Invariant cache hit.
[2023-03-08 01:16:46] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 01:16:46] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 01:16:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:16:46] [INFO ] Invariant cache hit.
[2023-03-08 01:16:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-08 in 2771 ms.
[2023-03-08 01:16:46] [INFO ] Flatten gal took : 26 ms
[2023-03-08 01:16:46] [INFO ] Applying decomposition
[2023-03-08 01:16:46] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16497372006332539423.txt' '-o' '/tmp/graph16497372006332539423.bin' '-w' '/tmp/graph16497372006332539423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16497372006332539423.bin' '-l' '-1' '-v' '-w' '/tmp/graph16497372006332539423.weights' '-q' '0' '-e' '0.001'
[2023-03-08 01:16:46] [INFO ] Decomposing Gal with order
[2023-03-08 01:16:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 01:16:46] [INFO ] Removed a total of 65 redundant transitions.
[2023-03-08 01:16:46] [INFO ] Flatten gal took : 43 ms
[2023-03-08 01:16:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 8 ms.
[2023-03-08 01:16:46] [INFO ] Time to serialize gal into /tmp/UpperBounds6466735823949243642.gal : 3 ms
[2023-03-08 01:16:46] [INFO ] Time to serialize properties into /tmp/UpperBounds11355652718835154891.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6466735823949243642.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11355652718835154891.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds11355652718835154891.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.28008e+06,2.13064,59784,1923,302,74153,1690,236,303986,42,11031,0
Total reachable state count : 2280080

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d0m08-UpperBounds-08 :0 <= i6.u13.l115 <= 3
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-08 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d0m08-UpperBounds-08,0,2.32769,59784,1,0,74153,5401,310,303986,56,34721,1284
Total runtime 9450 ms.

BK_STOP 1678238210087

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d0m08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475100213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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