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.r320-tall-171662352800474.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 RefineWMG-PT-100100, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-171662352800474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K 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 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 04:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 218K 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 1716768539238

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RefineWMG-PT-100100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 00:09:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 00:09:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:09:00] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-27 00:09:00] [INFO ] Transformed 504 places.
[2024-05-27 00:09:00] [INFO ] Transformed 403 transitions.
[2024-05-27 00:09:00] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 180 ms.
Discarding 100 transitions out of 403. Remains 303
Built sparse matrix representations for Structural reductions in 5 ms.18324KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 504/504 places, 403/403 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 39 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 504 cols
[2024-05-27 00:09:00] [INFO ] Computed 202 invariants in 17 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 40209ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40229ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 40307 ms. Remains : 504/504 places, 403/403 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 504/504 places, 403/403 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 11 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-27 00:09:40] [INFO ] Invariant cache hit.
[2024-05-27 00:09:41] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-27 00:09:41] [INFO ] Invariant cache hit.
[2024-05-27 00:09:41] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-27 00:09:41] [INFO ] Redundant transitions in 29 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-27 00:09:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20330 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 50388ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 50392ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 50846 ms. Remains : 504/504 places, 403/403 transitions.
Random walk for 1250079 steps, including 0 resets, run took 3921 ms (no deadlock found). (steps per millisecond=318 )
Random directed walk for 1250039 steps, including 0 resets, run took 5853 ms (no deadlock found). (steps per millisecond=213 )
[2024-05-27 00:10:41] [INFO ] Invariant cache hit.
[2024-05-27 00:10:41] [INFO ] [Real]Absence check using 202 positive place invariants in 1 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 300 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 3 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 304 transition count 204
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 500 place count 104 transition count 104
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 1 with 99 rules applied. Total rules applied 599 place count 104 transition count 5
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 2 with 99 rules applied. Total rules applied 698 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 700 place count 4 transition count 4
Applied a total of 700 rules in 33 ms. Remains 4 /504 variables (removed 500) and now considering 4/403 (removed 399) transitions.
Running 2 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-27 00:10:41] [INFO ] Computed 2 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 53ms
[2024-05-27 00:10:41] [INFO ] Invariant cache hit.
[2024-05-27 00:10:41] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-27 00:10:41] [INFO ] Invariant cache hit.
[2024-05-27 00:10:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-27 00:10:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 55ms
Starting structural reductions in LIVENESS mode, iteration 1 : 4/504 places, 4/403 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 217 ms. Remains : 4/504 places, 4/403 transitions.
Initial state reduction rules removed 1 formulas.
RANDOM walk for 20 steps (0 resets) in 8 ms. (2 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 4 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 300 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 0 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 304 transition count 204
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 500 place count 104 transition count 104
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 1 with 99 rules applied. Total rules applied 599 place count 104 transition count 5
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 2 with 99 rules applied. Total rules applied 698 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 700 place count 4 transition count 4
Applied a total of 700 rules in 20 ms. Remains 4 /504 variables (removed 500) and now considering 4/403 (removed 399) transitions.
Running 2 sub problems to find dead transitions.
[2024-05-27 00:10:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 57ms
[2024-05-27 00:10:41] [INFO ] Invariant cache hit.
[2024-05-27 00:10:41] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-27 00:10:41] [INFO ] Invariant cache hit.
[2024-05-27 00:10:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-27 00:10:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 55ms
Starting structural reductions in LIVENESS mode, iteration 1 : 4/504 places, 4/403 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 171 ms. Remains : 4/504 places, 4/403 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 :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 101762 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RefineWMG-PT-100100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 504
TRANSITIONS: 403
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.002s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
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: 580
MODEL NAME: /home/mcc/execution/model
504 places, 403 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.

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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="RefineWMG-PT-100100"
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 RefineWMG-PT-100100, 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 r320-tall-171662352800474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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