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.r254-tall-171654364300444.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 PGCD-COL-D03N050, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-171654364300444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.1K Apr 11 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 11 15:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 15:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 11 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11K 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 1716637206139

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PGCD-COL-D03N050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 11:40:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-25 11:40:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:40:07] [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-25 11:40:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 11:40:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 560 ms
[2024-05-25 11:40:08] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 12 PT places and 12.0 transition bindings in 23 ms.
[2024-05-25 11:40:08] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 6 ms.
[2024-05-25 11:40:08] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-25 11:40:08] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 7 ms.
[2024-05-25 11:40:08] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-25 11:40:08] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 1 ms.
[2024-05-25 11:40:08] [INFO ] Unfolded 3 HLPN properties in 1 ms.
[2024-05-25 11:40:08] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 0 ms.
[2024-05-25 11:40:08] [INFO ] Skeletonized 3 HLPN properties in 2 ms.
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.
Arc [1:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2024-05-25 11:40:08] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 7 ms.
[2024-05-25 11:40:08] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 0 ms.25817KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 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 9 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-25 11:40:08] [INFO ] Computed 5 invariants in 10 ms
[2024-05-25 11:40:08] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 4 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 4 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 351ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 392 ms. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 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 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-25 11:40:08] [INFO ] Invariant cache hit.
[2024-05-25 11:40:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 11:40:08] [INFO ] Invariant cache hit.
[2024-05-25 11:40:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 11:40:08] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-25 11:40:08] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-25 11:40:08] [INFO ] Invariant cache hit.
[2024-05-25 11:40:08] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 4 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 4 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 246 ms. Remains : 12/12 places, 12/12 transitions.
Random walk for 1250023 steps, including 0 resets, run took 363 ms (no deadlock found). (steps per millisecond=3443 )
Random directed walk for 1250013 steps, including 0 resets, run took 197 ms (no deadlock found). (steps per millisecond=6345 )
[2024-05-25 11:40:09] [INFO ] Invariant cache hit.
[2024-05-25 11:40:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 11:40:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 13 ms returned sat
[2024-05-25 11:40:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 11:40:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:40:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 11:40:09] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 11:40:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 11:40:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 11:40:09] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:40:09] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 11:40:09] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Parikh directed walk for 8500 steps, including 171 resets, run took 13 ms. (steps per millisecond=653 )
Random directed walk for 500021 steps, including 0 resets, run took 73 ms (no deadlock found). (steps per millisecond=6849 )
Random walk for 500009 steps, including 0 resets, run took 88 ms (no deadlock found). (steps per millisecond=5681 )
Random directed walk for 500042 steps, including 0 resets, run took 75 ms (no deadlock found). (steps per millisecond=6667 )
Random walk for 500045 steps, including 0 resets, run took 69 ms (no deadlock found). (steps per millisecond=7247 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 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 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-25 11:40:09] [INFO ] Invariant cache hit.
[2024-05-25 11:40:09] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 11:40:09] [INFO ] Invariant cache hit.
[2024-05-25 11:40:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 11:40:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-25 11:40:09] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-25 11:40:09] [INFO ] Invariant cache hit.
[2024-05-25 11:40:09] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 4 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 4 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 188 ms. Remains : 12/12 places, 12/12 transitions.
Random walk for 1250005 steps, including 0 resets, run took 212 ms (no deadlock found). (steps per millisecond=5896 )
Random directed walk for 1250023 steps, including 0 resets, run took 192 ms (no deadlock found). (steps per millisecond=6510 )
[2024-05-25 11:40:10] [INFO ] Invariant cache hit.
[2024-05-25 11:40:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 11:40:10] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 11:40:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-25 11:40:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:40:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 11:40:10] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 11:40:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 11:40:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 11:40:10] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:40:10] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 11:40:10] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Parikh directed walk for 8500 steps, including 187 resets, run took 10 ms. (steps per millisecond=850 )
Random directed walk for 500009 steps, including 0 resets, run took 77 ms (no deadlock found). (steps per millisecond=6493 )
Random walk for 500000 steps, including 0 resets, run took 75 ms (no deadlock found). (steps per millisecond=6666 )
Random directed walk for 500036 steps, including 0 resets, run took 70 ms (no deadlock found). (steps per millisecond=7143 )
Random walk for 500010 steps, including 0 resets, run took 80 ms (no deadlock found). (steps per millisecond=6250 )
[2024-05-25 11:40:10] [INFO ] Flatten gal took : 17 ms
[2024-05-25 11:40:10] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 1 ms.
[2024-05-25 11:40:10] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 63 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 3 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :3 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 3 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 3529 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PGCD-COL-D03N050

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 3
TRANSITIONS: 3
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 1
COLOR VARS: 1
ARCS: 14
LOADING TIME: 0.108

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 12
TRANSITIONS: 12
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 56
UNFOLDING TIME: 0.024

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.007
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.31
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: 559
MODEL NAME: /home/mcc/execution/model
12 places, 12 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...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716637228910

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

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D03N050.tgz
mv PGCD-COL-D03N050 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 ;