About the Execution of ITS-Tools for DBSingleClientW-PT-d1m05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3078.411 | 111479.00 | 137616.00 | 373.30 | 8.7207E+0006 ? 5 6 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189400504.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DBSingleClientW-PT-d1m05, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189400504
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
no data necessary for post analysis
=== Now, execution of the tool begins
BK_START 1716319891160
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-21 19:31:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:31:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:31:32] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-21 19:31:32] [INFO ] Transformed 1440 places.
[2024-05-21 19:31:32] [INFO ] Transformed 672 transitions.
[2024-05-21 19:31:32] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 216 ms.
Deduced a syphon composed of 1093 places in 11 ms
Reduce places removed 1093 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 347/347 places, 672/672 transitions.
[2024-05-21 19:31:32] [INFO ] Redundant transitions in 44 ms returned []
Running 671 sub problems to find dead transitions.
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 19:31:32] [INFO ] Computed 6 invariants in 39 ms
[2024-05-21 19:31:32] [INFO ] State equation strengthened by 418 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (OVERLAPS) 8/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:31:42] [INFO ] Deduced a trap composed of 160 places in 106 ms of which 16 ms to minimize.
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 2 ms to minimize.
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:31:47] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:31:47] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-21 19:31:47] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-21 19:31:47] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 3 ms to minimize.
[2024-05-21 19:31:47] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 6 ms to minimize.
[2024-05-21 19:31:47] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 19:31:47] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:31:47] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:31:48] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:31:48] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 3 ms to minimize.
[2024-05-21 19:31:48] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:31:55] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-05-21 19:31:55] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:31:55] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:31:55] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:31:55] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-21 19:31:55] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:31:55] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:31:56] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 3 ms to minimize.
[2024-05-21 19:31:56] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:31:56] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:31:56] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:31:56] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:31:56] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:31:57] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 3 ms to minimize.
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 2 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 4 ms to minimize.
[2024-05-21 19:32:03] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:32:03] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:32:03] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:32:03] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:32:03] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:32:03] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-21 19:32:03] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:32:04] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 2 ms to minimize.
[2024-05-21 19:32:04] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/1019 variables, and 65 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/347 constraints, ReadFeed: 0/418 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (OVERLAPS) 8/333 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 46/65 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:32:12] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-21 19:32:12] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:32:13] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:32:13] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-05-21 19:32:13] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-21 19:32:13] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:32:13] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:32:14] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:32:14] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:32:14] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2024-05-21 19:32:14] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:32:14] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:32:14] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:32:14] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:32:14] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:32:14] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:32:15] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:32:15] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-05-21 19:32:15] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:32:15] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:32:19] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:32:20] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:32:21] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:32:21] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:32:21] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:32:21] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-21 19:32:21] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:32:21] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-21 19:32:21] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:32:25] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
[2024-05-21 19:32:25] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-21 19:32:26] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:32:26] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:32:26] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-21 19:32:26] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 2 ms to minimize.
[2024-05-21 19:32:26] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:32:26] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 2 ms to minimize.
[2024-05-21 19:32:26] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:32:27] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-21 19:32:27] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:32:27] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-21 19:32:27] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-21 19:32:27] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-21 19:32:27] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-21 19:32:27] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:32:28] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-21 19:32:28] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:32:28] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-05-21 19:32:28] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:32:32] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-21 19:32:32] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 2 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-05-21 19:32:35] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:32:35] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/1019 variables, and 143 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/347 constraints, ReadFeed: 0/418 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 138/138 constraints]
After SMT, in 62402ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 62431ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 62640 ms. Remains : 347/347 places, 672/672 transitions.
Final net has 347 places and 672 transitions.
[2024-05-21 19:32:35] [INFO ] Flatten gal took : 77 ms
[2024-05-21 19:32:35] [INFO ] Applying decomposition
[2024-05-21 19:32:35] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9258723762080764912.txt' '-o' '/tmp/graph9258723762080764912.bin' '-w' '/tmp/graph9258723762080764912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9258723762080764912.bin' '-l' '-1' '-v' '-w' '/tmp/graph9258723762080764912.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:32:35] [INFO ] Decomposing Gal with order
[2024-05-21 19:32:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:32:35] [INFO ] Removed a total of 539 redundant transitions.
[2024-05-21 19:32:35] [INFO ] Flatten gal took : 146 ms
[2024-05-21 19:32:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 715 labels/synchronizations in 30 ms.
[2024-05-21 19:32:35] [INFO ] Time to serialize gal into /tmp/StateSpace11498670658962590482.gal : 9 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace11498670658962590482.gal' '-t' 'CGAL' '--stats'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
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,8.7207e+06,46.4622,1004440,5444,14852,657308,881671,1039,2.96468e+06,704,7.67501e+06,0
Total reachable state count : 8720695
Max variable value : 5
STATE_SPACE MAX_TOKEN_IN_PLACE 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 6
STATE_SPACE MAX_TOKEN_PER_MARKING 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 8720695
STATE_SPACE STATES 8720695 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 110261 ms.
BK_STOP 1716320002639
--------------------
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
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -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-d1m05"
export BK_EXAMINATION="StateSpace"
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-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m05, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189400504"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m05.tgz
mv DBSingleClientW-PT-d1m05 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;