Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r028-smll-174853774400023.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is BlocksWorld-PT-05, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-smll-174853774400023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 172K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 995K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 783K May 29 14:32 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 1748542644013

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:17:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 18:17:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:17:27] [INFO ] Load time of PNML (sax parser for PT used): 452 ms
[2025-05-29 18:17:27] [INFO ] Transformed 869 places.
[2025-05-29 18:17:27] [INFO ] Transformed 1625 transitions.
[2025-05-29 18:17:27] [INFO ] Found NUPN structural information;
[2025-05-29 18:17:27] [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]
[2025-05-29 18:17:27] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 728 ms.
RANDOM walk for 40000 steps (8 resets) in 4910 ms. (8 steps per ms) remains 28/869 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
// Phase 1: matrix 1625 rows 869 cols
[2025-05-29 18:17:29] [INFO ] Computed 57 invariants in 50 ms
[2025-05-29 18:17:29] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 840/868 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/869 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2493/2494 variables, and 970 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5073 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 840/868 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 29 places in 1657 ms of which 137 ms to minimize.
[2025-05-29 18:17:38] [INFO ] Deduced a trap composed of 29 places in 1182 ms of which 10 ms to minimize.
[2025-05-29 18:17:39] [INFO ] Deduced a trap composed of 29 places in 1126 ms of which 9 ms to minimize.
[2025-05-29 18:17:40] [INFO ] Deduced a trap composed of 29 places in 1262 ms of which 14 ms to minimize.
SMT process timed out in 11105ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1625/1625 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 869 transition count 1624
Applied a total of 1 rules in 3308 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1625 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3327 ms. Remains : 869/869 places, 1624/1625 transitions.
RANDOM walk for 3826934 steps (8 resets) in 120004 ms. (31 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2570 ms. (155 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2867 ms. (139 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2396 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2356 ms. (169 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2065 ms. (193 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2104 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2051 ms. (194 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2072 ms. (192 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2088 ms. (191 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2103 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2054 ms. (194 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2075 ms. (192 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2090 ms. (191 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2101 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2085 ms. (191 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2068 ms. (193 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2111 ms. (189 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2087 ms. (191 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2061 ms. (193 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2056 ms. (194 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2077 ms. (192 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2056 ms. (194 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2105 ms. (189 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2089 ms. (191 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2038 ms. (196 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2060 ms. (194 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2063 ms. (193 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2115 ms. (189 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 5637823 steps, run timeout after 135001 ms. (steps per millisecond=41 ) properties seen :0 out of 28
Probabilistic random walk after 5637823 steps, saw 4827159 distinct states, run finished after 135021 ms. (steps per millisecond=41 ) properties seen :0
// Phase 1: matrix 1624 rows 869 cols
[2025-05-29 18:20:44] [INFO ] Computed 57 invariants in 13 ms
[2025-05-29 18:20:44] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 840/868 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/869 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 970 constraints, problems are : Problem set: 0 solved, 28 unsolved in 7299 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 840/868 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-05-29 18:20:53] [INFO ] Deduced a trap composed of 29 places in 1270 ms of which 8 ms to minimize.
[2025-05-29 18:20:54] [INFO ] Deduced a trap composed of 29 places in 1161 ms of which 13 ms to minimize.
[2025-05-29 18:20:56] [INFO ] Deduced a trap composed of 29 places in 1296 ms of which 10 ms to minimize.
[2025-05-29 18:20:57] [INFO ] Deduced a trap composed of 29 places in 1182 ms of which 13 ms to minimize.
[2025-05-29 18:20:58] [INFO ] Deduced a trap composed of 29 places in 1095 ms of which 12 ms to minimize.
[2025-05-29 18:20:59] [INFO ] Deduced a trap composed of 29 places in 1008 ms of which 10 ms to minimize.
[2025-05-29 18:21:00] [INFO ] Deduced a trap composed of 29 places in 904 ms of which 8 ms to minimize.
[2025-05-29 18:21:01] [INFO ] Deduced a trap composed of 29 places in 810 ms of which 8 ms to minimize.
[2025-05-29 18:21:02] [INFO ] Deduced a trap composed of 29 places in 816 ms of which 9 ms to minimize.
[2025-05-29 18:21:02] [INFO ] Deduced a trap composed of 29 places in 715 ms of which 8 ms to minimize.
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 29 places in 737 ms of which 9 ms to minimize.
[2025-05-29 18:21:05] [INFO ] Deduced a trap composed of 29 places in 1266 ms of which 12 ms to minimize.
[2025-05-29 18:21:06] [INFO ] Deduced a trap composed of 29 places in 1257 ms of which 12 ms to minimize.
[2025-05-29 18:21:07] [INFO ] Deduced a trap composed of 29 places in 1118 ms of which 12 ms to minimize.
[2025-05-29 18:21:08] [INFO ] Deduced a trap composed of 29 places in 1068 ms of which 10 ms to minimize.
[2025-05-29 18:21:09] [INFO ] Deduced a trap composed of 29 places in 849 ms of which 9 ms to minimize.
Problem smplace_85 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 24723ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
Applied a total of 0 rules in 2664 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2665 ms. Remains : 869/869 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
Applied a total of 0 rules in 1943 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2025-05-29 18:21:14] [INFO ] Invariant cache hit.
[2025-05-29 18:21:15] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2025-05-29 18:21:15] [INFO ] Invariant cache hit.
[2025-05-29 18:21:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-29 18:21:18] [INFO ] Implicit Places using invariants and state equation in 3289 ms returned []
Implicit Place search using SMT with State Equation took 4579 ms to find 0 implicit places.
[2025-05-29 18:21:18] [INFO ] Redundant transitions in 222 ms returned []
Running 1618 sub problems to find dead transitions.
[2025-05-29 18:21:18] [INFO ] Invariant cache hit.
[2025-05-29 18:21:18] [INFO ] State equation strengthened by 44 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1622 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/863 variables, 46/46 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/2493 variables, and 46 constraints, problems are : Problem set: 46 solved, 1572 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 1595/812 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 6/6 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2493 variables, and 6 constraints, problems are : Problem set: 46 solved, 1572 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 6/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 783/812 constraints, Known Traps: 0/0 constraints]
After SMT, in 74644ms problems are : Problem set: 46 solved, 1572 unsolved
Search for dead transitions found 46 dead transitions in 74702ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 869/869 places, 1578/1624 transitions.
Deduced a syphon composed of 23 places in 2 ms
Applied a total of 0 rules in 2240 ms. Remains 869 /869 variables (removed 0) and now considering 1578/1578 (removed 0) transitions.
[2025-05-29 18:22:35] [INFO ] Redundant transitions in 134 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 83860 ms. Remains : 869/869 places, 1578/1624 transitions.
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 309248 ms.
ITS solved all properties within timeout

BK_STOP 1748542956039

--------------------
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-05"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is BlocksWorld-PT-05, 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 r028-smll-174853774400023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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