fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r101-tall-167814475100221
Last Updated
May 14, 2023

About the Execution of ITS-Tools for DBSingleClientW-PT-d0m09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
486.928 13165.00 19288.00 503.00 0 1 0 0 0 0 6 0 0 0 1 0 0 0 1 0 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475100221.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-d0m09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475100221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 12K Feb 26 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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-d0m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678238446692

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-d0m09
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 01:20:48] [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:20:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:20:48] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 01:20:48] [INFO ] Transformed 553 places.
[2023-03-08 01:20:48] [INFO ] Transformed 150 transitions.
[2023-03-08 01:20:48] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-08 01:20:48] [INFO ] Computed 6 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 993 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 967 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 989 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :1
[2023-03-08 01:20:48] [INFO ] Invariant cache hit.
[2023-03-08 01:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-08 01:20:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
[2023-03-08 01:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 01:20:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 01:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:48] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-08 01:20:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:20:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 01:20:48] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 01:20:48] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 01:20:48] [INFO ] [Nat]Added 74 Read/Feed constraints in 11 ms returned sat
[2023-03-08 01:20:49] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
[2023-03-08 01:20:49] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2023-03-08 01:20:49] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2023-03-08 01:20:49] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 2 ms to minimize.
[2023-03-08 01:20:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 267 ms
[2023-03-08 01:20:49] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 19 ms.
[2023-03-08 01:20:49] [INFO ] Added : 10 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 278 ms.
[2023-03-08 01:20:49] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-08 01:20:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 01:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:49] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 01:20:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:20:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 01:20:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 01:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:49] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-08 01:20:49] [INFO ] [Nat]Added 74 Read/Feed constraints in 12 ms returned sat
[2023-03-08 01:20:49] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 16 ms.
[2023-03-08 01:20:49] [INFO ] Added : 2 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 19 ms.
[2023-03-08 01:20:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 01:20:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 9, 6, 1] Max seen :[1, 0, 0, 1]
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-01 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.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 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 98
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 78 transition count 97
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 71 place count 68 transition count 87
Iterating global reduction 2 with 10 rules applied. Total rules applied 81 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 66 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 63 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 63 transition count 77
Applied a total of 94 rules in 47 ms. Remains 63 /109 variables (removed 46) and now considering 77/150 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 63/109 places, 77/150 transitions.
// Phase 1: matrix 77 rows 63 cols
[2023-03-08 01:20:49] [INFO ] Computed 2 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 229106 resets, run finished after 715 ms. (steps per millisecond=1398 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000000 steps, including 101451 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000000 steps, including 101560 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 2) seen :1
[2023-03-08 01:20:51] [INFO ] Invariant cache hit.
[2023-03-08 01:20:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:20:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:20:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:51] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 01:20:51] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:20:51] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2023-03-08 01:20:51] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 55 transitions) in 5 ms.
[2023-03-08 01:20:51] [INFO ] Added : 10 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 15 ms.
[2023-03-08 01:20:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:51] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [9, 1] Max seen :[0, 1]
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 61 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 59 transition count 69
Applied a total of 10 rules in 14 ms. Remains 59 /63 variables (removed 4) and now considering 69/77 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 59/63 places, 69/77 transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-08 01:20:51] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 228797 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 101823 resets, run finished after 297 ms. (steps per millisecond=3367 ) properties (out of 1) seen :0
[2023-03-08 01:20:52] [INFO ] Invariant cache hit.
[2023-03-08 01:20:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-08 01:20:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:20:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:52] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-08 01:20:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:20:52] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2023-03-08 01:20:52] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 49 transitions) in 5 ms.
[2023-03-08 01:20:52] [INFO ] Added : 10 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 59/59 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:20:52] [INFO ] Invariant cache hit.
[2023-03-08 01:20:52] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:20:52] [INFO ] Invariant cache hit.
[2023-03-08 01:20:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:20:52] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-08 01:20:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:20:52] [INFO ] Invariant cache hit.
[2023-03-08 01:20:52] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 59/59 places, 69/69 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-06
[2023-03-08 01:20:52] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
[2023-03-08 01:20:52] [INFO ] Invariant cache hit.
[2023-03-08 01:20:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 01:20:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:20:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 01:20:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:20:52] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2023-03-08 01:20:52] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 49 transitions) in 5 ms.
[2023-03-08 01:20:52] [INFO ] Added : 10 causal constraints over 3 iterations in 26 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, 69/69 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 59/59 places, 69/69 transitions.
[2023-03-08 01:20:53] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229104 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 101778 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 1) seen :0
[2023-03-08 01:20:53] [INFO ] Invariant cache hit.
[2023-03-08 01:20:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 01:20:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:20:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:20:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-08 01:20:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:20:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 2 ms returned sat
[2023-03-08 01:20:54] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 49 transitions) in 5 ms.
[2023-03-08 01:20:54] [INFO ] Added : 10 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 20 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, 69/69 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-08 01:20:54] [INFO ] Invariant cache hit.
[2023-03-08 01:20:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 01:20:54] [INFO ] Invariant cache hit.
[2023-03-08 01:20:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-08 01:20:54] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 01:20:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:20:54] [INFO ] Invariant cache hit.
[2023-03-08 01:20:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 59/59 places, 69/69 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-06 in 1386 ms.
[2023-03-08 01:20:54] [INFO ] Flatten gal took : 26 ms
[2023-03-08 01:20:54] [INFO ] Applying decomposition
[2023-03-08 01:20:54] [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/graph1179837904729898986.txt' '-o' '/tmp/graph1179837904729898986.bin' '-w' '/tmp/graph1179837904729898986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1179837904729898986.bin' '-l' '-1' '-v' '-w' '/tmp/graph1179837904729898986.weights' '-q' '0' '-e' '0.001'
[2023-03-08 01:20:54] [INFO ] Decomposing Gal with order
[2023-03-08 01:20:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 01:20:54] [INFO ] Removed a total of 72 redundant transitions.
[2023-03-08 01:20:54] [INFO ] Flatten gal took : 31 ms
[2023-03-08 01:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 6 ms.
[2023-03-08 01:20:54] [INFO ] Time to serialize gal into /tmp/UpperBounds1485700429079251494.gal : 3 ms
[2023-03-08 01:20:54] [INFO ] Time to serialize properties into /tmp/UpperBounds6431486288577907196.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/UpperBounds1485700429079251494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6431486288577907196.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 ...283
Loading property file /tmp/UpperBounds6431486288577907196.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,1.09495e+07,3.82018,89876,1565,472,93627,18235,237,573900,55,87975,0
Total reachable state count : 10949504

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property DBSingleClientW-PT-d0m09-UpperBounds-06 :0 <= i5.u9.l353 <= 6
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-06 6 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-d0m09-UpperBounds-06,0,4.06199,89876,1,0,93627,18235,314,573900,73,87975,1374
Total runtime 10537 ms.

BK_STOP 1678238459857

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-d0m09"
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-d0m09, 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-167814475100221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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