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.r298-tajo-171654455000152.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 greatspnxred
Input is PolyORBLF-PT-S02J06T06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455000152
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K 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 601K 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 1717103757589

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:15:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:15:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:15:59] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2024-05-30 21:15:59] [INFO ] Transformed 536 places.
[2024-05-30 21:15:59] [INFO ] Transformed 1064 transitions.
[2024-05-30 21:15:59] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 366 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 536/536 places, 1064/1064 transitions.
Ensure Unique test removed 2 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 534 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 206 place count 480 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 206 place count 480 transition count 854
Deduced a syphon composed of 60 places in 4 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 326 place count 420 transition count 854
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 422 place count 372 transition count 806
Applied a total of 422 rules in 206 ms. Remains 372 /536 variables (removed 164) and now considering 806/1064 (removed 258) transitions.
Running 804 sub problems to find dead transitions.
[2024-05-30 21:15:59] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 372 cols
[2024-05-30 21:15:59] [INFO ] Computed 48 invariants in 44 ms
[2024-05-30 21:16:00] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-30 21:16:06] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 19 ms to minimize.
[2024-05-30 21:16:06] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2024-05-30 21:16:06] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-30 21:16:07] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-30 21:16:07] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-30 21:16:07] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-30 21:16:07] [INFO ] Deduced a trap composed of 120 places in 224 ms of which 3 ms to minimize.
[2024-05-30 21:16:07] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-30 21:16:08] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 17 ms to minimize.
[2024-05-30 21:16:09] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 2 ms to minimize.
[2024-05-30 21:16:13] [INFO ] Deduced a trap composed of 198 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-30 21:16:19] [INFO ] Deduced a trap composed of 126 places in 197 ms of which 2 ms to minimize.
[2024-05-30 21:16:20] [INFO ] Deduced a trap composed of 104 places in 206 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1166 variables, and 53 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20116 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-30 21:16:25] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 3 ms to minimize.
[2024-05-30 21:16:25] [INFO ] Deduced a trap composed of 2 places in 166 ms of which 2 ms to minimize.
[2024-05-30 21:16:25] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 3 ms to minimize.
[2024-05-30 21:16:26] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 3 ms to minimize.
[2024-05-30 21:16:26] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-30 21:16:26] [INFO ] Deduced a trap composed of 224 places in 208 ms of which 3 ms to minimize.
[2024-05-30 21:16:27] [INFO ] Deduced a trap composed of 195 places in 206 ms of which 3 ms to minimize.
[2024-05-30 21:16:29] [INFO ] Deduced a trap composed of 182 places in 178 ms of which 2 ms to minimize.
[2024-05-30 21:16:29] [INFO ] Deduced a trap composed of 186 places in 154 ms of which 3 ms to minimize.
[2024-05-30 21:16:32] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 2 ms to minimize.
[2024-05-30 21:16:33] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-30 21:16:36] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 2 ms to minimize.
[2024-05-30 21:16:37] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 2 ms to minimize.
[2024-05-30 21:16:40] [INFO ] Deduced a trap composed of 192 places in 155 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1166 variables, and 67 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 27/27 constraints]
After SMT, in 41912ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 41992ms
[2024-05-30 21:16:41] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-30 21:16:41] [INFO ] Invariant cache hit.
[2024-05-30 21:16:42] [INFO ] Implicit Places using invariants in 585 ms returned [74, 82, 167, 177, 213, 348]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 599 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 366/536 places, 806/1064 transitions.
Applied a total of 0 rules in 6 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 42889 ms. Remains : 366/536 places, 806/1064 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 40000 steps (28 resets) in 2974 ms. (13 steps per ms) remains 98/804 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 98/98 properties
BEST_FIRST walk for 4004 steps (9 resets) in 50 ms. (78 steps per ms) remains 97/98 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 97/97 properties
BEST_FIRST walk for 4001 steps (9 resets) in 26 ms. (148 steps per ms) remains 96/97 properties
BEST_FIRST walk for 4002 steps (9 resets) in 33 ms. (117 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (9 resets) in 44 ms. (88 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (10 resets) in 42 ms. (93 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (9 resets) in 62 ms. (63 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 89 ms. (44 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (9 resets) in 50 ms. (78 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (9 resets) in 31 ms. (125 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (10 resets) in 35 ms. (111 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 96/96 properties
[2024-05-30 21:16:44] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2024-05-30 21:16:44] [INFO ] Computed 42 invariants in 34 ms
[2024-05-30 21:16:44] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Problem qltransition_1 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
SMT process timed out in 1582ms, After SMT, problems are : Problem set: 0 solved, 96 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 806/806 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 363 transition count 803
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 363 transition count 803
Applied a total of 6 rules in 128 ms. Remains 363 /366 variables (removed 3) and now considering 803/806 (removed 3) transitions.
Running 801 sub problems to find dead transitions.
[2024-05-30 21:16:46] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
// Phase 1: matrix 791 rows 363 cols
[2024-05-30 21:16:46] [INFO ] Computed 42 invariants in 27 ms
[2024-05-30 21:16:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-30 21:16:51] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 2 ms to minimize.
[2024-05-30 21:16:51] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 1 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 132 places in 268 ms of which 3 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 128 places in 167 ms of which 3 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 4 ms to minimize.
[2024-05-30 21:16:52] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-30 21:16:53] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-30 21:16:53] [INFO ] Deduced a trap composed of 120 places in 155 ms of which 2 ms to minimize.
[2024-05-30 21:16:54] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 3 ms to minimize.
[2024-05-30 21:16:57] [INFO ] Deduced a trap composed of 141 places in 193 ms of which 3 ms to minimize.
[2024-05-30 21:16:57] [INFO ] Deduced a trap composed of 131 places in 207 ms of which 3 ms to minimize.
[2024-05-30 21:16:58] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-30 21:17:04] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1154 variables, and 56 constraints, problems are : Problem set: 0 solved, 801 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-30 21:17:26] [INFO ] Deduced a trap composed of 170 places in 245 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1154 variables, and 57 constraints, problems are : Problem set: 0 solved, 801 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/801 constraints, Known Traps: 17/17 constraints]
After SMT, in 41248ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 41268ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41399 ms. Remains : 363/366 places, 803/806 transitions.
Total runtime 88544 ms.
ITS solved all properties within timeout

BK_STOP 1717103847768

--------------------
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'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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-S02J06T06"
export BK_EXAMINATION="QuasiLiveness"
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 PolyORBLF-PT-S02J06T06, 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 r298-tajo-171654455000152"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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