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.r601-tall-171774424200319.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 greatspnxred
Input is BlocksWorld-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774424200319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 132M
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 8.3M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 21M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 60K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 184K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2M Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 4.7M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 162K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 388K 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 11M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-00
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-01
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-02
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-03
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-04
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-05
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-06
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-07
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-08
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-09
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-10
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-11
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-12
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-13
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-14
FORMULA_NAME BlocksWorld-PT-20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717796510932

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 21:41:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 21:41:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 21:41:52] [INFO ] Load time of PNML (sax parser for PT used): 665 ms
[2024-06-07 21:41:52] [INFO ] Transformed 10711 places.
[2024-06-07 21:41:53] [INFO ] Transformed 21013 transitions.
[2024-06-07 21:41:53] [INFO ] Found NUPN structural information;
[2024-06-07 21:41:53] [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, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61, pred_on_table_62, pred_on_table_63, pred_on_table_64, pred_on_table_65, pred_on_table_66, pred_on_table_67, pred_on_table_68, pred_on_table_69, pred_on_table_70, pred_on_table_71, pred_on_table_72, pred_on_table_73, pred_on_table_74, pred_on_table_75, pred_on_table_76, pred_on_table_77, pred_on_table_78, pred_on_table_79, pred_on_table_80, pred_on_table_81, pred_on_table_82, pred_on_table_83, pred_on_table_84, pred_on_table_85, pred_on_table_86, pred_on_table_87, pred_on_table_88, pred_on_table_89, pred_on_table_90, pred_on_table_91, pred_on_table_92, pred_on_table_93, pred_on_table_94, pred_on_table_95, pred_on_table_96, pred_on_table_97, pred_on_table_98, pred_on_table_99, pred_on_table_100, pred_on_table_101]
[2024-06-07 21:41:53] [INFO ] Parsed PT model containing 10711 places and 21013 transitions and 105048 arcs in 918 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 711 ms.
Working with output stream class java.io.PrintStream
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (8 resets) in 12501 ms. (3 steps per ms) remains 10/12 properties
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1592 ms. (25 steps per ms) remains 10/10 properties
BEST_FIRST walk for 16266 steps (4 resets) in 20039 ms. (0 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1704 ms. (23 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1271 ms. (31 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1255 ms. (31 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 934 ms. (42 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 941 ms. (42 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1054 ms. (37 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 881 ms. (45 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 872 ms. (45 steps per ms) remains 10/10 properties
// Phase 1: matrix 21013 rows 10711 cols
[2024-06-07 21:42:05] [INFO ] Computed 205 invariants in 365 ms
[2024-06-07 21:42:06] [INFO ] State equation strengthened by 185 read => feed constraints.
Problem BlocksWorld-PT-20-ReachabilityFireability-2024-02 is UNSAT
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-20-ReachabilityFireability-2024-08 is UNSAT
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-20-ReachabilityFireability-2024-09 is UNSAT
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-20-ReachabilityFireability-2024-12 is UNSAT
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10711 variables, 205/205 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10711 variables, 0/205 constraints. Problems are: Problem set: 4 solved, 6 unsolved
SMT process timed out in 28083ms, After SMT, problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 343 out of 10711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10711/10711 places, 21013/21013 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 10711 transition count 21012
Applied a total of 1 rules in 264738 ms. Remains 10711 /10711 variables (removed 0) and now considering 21012/21013 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264781 ms. Remains : 10711/10711 places, 21012/21013 transitions.
RANDOM walk for 40000 steps (8 resets) in 10043 ms. (3 steps per ms) remains 4/6 properties
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-20-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1111 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1365 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 950 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 928 ms. (43 steps per ms) remains 4/4 properties
// Phase 1: matrix 21012 rows 10711 cols
[2024-06-07 21:47:02] [INFO ] Computed 205 invariants in 154 ms
[2024-06-07 21:47:02] [INFO ] State equation strengthened by 184 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10370/10711 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10711 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21012/31723 variables, 10711/10916 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31723 variables, 184/11100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31723 variables, 0/11100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/31723 variables, 0/11100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31723/31723 variables, and 11100 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36761 ms.
Refiners :[Positive P Invariants (semi-flows): 205/205 constraints, State Equation: 10711/10711 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10370/10711 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 21:48:04] [INFO ] Deduced a trap composed of 1804 places in 21946 ms of which 407 ms to minimize.
[2024-06-07 21:48:24] [INFO ] Deduced a trap composed of 2448 places in 19391 ms of which 52 ms to minimize.
[2024-06-07 21:48:27] [INFO ] Deduced a trap composed of 1260 places in 3219 ms of which 22 ms to minimize.
SMT process timed out in 85482ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 341 out of 10711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10711/10711 places, 21012/21012 transitions.
Applied a total of 0 rules in 197735 ms. Remains 10711 /10711 variables (removed 0) and now considering 21012/21012 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197735 ms. Remains : 10711/10711 places, 21012/21012 transitions.
[2024-06-07 21:51:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 15 ms.
[2024-06-07 21:51:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10711 places, 21012 transitions and 104856 arcs took 89 ms.
[2024-06-07 21:51:47] [INFO ] Flatten gal took : 1043 ms
Total runtime 594961 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BlocksWorld-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 10711
TRANSITIONS: 21012
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.560s, Sys 0.028s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.083s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 582
MODEL NAME: /home/mcc/execution/413/model
10711 places, 21012 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717797479518

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
Error in allocating array of size 65536 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 65536 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 65536 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 BlocksWorld-PT-20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r601-tall-171774424200319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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