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.r268-smll-171654407200224.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 Peterson-COL-4, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407200224
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 02:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 02:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 03:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:43 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 1716737328061

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
StateSpace COL
Running Version 202405141337
[2024-05-26 15:28:49] [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-26 15:28:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 15:28:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 15:28:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 15:28:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1022 ms
[2024-05-26 15:28:51] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 36 ms.
[2024-05-26 15:28:51] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 61 ms.
[2024-05-26 15:28:51] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 40 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 480/480 places, 690/690 transitions.
[2024-05-26 15:28:51] [INFO ] Redundant transitions in 43 ms returned []
Running 685 sub problems to find dead transitions.
[2024-05-26 15:28:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 15:28:51] [INFO ] Computed 19 invariants in 23 ms
[2024-05-26 15:28:51] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 15:28:59] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 51 ms to minimize.
[2024-05-26 15:28:59] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 5 ms to minimize.
[2024-05-26 15:29:00] [INFO ] Deduced a trap composed of 91 places in 242 ms of which 5 ms to minimize.
[2024-05-26 15:29:00] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 4 ms to minimize.
[2024-05-26 15:29:00] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 4 ms to minimize.
[2024-05-26 15:29:00] [INFO ] Deduced a trap composed of 121 places in 251 ms of which 4 ms to minimize.
[2024-05-26 15:29:01] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 4 ms to minimize.
[2024-05-26 15:29:01] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 5 ms to minimize.
[2024-05-26 15:29:01] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 4 ms to minimize.
[2024-05-26 15:29:01] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 4 ms to minimize.
[2024-05-26 15:29:02] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 4 ms to minimize.
[2024-05-26 15:29:02] [INFO ] Deduced a trap composed of 70 places in 254 ms of which 4 ms to minimize.
[2024-05-26 15:29:02] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 4 ms to minimize.
[2024-05-26 15:29:02] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 4 ms to minimize.
[2024-05-26 15:29:03] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 5 ms to minimize.
[2024-05-26 15:29:03] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 4 ms to minimize.
[2024-05-26 15:29:03] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
[2024-05-26 15:29:03] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 4 ms to minimize.
[2024-05-26 15:29:04] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 4 ms to minimize.
[2024-05-26 15:29:04] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 15:29:04] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 4 ms to minimize.
[2024-05-26 15:29:05] [INFO ] Deduced a trap composed of 62 places in 307 ms of which 5 ms to minimize.
[2024-05-26 15:29:05] [INFO ] Deduced a trap composed of 87 places in 223 ms of which 4 ms to minimize.
[2024-05-26 15:29:05] [INFO ] Deduced a trap composed of 88 places in 252 ms of which 4 ms to minimize.
[2024-05-26 15:29:06] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 4 ms to minimize.
[2024-05-26 15:29:06] [INFO ] Deduced a trap composed of 70 places in 281 ms of which 7 ms to minimize.
[2024-05-26 15:29:06] [INFO ] Deduced a trap composed of 39 places in 394 ms of which 7 ms to minimize.
[2024-05-26 15:29:07] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 4 ms to minimize.
[2024-05-26 15:29:07] [INFO ] Deduced a trap composed of 90 places in 292 ms of which 6 ms to minimize.
[2024-05-26 15:29:07] [INFO ] Deduced a trap composed of 40 places in 360 ms of which 6 ms to minimize.
[2024-05-26 15:29:08] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 5 ms to minimize.
[2024-05-26 15:29:08] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-26 15:29:08] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-05-26 15:29:08] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2024-05-26 15:29:08] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 5 ms to minimize.
[2024-05-26 15:29:09] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 4 ms to minimize.
[2024-05-26 15:29:09] [INFO ] Deduced a trap composed of 159 places in 248 ms of which 4 ms to minimize.
[2024-05-26 15:29:09] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-26 15:29:09] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-26 15:29:09] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 15:29:16] [INFO ] Deduced a trap composed of 80 places in 251 ms of which 4 ms to minimize.
[2024-05-26 15:29:16] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 4 ms to minimize.
[2024-05-26 15:29:17] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 4 ms to minimize.
[2024-05-26 15:29:17] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 3 ms to minimize.
[2024-05-26 15:29:17] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-05-26 15:29:17] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 2 ms to minimize.
[2024-05-26 15:29:17] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 4 ms to minimize.
[2024-05-26 15:29:18] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 4 ms to minimize.
[2024-05-26 15:29:18] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 4 ms to minimize.
[2024-05-26 15:29:18] [INFO ] Deduced a trap composed of 69 places in 269 ms of which 4 ms to minimize.
[2024-05-26 15:29:18] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 5 ms to minimize.
[2024-05-26 15:29:19] [INFO ] Deduced a trap composed of 10 places in 364 ms of which 6 ms to minimize.
[2024-05-26 15:29:19] [INFO ] Deduced a trap composed of 95 places in 291 ms of which 5 ms to minimize.
[2024-05-26 15:29:19] [INFO ] Deduced a trap composed of 39 places in 281 ms of which 6 ms to minimize.
[2024-05-26 15:29:20] [INFO ] Deduced a trap composed of 47 places in 360 ms of which 6 ms to minimize.
[2024-05-26 15:29:20] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 4 ms to minimize.
[2024-05-26 15:29:20] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 11 ms to minimize.
[2024-05-26 15:29:21] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 5 ms to minimize.
[2024-05-26 15:29:21] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 6 ms to minimize.
[2024-05-26 15:29:21] [INFO ] Deduced a trap composed of 39 places in 385 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/1110 variables, and 74 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 15:29:23] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 4 ms to minimize.
[2024-05-26 15:29:24] [INFO ] Deduced a trap composed of 96 places in 250 ms of which 4 ms to minimize.
[2024-05-26 15:29:24] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 4 ms to minimize.
[2024-05-26 15:29:24] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 3 ms to minimize.
[2024-05-26 15:29:24] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 3 ms to minimize.
[2024-05-26 15:29:25] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 4 ms to minimize.
[2024-05-26 15:29:25] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 4 ms to minimize.
[2024-05-26 15:29:25] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 4 ms to minimize.
[2024-05-26 15:29:25] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 5 ms to minimize.
[2024-05-26 15:29:26] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 4 ms to minimize.
[2024-05-26 15:29:26] [INFO ] Deduced a trap composed of 94 places in 255 ms of which 4 ms to minimize.
[2024-05-26 15:29:26] [INFO ] Deduced a trap composed of 94 places in 246 ms of which 4 ms to minimize.
[2024-05-26 15:29:26] [INFO ] Deduced a trap composed of 99 places in 252 ms of which 6 ms to minimize.
[2024-05-26 15:29:27] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 5 ms to minimize.
[2024-05-26 15:29:27] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 3 ms to minimize.
[2024-05-26 15:29:28] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 3 ms to minimize.
[2024-05-26 15:29:28] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 3 ms to minimize.
[2024-05-26 15:29:28] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-05-26 15:29:29] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 4 ms to minimize.
[2024-05-26 15:29:29] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 15:29:30] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 4 ms to minimize.
[2024-05-26 15:29:30] [INFO ] Deduced a trap composed of 36 places in 232 ms of which 4 ms to minimize.
[2024-05-26 15:29:30] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 3 ms to minimize.
[2024-05-26 15:29:31] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-05-26 15:29:32] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 4 ms to minimize.
[2024-05-26 15:29:32] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-26 15:29:32] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
[2024-05-26 15:29:32] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-26 15:29:32] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-05-26 15:29:33] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 3 ms to minimize.
[2024-05-26 15:29:33] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-05-26 15:29:33] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-26 15:29:33] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-26 15:29:34] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-26 15:29:34] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-26 15:29:34] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-26 15:29:35] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-26 15:29:35] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-26 15:29:35] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-26 15:29:35] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 15:29:37] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 4 ms to minimize.
[2024-05-26 15:29:37] [INFO ] Deduced a trap composed of 91 places in 212 ms of which 3 ms to minimize.
[2024-05-26 15:29:37] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 4 ms to minimize.
[2024-05-26 15:29:38] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 4 ms to minimize.
[2024-05-26 15:29:39] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 3 ms to minimize.
[2024-05-26 15:29:40] [INFO ] Deduced a trap composed of 80 places in 210 ms of which 3 ms to minimize.
[2024-05-26 15:29:40] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 4 ms to minimize.
[2024-05-26 15:29:40] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 4 ms to minimize.
[2024-05-26 15:29:41] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-26 15:29:41] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 3 ms to minimize.
[2024-05-26 15:29:41] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-26 15:29:42] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-26 15:29:42] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-26 15:29:42] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-26 15:29:42] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 3 ms to minimize.
[2024-05-26 15:29:43] [INFO ] Deduced a trap composed of 81 places in 211 ms of which 4 ms to minimize.
[2024-05-26 15:29:43] [INFO ] Deduced a trap composed of 80 places in 245 ms of which 4 ms to minimize.
[2024-05-26 15:29:44] [INFO ] Deduced a trap composed of 128 places in 214 ms of which 4 ms to minimize.
[2024-05-26 15:29:45] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 3 ms to minimize.
[2024-05-26 15:29:46] [INFO ] Deduced a trap composed of 103 places in 270 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-26 15:29:48] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 4 ms to minimize.
[2024-05-26 15:29:49] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 4 ms to minimize.
[2024-05-26 15:29:50] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 4 ms to minimize.
[2024-05-26 15:29:50] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/1110 variables, and 138 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/685 constraints, Known Traps: 124/124 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60547ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 60770 ms. Remains : 480/480 places, 690/690 transitions.
Final net has 480 places and 690 transitions.
[2024-05-26 15:29:52] [INFO ] Flatten gal took : 153 ms
[2024-05-26 15:29:52] [INFO ] Applying decomposition
[2024-05-26 15:29:52] [INFO ] Flatten gal took : 75 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/graph5184619518695396683.txt' '-o' '/tmp/graph5184619518695396683.bin' '-w' '/tmp/graph5184619518695396683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5184619518695396683.bin' '-l' '-1' '-v' '-w' '/tmp/graph5184619518695396683.weights' '-q' '0' '-e' '0.001'
[2024-05-26 15:29:52] [INFO ] Decomposing Gal with order
[2024-05-26 15:29:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 15:29:52] [INFO ] Removed a total of 487 redundant transitions.
[2024-05-26 15:29:53] [INFO ] Flatten gal took : 137 ms
[2024-05-26 15:29:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 18 ms.
[2024-05-26 15:29:53] [INFO ] Time to serialize gal into /tmp/StateSpace11391785987870616337.gal : 22 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/StateSpace11391785987870616337.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,6.29947e+08,282.404,3279868,64467,815,4.13797e+06,12707,1177,2.10615e+07,157,109626,0
Total reachable state count : 629946518

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 14
STATE_SPACE MAX_TOKEN_PER_MARKING 14 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 629946518
STATE_SPACE STATES 629946518 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 346602 ms.

BK_STOP 1716737676522

--------------------
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="Peterson-COL-4"
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 Peterson-COL-4, 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 r268-smll-171654407200224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;