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.r616-tall-171774433000143.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 ltsminxred
Input is BlocksWorld-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r616-tall-171774433000143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 26M
-rw-r--r-- 1 mcc users 534K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 500K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 258K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.3M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.8M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.4M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 41K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 97K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 2.3M Jun 7 06:26 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 1717775753130

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 15:55:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-07 15:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 15:55:54] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2024-06-07 15:55:54] [INFO ] Transformed 2449 places.
[2024-06-07 15:55:54] [INFO ] Transformed 4705 transitions.
[2024-06-07 15:55:54] [INFO ] Found NUPN structural information;
[2024-06-07 15:55:54] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47]
[2024-06-07 15:55:54] [INFO ] Parsed PT model containing 2449 places and 4705 transitions and 23506 arcs in 439 ms.
RANDOM walk for 40000 steps (8 resets) in 7730 ms. (5 steps per ms) remains 84/2449 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4001 steps (8 resets) in 71 ms. (55 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 84/84 properties
// Phase 1: matrix 4705 rows 2449 cols
[2024-06-07 15:55:58] [INFO ] Computed 97 invariants in 71 ms
[2024-06-07 15:55:58] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 2364/2448 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2448 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/2449 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2449/7154 variables, and 97 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5082 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 0/2449 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 2364/2448 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-07 15:56:06] [INFO ] Deduced a trap composed of 49 places in 2389 ms of which 122 ms to minimize.
[2024-06-07 15:56:08] [INFO ] Deduced a trap composed of 49 places in 2396 ms of which 30 ms to minimize.
SMT process timed out in 10724ms, After SMT, problems are : Problem set: 0 solved, 84 unsolved
Fused 84 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 84 out of 2449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2449/2449 places, 4705/4705 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2449 transition count 4704
Applied a total of 1 rules in 18139 ms. Remains 2449 /2449 variables (removed 0) and now considering 4704/4705 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18150 ms. Remains : 2449/2449 places, 4704/4705 transitions.
RANDOM walk for 2315559 steps (4 resets) in 120004 ms. (19 steps per ms) remains 48/84 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2963 ms. (134 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3000 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3052 ms. (131 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3086 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3707 ms. (107 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2921 ms. (136 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2990 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3434 ms. (116 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3970 ms. (100 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3855 ms. (103 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3884 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 4080 ms. (98 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3972 ms. (100 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3092 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3171 ms. (126 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3113 ms. (128 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3112 ms. (128 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3140 ms. (127 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2951 ms. (135 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3264 ms. (122 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3050 ms. (131 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2969 ms. (134 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3002 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2974 ms. (134 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2999 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3014 ms. (132 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3295 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2970 ms. (134 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2990 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3083 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3053 ms. (130 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2973 ms. (134 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3000 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3096 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3835 ms. (104 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2910 ms. (137 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3112 ms. (128 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3153 ms. (126 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3054 ms. (130 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2997 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3106 ms. (128 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3099 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3070 ms. (130 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2963 ms. (134 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2992 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3049 ms. (131 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3020 ms. (132 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2969 ms. (134 steps per ms) remains 48/48 properties
// Phase 1: matrix 4704 rows 2449 cols
[2024-06-07 15:57:38] [INFO ] Computed 97 invariants in 44 ms
[2024-06-07 15:57:38] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 2400/2448 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2448 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/2449 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2449 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 4704/7153 variables, 2449/2546 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7153 variables, 90/2636 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7153 variables, 0/2636 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/7153 variables, 0/2636 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7153/7153 variables, and 2636 constraints, problems are : Problem set: 0 solved, 48 unsolved in 16835 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 2449/2449 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 2400/2448 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-07 15:57:57] [INFO ] Deduced a trap composed of 49 places in 2427 ms of which 17 ms to minimize.
[2024-06-07 15:58:00] [INFO ] Deduced a trap composed of 49 places in 2393 ms of which 16 ms to minimize.
[2024-06-07 15:58:02] [INFO ] Deduced a trap composed of 49 places in 2354 ms of which 15 ms to minimize.
[2024-06-07 15:58:04] [INFO ] Deduced a trap composed of 49 places in 2205 ms of which 14 ms to minimize.
[2024-06-07 15:58:07] [INFO ] Deduced a trap composed of 49 places in 2303 ms of which 14 ms to minimize.
[2024-06-07 15:58:09] [INFO ] Deduced a trap composed of 49 places in 2125 ms of which 16 ms to minimize.
[2024-06-07 15:58:11] [INFO ] Deduced a trap composed of 49 places in 2066 ms of which 16 ms to minimize.
[2024-06-07 15:58:13] [INFO ] Deduced a trap composed of 49 places in 2032 ms of which 15 ms to minimize.
[2024-06-07 15:58:15] [INFO ] Deduced a trap composed of 49 places in 1936 ms of which 14 ms to minimize.
[2024-06-07 15:58:17] [INFO ] Deduced a trap composed of 49 places in 1874 ms of which 14 ms to minimize.
[2024-06-07 15:58:19] [INFO ] Deduced a trap composed of 49 places in 1838 ms of which 13 ms to minimize.
[2024-06-07 15:58:21] [INFO ] Deduced a trap composed of 49 places in 1854 ms of which 13 ms to minimize.
[2024-06-07 15:58:23] [INFO ] Deduced a trap composed of 49 places in 1812 ms of which 14 ms to minimize.
[2024-06-07 15:58:24] [INFO ] Deduced a trap composed of 49 places in 1633 ms of which 13 ms to minimize.
[2024-06-07 15:58:26] [INFO ] Deduced a trap composed of 49 places in 1571 ms of which 13 ms to minimize.
[2024-06-07 15:58:28] [INFO ] Deduced a trap composed of 49 places in 1755 ms of which 13 ms to minimize.
[2024-06-07 15:58:29] [INFO ] Deduced a trap composed of 49 places in 1745 ms of which 14 ms to minimize.
[2024-06-07 15:58:31] [INFO ] Deduced a trap composed of 49 places in 1552 ms of which 12 ms to minimize.
[2024-06-07 15:58:33] [INFO ] Deduced a trap composed of 49 places in 1428 ms of which 12 ms to minimize.
[2024-06-07 15:58:34] [INFO ] Deduced a trap composed of 49 places in 1431 ms of which 15 ms to minimize.
Problem smplace_341 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 56370ms, After SMT, problems are : Problem set: 0 solved, 48 unsolved
Fused 48 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 48 out of 2449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2449/2449 places, 4704/4704 transitions.
Applied a total of 0 rules in 14098 ms. Remains 2449 /2449 variables (removed 0) and now considering 4704/4704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14098 ms. Remains : 2449/2449 places, 4704/4704 transitions.
Total runtime 174297 ms.
ITS solved all properties within timeout

BK_STOP 1717775928680

--------------------
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 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="BlocksWorld-PT-09"
export BK_EXAMINATION="StableMarking"
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 BlocksWorld-PT-09, 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 r616-tall-171774433000143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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