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.r276-smll-171654416000139.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 greatspnxred
Input is Peterson-COL-4, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654416000139
=====================================================================

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716816430448

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 13:27:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 13:27:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 13:27:13] [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-27 13:27:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 13:27:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1318 ms
[2024-05-27 13:27:14] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 40 ms.
[2024-05-27 13:27:14] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 11 ms.
[2024-05-27 13:27:14] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-27 13:27:14] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 60 ms.
[2024-05-27 13:27:14] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-27 13:27:14] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 21 ms.
[2024-05-27 13:27:14] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2024-05-27 13:27:14] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 0 ms.
[2024-05-27 13:27:14] [INFO ] Skeletonized 14 HLPN properties in 2 ms.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-27 13:27:14] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 34 ms.
[2024-05-27 13:27:14] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 40 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.32420KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 480/480 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 59 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 78 ms. Remains : 480/480 places, 690/690 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 480/480 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 27 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-05-27 13:27:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-27 13:27:14] [INFO ] Computed 19 invariants in 46 ms
[2024-05-27 13:27:15] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-27 13:27:15] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-27 13:27:15] [INFO ] Invariant cache hit.
[2024-05-27 13:27:15] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 13:27:16] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
[2024-05-27 13:27:16] [INFO ] Redundant transitions in 62 ms returned []
Running 685 sub problems to find dead transitions.
[2024-05-27 13:27:16] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-27 13:27:16] [INFO ] Invariant cache hit.
[2024-05-27 13:27:16] [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-27 13:27:26] [INFO ] Deduced a trap composed of 27 places in 589 ms of which 76 ms to minimize.
[2024-05-27 13:27:27] [INFO ] Deduced a trap composed of 36 places in 505 ms of which 9 ms to minimize.
[2024-05-27 13:27:27] [INFO ] Deduced a trap composed of 91 places in 346 ms of which 7 ms to minimize.
[2024-05-27 13:27:28] [INFO ] Deduced a trap composed of 17 places in 437 ms of which 7 ms to minimize.
[2024-05-27 13:27:28] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 6 ms to minimize.
[2024-05-27 13:27:28] [INFO ] Deduced a trap composed of 121 places in 346 ms of which 6 ms to minimize.
[2024-05-27 13:27:29] [INFO ] Deduced a trap composed of 21 places in 361 ms of which 7 ms to minimize.
[2024-05-27 13:27:29] [INFO ] Deduced a trap composed of 13 places in 336 ms of which 7 ms to minimize.
[2024-05-27 13:27:29] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 6 ms to minimize.
[2024-05-27 13:27:30] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 3 ms to minimize.
[2024-05-27 13:27:30] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 4 ms to minimize.
[2024-05-27 13:27:30] [INFO ] Deduced a trap composed of 70 places in 288 ms of which 6 ms to minimize.
[2024-05-27 13:27:31] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 7 ms to minimize.
[2024-05-27 13:27:31] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 4 ms to minimize.
[2024-05-27 13:27:31] [INFO ] Deduced a trap composed of 58 places in 268 ms of which 5 ms to minimize.
[2024-05-27 13:27:31] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 4 ms to minimize.
[2024-05-27 13:27:32] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 4 ms to minimize.
[2024-05-27 13:27:32] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 4 ms to minimize.
[2024-05-27 13:27:32] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 3 ms to minimize.
[2024-05-27 13:27:33] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 5 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-27 13:27:33] [INFO ] Deduced a trap composed of 25 places in 392 ms of which 6 ms to minimize.
[2024-05-27 13:27:34] [INFO ] Deduced a trap composed of 62 places in 297 ms of which 5 ms to minimize.
[2024-05-27 13:27:34] [INFO ] Deduced a trap composed of 87 places in 371 ms of which 6 ms to minimize.
[2024-05-27 13:27:34] [INFO ] Deduced a trap composed of 88 places in 334 ms of which 6 ms to minimize.
[2024-05-27 13:27:35] [INFO ] Deduced a trap composed of 66 places in 323 ms of which 6 ms to minimize.
[2024-05-27 13:27:35] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 6 ms to minimize.
[2024-05-27 13:27:35] [INFO ] Deduced a trap composed of 39 places in 344 ms of which 7 ms to minimize.
[2024-05-27 13:27:36] [INFO ] Deduced a trap composed of 47 places in 343 ms of which 6 ms to minimize.
[2024-05-27 13:27:36] [INFO ] Deduced a trap composed of 90 places in 333 ms of which 5 ms to minimize.
[2024-05-27 13:27:36] [INFO ] Deduced a trap composed of 40 places in 334 ms of which 6 ms to minimize.
[2024-05-27 13:27:37] [INFO ] Deduced a trap composed of 47 places in 336 ms of which 6 ms to minimize.
[2024-05-27 13:27:37] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 7 ms to minimize.
[2024-05-27 13:27:37] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-05-27 13:27:38] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 6 ms to minimize.
[2024-05-27 13:27:38] [INFO ] Deduced a trap composed of 58 places in 337 ms of which 8 ms to minimize.
[2024-05-27 13:27:38] [INFO ] Deduced a trap composed of 43 places in 380 ms of which 7 ms to minimize.
[2024-05-27 13:27:39] [INFO ] Deduced a trap composed of 159 places in 305 ms of which 6 ms to minimize.
[2024-05-27 13:27:39] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 4 ms to minimize.
[2024-05-27 13:27:39] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 3 ms to minimize.
[2024-05-27 13:27:40] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/54 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 54 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30070 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: 40/40 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, 40/54 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-27 13:27:49] [INFO ] Deduced a trap composed of 80 places in 461 ms of which 6 ms to minimize.
[2024-05-27 13:27:49] [INFO ] Deduced a trap composed of 47 places in 339 ms of which 6 ms to minimize.
[2024-05-27 13:27:49] [INFO ] Deduced a trap composed of 43 places in 280 ms of which 6 ms to minimize.
[2024-05-27 13:27:49] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 3 ms to minimize.
[2024-05-27 13:27:50] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 3 ms to minimize.
[2024-05-27 13:27:50] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 4 ms to minimize.
[2024-05-27 13:27:50] [INFO ] Deduced a trap composed of 164 places in 335 ms of which 6 ms to minimize.
[2024-05-27 13:27:50] [INFO ] Deduced a trap composed of 158 places in 324 ms of which 6 ms to minimize.
[2024-05-27 13:27:51] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 4 ms to minimize.
[2024-05-27 13:27:51] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 5 ms to minimize.
[2024-05-27 13:27:51] [INFO ] Deduced a trap composed of 105 places in 303 ms of which 6 ms to minimize.
[2024-05-27 13:27:52] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 3 ms to minimize.
[2024-05-27 13:27:52] [INFO ] Deduced a trap composed of 18 places in 352 ms of which 6 ms to minimize.
[2024-05-27 13:27:52] [INFO ] Deduced a trap composed of 14 places in 388 ms of which 6 ms to minimize.
[2024-05-27 13:27:53] [INFO ] Deduced a trap composed of 36 places in 309 ms of which 5 ms to minimize.
[2024-05-27 13:27:53] [INFO ] Deduced a trap composed of 43 places in 416 ms of which 7 ms to minimize.
[2024-05-27 13:27:54] [INFO ] Deduced a trap composed of 67 places in 399 ms of which 7 ms to minimize.
[2024-05-27 13:27:54] [INFO ] Deduced a trap composed of 65 places in 327 ms of which 5 ms to minimize.
[2024-05-27 13:27:54] [INFO ] Deduced a trap composed of 37 places in 382 ms of which 7 ms to minimize.
[2024-05-27 13:27:55] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-27 13:27:56] [INFO ] Deduced a trap composed of 22 places in 363 ms of which 5 ms to minimize.
[2024-05-27 13:27:56] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 5 ms to minimize.
[2024-05-27 13:27:57] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 3 ms to minimize.
[2024-05-27 13:27:57] [INFO ] Deduced a trap composed of 47 places in 327 ms of which 7 ms to minimize.
[2024-05-27 13:27:57] [INFO ] Deduced a trap composed of 32 places in 332 ms of which 6 ms to minimize.
[2024-05-27 13:27:58] [INFO ] Deduced a trap composed of 30 places in 368 ms of which 6 ms to minimize.
[2024-05-27 13:27:58] [INFO ] Deduced a trap composed of 10 places in 367 ms of which 6 ms to minimize.
[2024-05-27 13:27:59] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 5 ms to minimize.
[2024-05-27 13:28:00] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 4 ms to minimize.
[2024-05-27 13:28:00] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 5 ms to minimize.
[2024-05-27 13:28:01] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 4 ms to minimize.
[2024-05-27 13:28:01] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 3 ms to minimize.
[2024-05-27 13:28:01] [INFO ] Deduced a trap composed of 57 places in 395 ms of which 6 ms to minimize.
[2024-05-27 13:28:02] [INFO ] Deduced a trap composed of 54 places in 380 ms of which 6 ms to minimize.
[2024-05-27 13:28:02] [INFO ] Deduced a trap composed of 54 places in 342 ms of which 6 ms to minimize.
[2024-05-27 13:28:02] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 5 ms to minimize.
[2024-05-27 13:28:03] [INFO ] Deduced a trap composed of 93 places in 317 ms of which 5 ms to minimize.
[2024-05-27 13:28:03] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 4 ms to minimize.
[2024-05-27 13:28:04] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 5 ms to minimize.
[2024-05-27 13:28:04] [INFO ] Deduced a trap composed of 42 places in 353 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-05-27 13:28:06] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 4 ms to minimize.
[2024-05-27 13:28:06] [INFO ] Deduced a trap composed of 82 places in 298 ms of which 5 ms to minimize.
[2024-05-27 13:28:09] [INFO ] Deduced a trap composed of 96 places in 381 ms of which 6 ms to minimize.
[2024-05-27 13:28:09] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 4 ms to minimize.
[2024-05-27 13:28:10] [INFO ] Deduced a trap composed of 36 places in 347 ms of which 6 ms to minimize.
[2024-05-27 13:28:10] [INFO ] Deduced a trap composed of 101 places in 248 ms of which 4 ms to minimize.
[2024-05-27 13:28:10] [INFO ] Deduced a trap composed of 80 places in 301 ms of which 6 ms to minimize.
[2024-05-27 13:28:11] [INFO ] Deduced a trap composed of 58 places in 316 ms of which 6 ms to minimize.
[2024-05-27 13:28:12] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
[2024-05-27 13:28:12] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
[2024-05-27 13:28:13] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-27 13:28:13] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-05-27 13:28:13] [INFO ] Deduced a trap composed of 57 places in 230 ms of which 4 ms to minimize.
[2024-05-27 13:28:13] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-27 13:28:14] [INFO ] Deduced a trap composed of 80 places in 223 ms of which 5 ms to minimize.
[2024-05-27 13:28:14] [INFO ] Deduced a trap composed of 81 places in 223 ms of which 4 ms to minimize.
[2024-05-27 13:28:14] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-27 13:28:14] [INFO ] Deduced a trap composed of 84 places in 233 ms of which 4 ms to minimize.
[2024-05-27 13:28:15] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 4 ms to minimize.
[2024-05-27 13:28:15] [INFO ] Deduced a trap composed of 70 places in 314 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/1110 variables, and 114 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30020 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: 100/100 constraints]
After SMT, in 60618ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60671ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61979 ms. Remains : 480/480 places, 690/690 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2290 ms (no deadlock found). (steps per millisecond=545 )
Random directed walk for 1250002 steps, including 0 resets, run took 2674 ms (no deadlock found). (steps per millisecond=467 )
[2024-05-27 13:28:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-27 13:28:21] [INFO ] Invariant cache hit.
[2024-05-27 13:28:22] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2024-05-27 13:28:22] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 16 ms returned unsat
[2024-05-27 13:28:22] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 25 ms.
[2024-05-27 13:28:22] [INFO ] Unfolded 14 HLPN properties in 6 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 40 transitions.
RANDOM walk for 40000 steps (8 resets) in 1134 ms. (35 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 1/1 properties
[2024-05-27 13:28:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-27 13:28:22] [INFO ] Invariant cache hit.
[2024-05-27 13:28:22] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 435/455 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/460 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 630/1090 variables, 460/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 116/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/1110 variables, 20/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 435/455 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/460 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 630/1090 variables, 460/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 116/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1090 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/1110 variables, 20/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 13:28:24] [INFO ] Deduced a trap composed of 42 places in 316 ms of which 6 ms to minimize.
[2024-05-27 13:28:24] [INFO ] Deduced a trap composed of 60 places in 302 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 13:28:24] [INFO ] Deduced a trap composed of 50 places in 390 ms of which 6 ms to minimize.
[2024-05-27 13:28:25] [INFO ] Deduced a trap composed of 96 places in 340 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 13:28:25] [INFO ] Deduced a trap composed of 62 places in 208 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 13:28:26] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 13:28:26] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 13:28:26] [INFO ] Deduced a trap composed of 101 places in 229 ms of which 4 ms to minimize.
[2024-05-27 13:28:26] [INFO ] Deduced a trap composed of 36 places in 323 ms of which 6 ms to minimize.
[2024-05-27 13:28:27] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 5 ms to minimize.
[2024-05-27 13:28:27] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 5 ms to minimize.
[2024-05-27 13:28:27] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1110 variables, 5/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1110 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1110 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 628 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4835 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 5372ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 133 ms.
Support contains 20 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 288 transition count 394
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 184 transition count 394
Applied a total of 592 rules in 73 ms. Remains 184 /480 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 184/480 places, 394/690 transitions.
RANDOM walk for 4000000 steps (8 resets) in 12259 ms. (326 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4833 ms. (827 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46 steps, run visited all 1 properties in 7 ms. (steps per millisecond=6 )
Probabilistic random walk after 46 steps, saw 41 distinct states, run finished after 13 ms. (steps per millisecond=3 ) properties seen :1
Able to resolve query QuasiLiveness after proving 14 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 40 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 40 transitions.
Unable to solve all queries for examination Liveness. Remains :14 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 14 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 80030 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-COL-4

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 11
TRANSITIONS: 14
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 7
COLOR VARS: 3
ARCS: 42
LOADING TIME: 0.302

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 500
TRANSITIONS: 730
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 2280
UNFOLDING TIME: 0.476

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.111
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.248
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 904
MODEL NAME: /home/mcc/execution/model
500 places, 730 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-4"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 greatspnxred"
echo " Input is Peterson-COL-4, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-171654416000139"
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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;