Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455700142.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 717K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717269539112

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:19:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:19:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:19:00] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-01 19:19:00] [INFO ] Transformed 614 places.
[2024-06-01 19:19:00] [INFO ] Transformed 1242 transitions.
[2024-06-01 19:19:00] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 230 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 614/614 places, 1242/1242 transitions.
Ensure Unique test removed 2 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 274 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 274 place count 540 transition count 978
Deduced a syphon composed of 64 places in 5 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 402 place count 476 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 4 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 530 place count 412 transition count 914
Applied a total of 530 rules in 119 ms. Remains 412 /614 variables (removed 202) and now considering 914/1242 (removed 328) transitions.
Running 912 sub problems to find dead transitions.
[2024-06-01 19:19:00] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
// Phase 1: matrix 898 rows 412 cols
[2024-06-01 19:19:00] [INFO ] Computed 48 invariants in 48 ms
[2024-06-01 19:19:00] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 14 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:19:09] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 4 ms to minimize.
[2024-06-01 19:19:10] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 3 ms to minimize.
[2024-06-01 19:19:10] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:19:10] [INFO ] Deduced a trap composed of 145 places in 234 ms of which 13 ms to minimize.
[2024-06-01 19:19:10] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 142 places in 396 ms of which 3 ms to minimize.
[2024-06-01 19:19:14] [INFO ] Deduced a trap composed of 234 places in 321 ms of which 2 ms to minimize.
[2024-06-01 19:19:14] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 3 ms to minimize.
[2024-06-01 19:19:18] [INFO ] Deduced a trap composed of 209 places in 251 ms of which 4 ms to minimize.
[2024-06-01 19:19:18] [INFO ] Deduced a trap composed of 181 places in 322 ms of which 3 ms to minimize.
[2024-06-01 19:19:18] [INFO ] Deduced a trap composed of 155 places in 254 ms of which 2 ms to minimize.
[2024-06-01 19:19:19] [INFO ] Deduced a trap composed of 175 places in 300 ms of which 5 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 178 places in 330 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1310 variables, and 66 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20079 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 912/912 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 912 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1310 variables, and 66 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/912 constraints, Known Traps: 20/20 constraints]
After SMT, in 41516ms problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 41556ms
[2024-06-01 19:19:42] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
[2024-06-01 19:19:42] [INFO ] Invariant cache hit.
[2024-06-01 19:19:42] [INFO ] Implicit Places using invariants in 431 ms returned [74, 123, 198, 206, 282, 327, 350, 357]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 441 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 404/614 places, 914/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 404 /404 variables (removed 0) and now considering 914/914 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 42183 ms. Remains : 404/614 places, 914/1242 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 40000 steps (18 resets) in 2910 ms. (13 steps per ms) remains 128/912 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 30 ms. (13 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 128/128 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 128/128 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 25 ms. (15 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 27 ms. (14 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 128/128 properties
BEST_FIRST walk for 402 steps (8 resets) in 32 ms. (12 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 128/128 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 128/128 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 128/128 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 128/128 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 128/128 properties
[2024-06-01 19:19:44] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
// Phase 1: matrix 898 rows 404 cols
[2024-06-01 19:19:44] [INFO ] Computed 40 invariants in 14 ms
[2024-06-01 19:19:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 308/362 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Problem qltransition_33 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 2873ms, After SMT, problems are : Problem set: 0 solved, 128 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 914/914 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 398 transition count 908
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 398 transition count 908
Applied a total of 12 rules in 86 ms. Remains 398 /404 variables (removed 6) and now considering 908/914 (removed 6) transitions.
Running 906 sub problems to find dead transitions.
[2024-06-01 19:19:47] [INFO ] Flow matrix only has 892 transitions (discarded 16 similar events)
// Phase 1: matrix 892 rows 398 cols
[2024-06-01 19:19:47] [INFO ] Computed 40 invariants in 28 ms
[2024-06-01 19:19:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:19:53] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 3 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:19:54] [INFO ] Deduced a trap composed of 87 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 3 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 234 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 2 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 149 places in 212 ms of which 3 ms to minimize.
[2024-06-01 19:19:56] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 3 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 171 places in 214 ms of which 3 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 189 places in 222 ms of which 3 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 169 places in 217 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-06-01 19:20:05] [INFO ] Deduced a trap composed of 154 places in 243 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1290 variables, and 57 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 906/906 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 906 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 906 unsolved
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:20:23] [INFO ] Deduced a trap composed of 167 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 906 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1290 variables, and 59 constraints, problems are : Problem set: 0 solved, 906 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/398 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/906 constraints, Known Traps: 22/22 constraints]
After SMT, in 41413ms problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 41425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41516 ms. Remains : 398/404 places, 908/914 transitions.
Total runtime 88108 ms.
ITS solved all properties within timeout

BK_STOP 1717269628574

--------------------
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 QuasiLiveness -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="PolyORBLF-PT-S02J04T08"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S02J04T08, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654455700142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;