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-171654454900148.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-S02J04T10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654454900148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.5K 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 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 906K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717103726614

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:15:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 21:15:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:15:29] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2024-05-30 21:15:29] [INFO ] Transformed 752 places.
[2024-05-30 21:15:29] [INFO ] Transformed 1572 transitions.
[2024-05-30 21:15:29] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 454 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40001 steps (10 resets) in 4621 ms. (8 steps per ms) remains 22/752 properties
BEST_FIRST walk for 4002 steps (8 resets) in 152 ms. (26 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 151 ms. (26 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 116 ms. (34 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 78 ms. (50 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 86 ms. (45 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
[2024-05-30 21:15:31] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-30 21:15:31] [INFO ] Computed 54 invariants in 163 ms
[2024-05-30 21:15:31] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 97/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/121 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 575/696 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 14/710 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/710 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 40/750 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/2144 variables, and 53 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5082 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 97/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/121 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 575/696 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-30 21:15:42] [INFO ] Deduced a trap composed of 241 places in 1455 ms of which 77 ms to minimize.
SMT process timed out in 11005ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 182 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 342 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 7 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 542 place count 480 transition count 1142
Applied a total of 542 rules in 477 ms. Remains 480 /752 variables (removed 272) and now considering 1142/1412 (removed 270) transitions.
Running 1140 sub problems to find dead transitions.
[2024-05-30 21:15:43] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2024-05-30 21:15:43] [INFO ] Computed 52 invariants in 32 ms
[2024-05-30 21:15:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2024-05-30 21:15:56] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2024-05-30 21:15:56] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 2 ms to minimize.
[2024-05-30 21:15:56] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 16 ms to minimize.
[2024-05-30 21:15:56] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-30 21:15:56] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2024-05-30 21:15:56] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 10 ms to minimize.
[2024-05-30 21:15:57] [INFO ] Deduced a trap composed of 39 places in 1130 ms of which 24 ms to minimize.
[2024-05-30 21:15:58] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-05-30 21:15:58] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-30 21:15:58] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 1 ms to minimize.
[2024-05-30 21:15:58] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 2 ms to minimize.
[2024-05-30 21:15:59] [INFO ] Deduced a trap composed of 89 places in 374 ms of which 9 ms to minimize.
[2024-05-30 21:16:00] [INFO ] Deduced a trap composed of 312 places in 358 ms of which 5 ms to minimize.
[2024-05-30 21:16:00] [INFO ] Deduced a trap composed of 288 places in 356 ms of which 6 ms to minimize.
[2024-05-30 21:16:01] [INFO ] Deduced a trap composed of 286 places in 349 ms of which 7 ms to minimize.
[2024-05-30 21:16:04] [INFO ] Deduced a trap composed of 206 places in 385 ms of which 6 ms to minimize.
[2024-05-30 21:16:04] [INFO ] Deduced a trap composed of 239 places in 294 ms of which 4 ms to minimize.
[2024-05-30 21:16:06] [INFO ] Deduced a trap composed of 178 places in 381 ms of which 6 ms to minimize.
[2024-05-30 21:16:06] [INFO ] Deduced a trap composed of 170 places in 370 ms of which 6 ms to minimize.
SMT process timed out in 23205ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 23250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23755 ms. Remains : 480/752 places, 1142/1412 transitions.
RANDOM walk for 4000000 steps (1449 resets) in 66947 ms. (59 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (48 resets) in 3168 ms. (126 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (47 resets) in 2711 ms. (147 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (67 resets) in 2784 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (47 resets) in 2749 ms. (145 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (52 resets) in 2868 ms. (139 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (65 resets) in 2982 ms. (134 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (46 resets) in 2941 ms. (135 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (62 resets) in 2917 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (56 resets) in 2931 ms. (136 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (64 resets) in 2745 ms. (145 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (56 resets) in 2828 ms. (141 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (54 resets) in 2873 ms. (139 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (47 resets) in 2839 ms. (140 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (44 resets) in 2841 ms. (140 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (65 resets) in 2735 ms. (146 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (51 resets) in 2931 ms. (136 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (60 resets) in 2884 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (44 resets) in 2968 ms. (134 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (61 resets) in 2824 ms. (141 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400000 steps (47 resets) in 2837 ms. (140 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (64 resets) in 2685 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (57 resets) in 2764 ms. (144 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 2751828 steps, run timeout after 132001 ms. (steps per millisecond=20 ) properties seen :0 out of 22
Probabilistic random walk after 2751828 steps, saw 1702566 distinct states, run finished after 132024 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-30 21:19:03] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-30 21:19:03] [INFO ] Invariant cache hit.
[2024-05-30 21:19:03] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 19/427 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 50/477 variables, 28/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 1/478 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1122/1600 variables, 478/529 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1600 variables, 120/649 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1600 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 2/1602 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1602 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1602 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/1602 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1602/1602 variables, and 652 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3115 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 480/480 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 331/408 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-30 21:19:09] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 3 ms to minimize.
[2024-05-30 21:19:09] [INFO ] Deduced a trap composed of 206 places in 288 ms of which 4 ms to minimize.
[2024-05-30 21:19:09] [INFO ] Deduced a trap composed of 214 places in 233 ms of which 3 ms to minimize.
[2024-05-30 21:19:10] [INFO ] Deduced a trap composed of 206 places in 259 ms of which 3 ms to minimize.
[2024-05-30 21:19:10] [INFO ] Deduced a trap composed of 222 places in 282 ms of which 3 ms to minimize.
[2024-05-30 21:19:10] [INFO ] Deduced a trap composed of 223 places in 274 ms of which 3 ms to minimize.
[2024-05-30 21:19:11] [INFO ] Deduced a trap composed of 217 places in 253 ms of which 2 ms to minimize.
[2024-05-30 21:19:11] [INFO ] Deduced a trap composed of 226 places in 286 ms of which 2 ms to minimize.
[2024-05-30 21:19:11] [INFO ] Deduced a trap composed of 211 places in 243 ms of which 3 ms to minimize.
[2024-05-30 21:19:11] [INFO ] Deduced a trap composed of 209 places in 278 ms of which 3 ms to minimize.
[2024-05-30 21:19:12] [INFO ] Deduced a trap composed of 199 places in 259 ms of which 3 ms to minimize.
[2024-05-30 21:19:12] [INFO ] Deduced a trap composed of 206 places in 281 ms of which 8 ms to minimize.
[2024-05-30 21:19:12] [INFO ] Deduced a trap composed of 218 places in 221 ms of which 2 ms to minimize.
[2024-05-30 21:19:13] [INFO ] Deduced a trap composed of 215 places in 202 ms of which 3 ms to minimize.
[2024-05-30 21:19:13] [INFO ] Deduced a trap composed of 222 places in 196 ms of which 5 ms to minimize.
[2024-05-30 21:19:13] [INFO ] Deduced a trap composed of 254 places in 243 ms of which 3 ms to minimize.
[2024-05-30 21:19:13] [INFO ] Deduced a trap composed of 209 places in 229 ms of which 2 ms to minimize.
[2024-05-30 21:19:14] [INFO ] Deduced a trap composed of 218 places in 224 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 19/427 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 50/477 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-30 21:19:15] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-05-30 21:19:15] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 4 ms to minimize.
[2024-05-30 21:19:16] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 2 ms to minimize.
[2024-05-30 21:19:16] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-05-30 21:19:16] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-30 21:19:16] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2024-05-30 21:19:16] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-30 21:19:16] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-30 21:19:16] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-30 21:19:17] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1/478 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 1122/1600 variables, 478/557 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1600 variables, 120/677 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem smplace_234 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 28199ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 6436 ms.
Support contains 22 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 35 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 480/480 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 1142/1142 transitions.
Applied a total of 0 rules in 33 ms. Remains 480 /480 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2024-05-30 21:19:38] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
[2024-05-30 21:19:38] [INFO ] Invariant cache hit.
[2024-05-30 21:19:39] [INFO ] Implicit Places using invariants in 885 ms returned [3, 58, 120, 171, 248, 276, 333, 364, 372, 429]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 902 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/480 places, 1142/1142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 461 transition count 1133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 461 transition count 1133
Applied a total of 18 rules in 58 ms. Remains 461 /470 variables (removed 9) and now considering 1133/1142 (removed 9) transitions.
[2024-05-30 21:19:39] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
// Phase 1: matrix 1113 rows 461 cols
[2024-05-30 21:19:39] [INFO ] Computed 42 invariants in 36 ms
[2024-05-30 21:19:39] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-30 21:19:39] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-05-30 21:19:39] [INFO ] Invariant cache hit.
[2024-05-30 21:19:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-30 21:19:50] [INFO ] Implicit Places using invariants and state equation in 10625 ms returned []
Implicit Place search using SMT with State Equation took 11193 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/480 places, 1133/1142 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12189 ms. Remains : 461/480 places, 1133/1142 transitions.
Total runtime 261533 ms.
ITS solved all properties within timeout

BK_STOP 1717103990745

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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-S02J04T10"
export BK_EXAMINATION="StableMarking"
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-S02J04T10, examination is StableMarking"
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-171654454900148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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