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.r012-smll-171620124100214.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 Anderson-PT-07, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124100214
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 461K May 18 16:42 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 1716262299238

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 03:31:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-21 03:31:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:31:41] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2024-05-21 03:31:41] [INFO ] Transformed 309 places.
[2024-05-21 03:31:41] [INFO ] Transformed 917 transitions.
[2024-05-21 03:31:41] [INFO ] Found NUPN structural information;
[2024-05-21 03:31:41] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 355 ms.
Built sparse matrix representations for Structural reductions in 11 ms.25918KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 309/309 places, 917/917 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 91 ms. Remains 309 /309 variables (removed 0) and now considering 917/917 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 114 ms. Remains : 309/309 places, 917/917 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 309/309 places, 917/917 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 37 ms. Remains 309 /309 variables (removed 0) and now considering 917/917 (removed 0) transitions.
// Phase 1: matrix 917 rows 309 cols
[2024-05-21 03:31:41] [INFO ] Computed 17 invariants in 48 ms
[2024-05-21 03:31:42] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-21 03:31:42] [INFO ] Invariant cache hit.
[2024-05-21 03:31:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 03:31:42] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2024-05-21 03:31:42] [INFO ] Redundant transitions in 60 ms returned []
Running 910 sub problems to find dead transitions.
[2024-05-21 03:31:42] [INFO ] Invariant cache hit.
[2024-05-21 03:31:42] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 309/309 constraints. Problems are: Problem set: 0 solved, 910 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 910 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 9/326 constraints. Problems are: Problem set: 0 solved, 910 unsolved
[2024-05-21 03:31:54] [INFO ] Deduced a trap composed of 85 places in 482 ms of which 59 ms to minimize.
[2024-05-21 03:31:54] [INFO ] Deduced a trap composed of 106 places in 397 ms of which 5 ms to minimize.
[2024-05-21 03:31:56] [INFO ] Deduced a trap composed of 64 places in 443 ms of which 4 ms to minimize.
[2024-05-21 03:31:56] [INFO ] Deduced a trap composed of 185 places in 348 ms of which 4 ms to minimize.
[2024-05-21 03:31:57] [INFO ] Deduced a trap composed of 90 places in 382 ms of which 4 ms to minimize.
[2024-05-21 03:31:57] [INFO ] Deduced a trap composed of 136 places in 354 ms of which 4 ms to minimize.
[2024-05-21 03:31:57] [INFO ] Deduced a trap composed of 146 places in 292 ms of which 4 ms to minimize.
[2024-05-21 03:31:58] [INFO ] Deduced a trap composed of 129 places in 311 ms of which 3 ms to minimize.
[2024-05-21 03:31:58] [INFO ] Deduced a trap composed of 154 places in 342 ms of which 4 ms to minimize.
[2024-05-21 03:31:59] [INFO ] Deduced a trap composed of 80 places in 264 ms of which 4 ms to minimize.
[2024-05-21 03:31:59] [INFO ] Deduced a trap composed of 85 places in 281 ms of which 4 ms to minimize.
[2024-05-21 03:31:59] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 3 ms to minimize.
[2024-05-21 03:31:59] [INFO ] Deduced a trap composed of 101 places in 267 ms of which 3 ms to minimize.
[2024-05-21 03:32:00] [INFO ] Deduced a trap composed of 84 places in 360 ms of which 5 ms to minimize.
[2024-05-21 03:32:00] [INFO ] Deduced a trap composed of 89 places in 370 ms of which 5 ms to minimize.
[2024-05-21 03:32:00] [INFO ] Deduced a trap composed of 151 places in 285 ms of which 3 ms to minimize.
[2024-05-21 03:32:01] [INFO ] Deduced a trap composed of 149 places in 264 ms of which 3 ms to minimize.
[2024-05-21 03:32:01] [INFO ] Deduced a trap composed of 95 places in 265 ms of which 3 ms to minimize.
[2024-05-21 03:32:01] [INFO ] Deduced a trap composed of 77 places in 267 ms of which 3 ms to minimize.
[2024-05-21 03:32:02] [INFO ] Deduced a trap composed of 153 places in 348 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 910 unsolved
[2024-05-21 03:32:13] [INFO ] Deduced a trap composed of 173 places in 369 ms of which 5 ms to minimize.
[2024-05-21 03:32:13] [INFO ] Deduced a trap composed of 66 places in 288 ms of which 3 ms to minimize.
[2024-05-21 03:32:13] [INFO ] Deduced a trap composed of 173 places in 354 ms of which 4 ms to minimize.
[2024-05-21 03:32:14] [INFO ] Deduced a trap composed of 129 places in 261 ms of which 3 ms to minimize.
[2024-05-21 03:32:14] [INFO ] Deduced a trap composed of 152 places in 350 ms of which 5 ms to minimize.
[2024-05-21 03:32:14] [INFO ] Deduced a trap composed of 94 places in 247 ms of which 3 ms to minimize.
[2024-05-21 03:32:15] [INFO ] Deduced a trap composed of 195 places in 366 ms of which 5 ms to minimize.
[2024-05-21 03:32:15] [INFO ] Deduced a trap composed of 156 places in 365 ms of which 5 ms to minimize.
SMT process timed out in 32499ms, After SMT, problems are : Problem set: 0 solved, 910 unsolved
Search for dead transitions found 0 dead transitions in 32548ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 33747 ms. Remains : 309/309 places, 917/917 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2798 ms (no deadlock found). (steps per millisecond=446 )
Random directed walk for 1250000 steps, including 0 resets, run took 2415 ms (no deadlock found). (steps per millisecond=517 )
[2024-05-21 03:32:20] [INFO ] Invariant cache hit.
[2024-05-21 03:32:21] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2024-05-21 03:32:21] [INFO ] [Real]Absence check using 8 positive and 9 generalized place invariants in 717 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 309/309 places, 917/917 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 309 transition count 875
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 267 transition count 875
Applied a total of 84 rules in 38 ms. Remains 267 /309 variables (removed 42) and now considering 875/917 (removed 42) transitions.
// Phase 1: matrix 875 rows 267 cols
[2024-05-21 03:32:21] [INFO ] Computed 17 invariants in 14 ms
[2024-05-21 03:32:22] [INFO ] Implicit Places using invariants in 654 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 658 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 266/309 places, 875/917 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 266 transition count 826
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 217 transition count 826
Applied a total of 98 rules in 11 ms. Remains 217 /266 variables (removed 49) and now considering 826/875 (removed 49) transitions.
// Phase 1: matrix 826 rows 217 cols
[2024-05-21 03:32:22] [INFO ] Computed 16 invariants in 5 ms
[2024-05-21 03:32:23] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-21 03:32:23] [INFO ] Invariant cache hit.
[2024-05-21 03:32:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 03:32:24] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2134 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 217/309 places, 826/917 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2842 ms. Remains : 217/309 places, 826/917 transitions.
Initial state reduction rules removed 7 formulas.
RANDOM walk for 40000 steps (8 resets) in 3144 ms. (12 steps per ms) remains 227/819 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 227/227 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 227/227 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 227/227 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 227/227 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 227/227 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 227/227 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 227/227 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 227/227 properties
[2024-05-21 03:32:25] [INFO ] Invariant cache hit.
[2024-05-21 03:32:25] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 130/217 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 130/226 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 03:32:29] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 3 ms to minimize.
[2024-05-21 03:32:30] [INFO ] Deduced a trap composed of 85 places in 199 ms of which 3 ms to minimize.
[2024-05-21 03:32:30] [INFO ] Deduced a trap composed of 114 places in 230 ms of which 2 ms to minimize.
[2024-05-21 03:32:30] [INFO ] Deduced a trap composed of 107 places in 199 ms of which 3 ms to minimize.
[2024-05-21 03:32:30] [INFO ] Deduced a trap composed of 86 places in 225 ms of which 2 ms to minimize.
[2024-05-21 03:32:31] [INFO ] Deduced a trap composed of 109 places in 206 ms of which 3 ms to minimize.
[2024-05-21 03:32:31] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 2 ms to minimize.
SMT process timed out in 5570ms, After SMT, problems are : Problem set: 0 solved, 227 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 826/826 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 189 transition count 798
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 189 transition count 798
Applied a total of 56 rules in 39 ms. Remains 189 /217 variables (removed 28) and now considering 798/826 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 189/217 places, 798/826 transitions.
RANDOM walk for 4000000 steps (8 resets) in 41591 ms. (96 steps per ms) remains 31/227 properties
BEST_FIRST walk for 400002 steps (8 resets) in 998 ms. (400 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1278 ms. (312 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400003 steps (8 resets) in 655 ms. (609 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 647 ms. (617 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 684 ms. (583 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 659 ms. (606 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 657 ms. (607 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 809 ms. (493 steps per ms) remains 22/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 743 ms. (537 steps per ms) remains 21/22 properties
BEST_FIRST walk for 400002 steps (8 resets) in 706 ms. (565 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 671 ms. (595 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 675 ms. (591 steps per ms) remains 17/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 625 ms. (638 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 615 ms. (649 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400002 steps (8 resets) in 582 ms. (686 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 545 ms. (732 steps per ms) remains 12/13 properties
BEST_FIRST walk for 400002 steps (8 resets) in 528 ms. (756 steps per ms) remains 11/12 properties
BEST_FIRST walk for 400002 steps (8 resets) in 497 ms. (803 steps per ms) remains 9/11 properties
BEST_FIRST walk for 400003 steps (8 resets) in 462 ms. (863 steps per ms) remains 8/9 properties
BEST_FIRST walk for 400003 steps (8 resets) in 485 ms. (823 steps per ms) remains 7/8 properties
BEST_FIRST walk for 400003 steps (8 resets) in 439 ms. (909 steps per ms) remains 6/7 properties
BEST_FIRST walk for 400004 steps (8 resets) in 427 ms. (934 steps per ms) remains 5/6 properties
BEST_FIRST walk for 400004 steps (8 resets) in 385 ms. (1036 steps per ms) remains 3/5 properties
BEST_FIRST walk for 400004 steps (8 resets) in 362 ms. (1101 steps per ms) remains 2/3 properties
BEST_FIRST walk for 400003 steps (8 resets) in 345 ms. (1156 steps per ms) remains 1/2 properties
BEST_FIRST walk for 146175 steps (1 resets) in 151 ms. (961 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 826 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 309/309 places, 917/917 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 309 transition count 875
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 267 transition count 875
Applied a total of 84 rules in 32 ms. Remains 267 /309 variables (removed 42) and now considering 875/917 (removed 42) transitions.
// Phase 1: matrix 875 rows 267 cols
[2024-05-21 03:32:48] [INFO ] Computed 17 invariants in 6 ms
[2024-05-21 03:32:49] [INFO ] Implicit Places using invariants in 653 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 656 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 266/309 places, 875/917 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 266 transition count 826
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 217 transition count 826
Applied a total of 98 rules in 8 ms. Remains 217 /266 variables (removed 49) and now considering 826/875 (removed 49) transitions.
// Phase 1: matrix 826 rows 217 cols
[2024-05-21 03:32:49] [INFO ] Computed 16 invariants in 4 ms
[2024-05-21 03:32:49] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-21 03:32:49] [INFO ] Invariant cache hit.
[2024-05-21 03:32:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 03:32:51] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 217/309 places, 826/917 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2970 ms. Remains : 217/309 places, 826/917 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :826 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 826 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 70421 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-07

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 309
TRANSITIONS: 917
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 3500
NUPN UNITS: 10
LOADING TIME: 0.888

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.07
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.407
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: 692
MODEL NAME: /home/mcc/execution/model
309 places, 917 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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="Anderson-PT-07"
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 Anderson-PT-07, 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 r012-smll-171620124100214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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